4 ms·
Levenshtein distance, a dynamic programming algorithm for determining the edit distance between two sequences - the number of insertions, deletions or substitut
by ishi 8y ago
Levenshtein distance, a dynamic programming algorithm for determining the edit distance between two sequences - the number of insertions, deletions or substitutions required to convert one sequence to the other.
https://en.wikipedia.org/wiki/Levenshtein_distance https://en.wikipedia.org/wiki/Levenshtein_distance
- jhallenworld 8y agoGosling used a variant of it to optimize screen updates in emacs.
- Doxin 8y agoInterestingly enough Levenshtein can also be implemented as an A* variation iirc.