Module rustc_span::lev_distance

Levenshtein distances.

The Levenshtein distance is a metric for measuring the difference between two strings.

Functions

find_best_match_for_name

Finds the best match for a given word in the given iterator.

find_best_match_for_name_impl 🔒

find_best_match_for_name_with_substrings

Finds the best match for given word in the given iterator where substrings are meaningful.

find_match_by_sorted_words 🔒

lev_distance

Finds the Levenshtein distance between two strings.

lev_distance_with_substrings

Provides a word similarity score between two words that accounts for substrings being more meaningful than a typical Levenshtein distance. The lower the score, the closer the match. 0 is an identical match.

sort_by_words 🔒