malcolm-sheridanLevenshtein distance (LD) is a measure of the similarity between two strings, which we will refer to as the source string (s) and the target string (t). The distance is the number of deletions, insertions, or substitutions required to transform s into t.
Package detail
levenstein
A micro library that returns the Levenshtein distance bewteen lists of strings