搜索资源列表
Levenshtein
- Algorithm Levenstein and recursive version this algorithm
Levenstein
- Levenstein Coding MATLAB (by Marcos B, BSD license)
editLenth
- 编辑距离算法的python源码,编辑距离，又称Levenshtein距离（也叫做Edit Distance），是指两个字串之间由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符，插入一个字符，删除一个字符。-Levenshtein Distance Algorithm s python version The Levenshtein distance between two strings is d
Spell_checker
- Spell -cheker implemented in C++ using Levenstein distance and a 8000 words dictionary.
levenstein
- java实现编辑距离计算，简单易懂levenstain算法-java implementation edit distance calculation algorithm is simple and understandable levenstain