Module syntax::util::lev_distance

Functions

find_best_match_for_name	To find the best match for a given string from an iterator of names As a loose rule to avoid the obviously incorrect suggestions, it takes an optional limit for the maximum allowable edit distance, which defaults to one-third of the given word. Besides Levenshtein, we use case insensitive comparison to improve accuracy on an edge case with a lower(upper)case letters mismatch.
lev_distance	To find the Levenshtein distance between two strings