Implementing The Levenshtein Distance in Python
The Levenshtein distance is a text similarity measure that compares two words and returns a numeric value representing the distance between them. The distance reflects the total number of single-character edits required to transform one word into another. The more similar the two words are the less distance between them, and vice versa. One common use for this distance is in the autocompletion or autocorrection features of text processors or chat applications.
Source: Implementing The Levenshtein Distance in Python, an article by Ahmed Fawzy Gad.