The Levenshtein Distance is a method of comparing two strings, via a recursive function that looks for 3 transformations, each one adds one to the total ‘distance’ This is very useful as a basic metric for comparing strings against a target. I’m aimimg to use it in my exploration of fuzzy string matching as a metric. Transformations Overview Insertions If the source string has to add new characters to match the target string