问题描述
根据这评论在相关的主题，我想知道为什么Levenshtein距离为基础的方法比探测法更好。
As per this comment in a related thread, I'd like to know why Levenshtein distance based methods are better than Soundex.
推荐答案
探测法是相当原始 - 它最初是为手算。它导致一个键可以比较的。
Soundex is rather primitive - it was originally developed to be hand calculated. It results in a key that can be compared.
探测法能够很好地处理西方的名字，因为它最初是为美国人口普查数据。它适用于语音比较。
Soundex works well with western names, as it was originally developed for US census data. It's intended for phonetic comparison.
Levenshtein距离着眼于两个值，并产生基于其相似性的值。它在寻找失踪或取代字母。
Levenshtein distance looks at two values and produces a value based on their similarity. It's looking for missing or substituted letters.
基本上探测法对于查找施密特和史密斯夫妇可能是同一姓氏更好。
Basically Soundex is better for finding that "Schmidt" and "Smith" might be the same surname.
Levenshtein距离是为察觉到用户已经输入错误Levnshtein更好; - ）
Levenshtein distance is better for spotting that the user has mistyped "Levnshtein" ;-)
这篇关于VS探测法基于Levenshtein距离的方法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！