Levenshtein Distance
← Back to Edit Distance
The minimum number of single-character edits (insertions, deletions, substitutions) to transform one string into another. Computed via dynamic programming in O(mn) time and space. The most common measure of string similarity.