Have you ever wanted to compare strings that were referring to the same thing, but they were written slightly different, maybe had typos or were misspelled? This is called Fuzzy String Matching, and we can accomplish a lot using a Python library that provide a nice metric to do this: The Levenshtein Distance.
I came across this by chance in a job application task, but I'm excited to be able to explore the use of this metric further.
Here is the thing, given a table with dog names in Zurich, the goal is to find all names that have a Levenshtein distance of 1 to "Luca", Let's find Luca then! 🐶
You can try this task interactively at the following Binder link
