|
Related articles:
Hamming distance
Dynamic programming
Spell checker
Diff
Metric space
Key terms: code j we k distance string algorithm levenshtein edit operations minimum cost row matrix length substitution levenshtein distance invariant we can transform mathematics similarity two strings upper edit distance text dynamic programming simply matching if we can transform fuzzy string compute hamming distance Search external links cited by footnotes on Wikipedia page Levenshtein distance: |
|