| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carrier (0) - 15 freq earrier (1) - 1 freq tarrier (1) - 1 freq barrier (1) - 13 freq cerrier (1) - 1 freq cairier (1) - 1 freq carrie (1) - 11 freq cairrier (1) - 13 freq carriers (1) - 2 freq harrier (1) - 2 freq farrier (1) - 2 freq carries (1) - 10 freq carried (1) - 35 freq carriet (1) - 15 freq carlie (2) - 2 freq harriers (2) - 2 freq carer (2) - 10 freq cardies (2) - 1 freq larries (2) - 8 freq carnies (2) - 2 freq callier (2) - 1 freq warrior (2) - 27 freq yarries (2) - 1 freq narrer (2) - 2 freq carsie (2) - 1 freq |
carrier (0) - 15 freq cerrier (1) - 1 freq cairrier (1) - 13 freq farrier (2) - 2 freq harrier (2) - 2 freq carries (2) - 10 freq carriet (2) - 15 freq carriers (2) - 2 freq carried (2) - 35 freq carrie (2) - 11 freq earrier (2) - 1 freq tarrier (2) - 1 freq cairier (2) - 1 freq barrier (2) - 13 freq furrier (3) - 1 freq carver (3) - 14 freq career (3) - 66 freq cairriet (3) - 70 freq currie (3) - 1 freq carred (3) - 1 freq narraer (3) - 1 freq corrie (3) - 55 freq crier (3) - 2 freq cairrie (3) - 35 freq merrier (3) - 4 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 - KRR career - 66 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 |
CARRIER |
| Time to execute Levenshtein function - 0.194642 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.359746 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.027576 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.038085 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. |