I want to use string similarity functions to find corrupted data in my database.

I came upon several of them:

  • Jaro,
  • Jaro-Winkler,
  • Levenshtein,
  • Euclidean and
  • Q-gram,

I wanted to know what is the difference between them and in what situations they work best?

levenshtein-distance similarity euclidean-distance jaro-winkler
Edit
Report