Edit distance
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 ways to define an edit distance, and there are algorithms to calculate its value under various definitions. See:
- Hamming distance
- Levenshtein distance
- Damerau–Levenshtein distance
- Jaro-Winkler distance
- Wagner-Fischer edit distance
- Ukkonen's algorithm
- Hirschberg's algorithm
[edit] See also
[edit] External links
- Text::WagnerFischer, a Perl implementation of the Wagner-Fischer edit distance
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
