Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.
Informally, the Damerau–Levenshtein distance between two words is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one word into the other.
In computer science and statistics, the Jaro–Winkler distance is a string metric measuring an edit distance between two sequences.
https://rosettacode.org/wiki/Levenshtein_distance
https://rosettacode.org/wiki/Jaro_distance