| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cerrier (0) - 1 freq cerries (1) - 3 freq cerried (1) - 3 freq carrier (1) - 15 freq merrier (1) - 4 freq terrier (1) - 13 freq ferrier (1) - 6 freq verrier (1) - 1 freq herried (2) - 4 freq terrie (2) - 2 freq crier (2) - 2 freq nerrer (2) - 2 freq earrier (2) - 1 freq serried (2) - 1 freq carried (2) - 35 freq berries (2) - 26 freq perrie (2) - 1 freq ferrer (2) - 8 freq kerries (2) - 8 freq currie (2) - 1 freq worrier (2) - 1 freq curried (2) - 2 freq merrie (2) - 7 freq furrier (2) - 1 freq corries (2) - 15 freq |
cerrier (0) - 1 freq carrier (1) - 15 freq ferrier (2) - 6 freq cairrier (2) - 13 freq terrier (2) - 13 freq verrier (2) - 1 freq cerries (2) - 3 freq merrier (2) - 4 freq cerried (2) - 3 freq barrier (3) - 13 freq carriers (3) - 2 freq carries (3) - 10 freq harrier (3) - 2 freq courier (3) - 6 freq curries (3) - 7 freq cairier (3) - 1 freq carriet (3) - 15 freq corrour (3) - 1 freq cherrie (3) - 3 freq corries (3) - 15 freq corrie (3) - 55 freq carrie (3) - 11 freq tarrier (3) - 1 freq farrier (3) - 2 freq ferrer (3) - 8 freq |
SoundEx code - C660 career - 66 freq courier - 6 freq cairrier - 13 freq crier - 2 freq corer - 1 freq carrier - 15 freq carer - 10 freq cerrier - 1 freq 'career - 1 freq cairier - 1 freq €™career - 1 freq corrour - 1 freq |
MetaPhone code - SRR sairrer - 1 freq sor-ree - 2 freq cerrier - 1 freq sairer - 6 freq surer' - 1 freq seerer - 1 freq zrohr - 1 freq |
CERRIER |
| Time to execute Levenshtein function - 0.591686 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.927135 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.078077 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.115851 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000900 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |