Algorithms for measuring similarity between strings, used in spell checking, DNA sequencing, plagiarism detection, and fuzzy matching.

1. Levenshtein Distance (Edit Distance) Minimum number of single-character edits (insertions, deletions, substitutions) to transform one string into another. How It Works Core Idea: …