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