Skip to content
Fuzzy text search
Search
Ctrl
K
Cancel
Twitter
GitHub
Select theme
Dark
Light
Auto
Intro
Playground
Measures
Bag distance
Cosine similarity
Damerau-Levenshtein distance
Dice coefficient
Hamming distance
Harmonic edit distance
Jaccard index
Jaccard index, generalized
Jaro similarity
Jaro-Winkler similarity
LCS distance
Levenshtein distance
Marzal-Vidal edit distance
Monge-Elkan similarity
Monge-Elkan similarity, generalized
Otsuka-Ochiai coefficient
Overlap coefficient
Tversky index
Normalisations
Higuera, Mico (normalisation)
Levy et al. (normalisation)
Li, Bo (normalisation)
Notes
Algorithms
B-Tree
Confusion matrix
Edit distance
Ngrams, Qgrams, skip-grams, etc.
Inverted index
Metric measure
Normalised measure
Pairwise alignment
How can we represent a string?
String similarity measure
Term Frequency — Inverse Document Frequency
Twitter
GitHub
Select theme
Dark
Light
Auto
Compare
Similarity of word
abcd
to ...
Examples
Example 1
Example 2
Example 3
Sequence similarity:
Marzal-Vidal
LCS + Higuera-Mico
LCS + Li-Bo
Levenshtein + Levy
Levenshtein + Li-Bo
Levenshtein + Higuera-Mico
Damerau-Levenshtein + Levy
Damerau-Levenshtein + Li-Bo
Damerau-Levenshtein + Higuera-Mico
Jaro
Jaro-Winkler
Groupping:
size
skip
prefix
suffix
padding symbol
Set similarity:
Dice coefficient
Otsuka-Ochiai coefficient
Overlap coefficient
Jaccard index
Bag similarity:
Jaccard index, generalized
Cosine similarity
Bag distance + Levy
Bag distance + Li-Bo
Bag distance + Higuera-Mico
Input:
efgh defgh cdefgh bcdefgh abcdefgh abcdefg abcdef abcde abcd