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