Module str

Module str 

Source
Expand description

Helper functions providing the default implementation of distance/similarity algorithms for strings.

See also textdistance::nstr for normalized distance.

Functions§

bag
Calculate Bag distance for two strings.
cosine
Calculate Cosine normalized similarity for two strings.
damerau_levenshtein
Calculate unrestricted Damerau-Levenshtein distance for two strings.
damerau_levenshtein_restricted
Calculate restricted Damerau-Levenshtein distance for two strings.
entropy_ncd
Calculate Entropy-based normalized compression distance for two strings.
hamming
Calculate Hamming distance for two strings.
jaccard
Calculate Jaccard normalized similarity for two strings.
jaro
Calculate Jaro normalized similarity for two strings.
jaro_winkler
Calculate Jaro-Winkler normalized similarity for two strings.
lcsseq
Calculate the length of the Longest Common SubSequence for two strings.
lcsstr
Calculate the length of the Longest Common SubString for two strings.
length
Calculate length distance for two strings.
levenshtein
Calculate Levenshtein distance for two strings.
lig3
Calculate LIG3 normalization of Hamming by Levenshtein for two strings.
mlipns
Calculate MLIPNS normalization of Hamming for two strings.
overlap
Calculate Overlap normalized similarity for two strings.
prefix
Calculate common prefix length for two strings.
ratcliff_obershelp
Calculate Ratcliff-Obershelp normalized similarity for two strings.
roberts
Calculate Roberts similarity for two strings.
sift4_common
Calculate Sift4 distance for two strings using the “common” algorithm.
sift4_simple
Calculate Sift4 distance for two strings using the “simplest” algorithm.
smith_waterman
Calculate Smith-Waterman similarity for two strings.
sorensen_dice
Calculate Sørensen–Dice normalized similarity for two strings.
suffix
Calculate common suffix length for two strings.
tversky
Calculate Tversky normalized similarity for two strings.
yujian_bo
Calculate Yujian-Bo normalization of Levenshtein for two strings.