Measure the difference between two strings using the Levenshtein distance algorithm
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Uses Levenshtein Distance to find the closest string match or matches in an array
Simply sort by similarity, starring Levenshtein via leven