ai algorithm algorithms computer development dynamic_programming edit-distance editdistance fuzzy informatica2 library linguistics pln programming research research_result search string string_edit_distance tc2 work

My tags:

From Wikipedia, the free encyclopedia

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

[edit] See also

• Fuzzy string searching

[edit] External links

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

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