Find the best match for a token word with dictionary via min edit distance and levenshtein You can set coef=2 as default value is, and find best match via levenshtein algorithm Also in this code you can find back track matrix and distance matrix for pairs of words