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

See also

• Fuzzy string searching

External links

• Text::WagnerFischer, a Perl implementation of the Wagner-Fischer edit distance

 This computer science-related article is a stub. You can help Wikipedia by expanding it.