| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cairrier (0) - 13 freq cairried (1) - 143 freq cairrie (1) - 35 freq carrier (1) - 15 freq cairriers (1) - 1 freq cairrien (1) - 1 freq cairier (1) - 1 freq cairriet (1) - 70 freq cairries (1) - 36 freq cairrier's (2) - 1 freq nairrie (2) - 1 freq airlier (2) - 16 freq cairties (2) - 1 freq farrier (2) - 2 freq cairied (2) - 12 freq cairnies (2) - 1 freq carriers (2) - 2 freq cairriein (2) - 6 freq nairriet (2) - 1 freq mairriet (2) - 55 freq hairrie (2) - 1 freq sairrie (2) - 3 freq harrier (2) - 2 freq tarrier (2) - 1 freq mairrie (2) - 7 freq |
cairrier (0) - 13 freq carrier (1) - 15 freq cairriet (2) - 70 freq cairier (2) - 1 freq cerrier (2) - 1 freq cairries (2) - 36 freq cairrien (2) - 1 freq cairried (2) - 143 freq cairrie (2) - 35 freq cairriers (2) - 1 freq cairrieaw (3) - 1 freq carriet (3) - 15 freq cairres (3) - 1 freq cairred (3) - 2 freq carried (3) - 35 freq carrie (3) - 11 freq cairter (3) - 1 freq barrier (3) - 13 freq earrier (3) - 1 freq cairrit (3) - 27 freq cairryen (3) - 2 freq carries (3) - 10 freq cairrin (3) - 1 freq sairrer (3) - 1 freq ecairriet (3) - 1 freq |
SoundEx code - C660 career - 65 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 - KRR career - 65 freq courier - 6 freq cairrier - 13 freq crier - 2 freq corer - 1 freq carrier - 15 freq greer - 6 freq carer - 10 freq gruy̬re - 1 freq gruy̬re' - 1 freq grory - 1 freq queirer - 1 freq 'career - 1 freq queerer - 2 freq cairier - 1 freq ۪career - 1 freq grurh - 1 freq corrour - 1 freq 'krrraaar' - 1 freq |
CAIRRIER |
| Time to execute Levenshtein function - 0.385178 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.824439 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.083497 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.064779 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.000826 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. |