CAJ | 학술논문

为了评价数据匹配算法中常用的四种字段匹配算法——Smith-Waterman算法、编辑距离（Edit Distance）、Q-gram算法和Jaro-Winkler算法的效果和表现，本文选取由水稻领域18个重点期刊集成得到的作者和机构数据设计实验，使用Febrl清洗工具包对相似重复记录进行匹配。结果表明，四种算法适用条件不同， Smith-Waterman算法运行时间特别长，但综合表现以及精度和召回率都不错；编辑距离（Edit Distance）性价比比较高；Q-gram算法运算快但召回率低；Jaro-Winkler算法在此例中表现比较差。
위료평개수거필배산법중상용적사충자단필배산법——Smith-Waterman산법、편집거리（Edit Distance）、Q-gram산법화Jaro-Winkler산법적효과화표현，본문선취유수도영역18개중점기간집성득도적작자화궤구수거설계실험，사용Febrl청세공구포대상사중복기록진행필배。결과표명，사충산법괄용조건불동， Smith-Waterman산법운행시간특별장，단종합표현이급정도화소회솔도불착；편집거리（Edit Distance）성개비비교고；Q-gram산법운산쾌단소회솔저；Jaro-Winkler산법재차례중표현비교차。
To evaluate the effect and performance of four field matching algorithms commonly used in data matching——Smith-Waterman algorithm, Edit Distance, Q-gram algorithm and Jaro-Winkler algorithm, we chose authors and institutions information integrated from 18 key journals to design experiments, using Febrl to match approximate records. The results showed that the four algorithms have different applicable conditions. Smith-Waterman algorithm runs a particularly long time, but the overal performance, the precision and recal are good. Edit distance is relatively high cost-effective. Q-gram algorithm runs fast but has low recal . Jaro-Winkler algorithm doesn' t perform wel in this case.