Module datafusion_strsim 

Adopted from strsim-rs for string similarity metrics

Structs

StringWrapper 🔒

Functions

generic_levenshtein 🔒

Calculates the minimum number of insertions, deletions, and substitutions required to change one sequence into the other.

levenshtein

Calculates the minimum number of insertions, deletions, and substitutions required to change one string into the other.

normalized_levenshtein

Calculates the normalized Levenshtein distance between two strings. The normalized distance is a value between 0.0 and 1.0, where 1.0 indicates that the strings are identical and 0.0 indicates no similarity.