arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.18218cs.AI
收藏

在政治学中利用大型语言模型进行模糊字符串匹配

Leveraging Large Language Models for Fuzzy String Matching in Political Science

Institute for Advanced Study in Social Sciences, Fudan University(复旦大学社会科学高等研究院)

Yu Wang

AI总结:

针对政治学数据合并中因名称不同导致传统模糊匹配失效的问题,提出利用大型语言模型进行直观匹配,实验证明该方法使平均精度最高提升39%且鲁棒性强。

摘要:

当政治学家合并来自不同来源的数据时,模糊字符串匹配仍然是一个关键问题。现有的匹配方法总是依赖于字符串距离,例如 Levenshtein 距离和余弦相似度。因此,它们本质上无法匹配指代同一实体但名称不同的字符串,例如“JP Morgan”和“Chase Bank”、“DPRK”和“North Korea”、“Chuck Fleischmann (R)”和“Charles Fleischmann (R)”。在这封信中,我们提出使用大型语言模型以简单直观的方式完全规避这一问题。大量实验表明,我们提出的方法在平均精度方面最多可将当前最优水平提高 39%,同时对政治学家而言使用起来更加简单直观。此外,我们的结果对各种温度具有鲁棒性。我们进一步指出,增强的提示可以带来额外的性能提升。

英文摘要:

Fuzzy string matching remains a key issue when political scientists combine data from different sources. Existing matching methods invariably rely on string distances, such as Levenshtein distance and cosine similarity. As such, they are inherently incapable of matching strings that refer to the same entity with different names such as ''JP Morgan'' and ''Chase Bank'', ''DPRK'' and ''North Korea'', ''Chuck Fleischmann (R)'' and ''Charles Fleischmann (R)''. In this letter, we propose to use large language models to entirely sidestep this problem in an easy and intuitive manner. Extensive experiments show that our proposed methods can improve the state of the art by as much as 39% in terms of average precision while being substantially easier and more intuitive to use by political scientists. Moreover, our results are robust against various temperatures. We further note that enhanced prompting can lead to additional performance improvements.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑