Jaro winkler vs Levenshtein Distance

Fuzzy Name Matching

The Jaro–Winkler distance is a string metric measuring an edit distance between two sequences.

The lower the Jaro–Winkler distance for two strings is, the more similar the strings are. The score is normalized such that 0 means an exact match and 1 means there is no similarity. The Jaro–Winkler similarity is the inversion, (1 − Jaro–Winkler distance).

Jaro-Winkler Similarity
Jaro-Winkler Similarity — Example

The Levenshtein distance is a string metric for measuring the difference between two sequences. 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.

Levenshtein Distance
Levenshtein Distance — Example
Levenshtein Distance — Dynamic Programming



Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store