MCDMString/sequence distance
Levenshtein距离
Levenshtein距离，也称为编辑距离，衡量将一个字符串转换为另一个字符串所需的单字符编辑（插入、删除、替换）的最小数量。该度量由Vladimir Levenshtein于1966年引入，它是一个真正的度量（满足所有距离属性），在计算语言学、拼写检查、DNA序列比较和记录链接中至关重要。其值范围从0（字符串相同）到较长字符串的长度。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10, 707-710. link ↗
- Damerau, F. J. (1964). A technique for computer detection and correction of spelling errors. Communications of the ACM, 7(3), 171-176. DOI: 10.1145/363958.363994 ↗
如何引用本页
ScholarGate. (2026, June 3). Levenshtein Distance Metric. ScholarGate. https://scholargate.app/zh/decision-making/levenshtein-distance
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →