Levenshtein Distance is an algorithmic way to compare the similarity of two strings. For more information about it and its uses, check out this wikipedia page: https://en.wikipedia.org/wiki/Levenshtein_distance
I used the algorithm from this website: https://people.cs.pitt.edu/~kirk/cs1501/Pruhs/Spring2006/assignments/editdistance/Levenshtein%20Distance.htm I created my own matrix methods for the distance calculation
