close
http://en.wikipedia.org/wiki/Edit_distance
In information theory and computer science, the edit distance between two strings of characters
is the number of operations required to transform one of them into the
other. There are several different algorithms to define or calculate
this metric:
- Hamming distance
- Levenshtein distance
- Damerau–Levenshtein distance
- Jaro-Winkler distance
- Wagner-Fischer edit distance
- Ukkonen
- Hirschberg's algorithm
全站熱搜
留言列表
研究成果 (2)
