| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| crier (0) - 2 freq cried (1) - 983 freq frier (1) - 1 freq criet (1) - 1 freq crie (1) - 7 freq drier (1) - 9 freq brier (1) - 5 freq cries (1) - 101 freq crits (2) - 1 freq curie (2) - 1 freq thier (2) - 3 freq cer (2) - 1 freq cuter (2) - 1 freq ier (2) - 1 freq cler (2) - 1 freq briar (2) - 1 freq cerrier (2) - 1 freq tried (2) - 687 freq ried (2) - 2 freq prior (2) - 18 freq carter (2) - 3 freq corner (2) - 324 freq tier (2) - 36 freq crit (2) - 1 freq pier (2) - 38 freq |
crier (0) - 2 freq courier (2) - 6 freq career (2) - 66 freq cairier (2) - 1 freq corer (2) - 1 freq cries (2) - 101 freq carer (2) - 10 freq brier (2) - 5 freq cried (2) - 983 freq criet (2) - 1 freq frier (2) - 1 freq crie (2) - 7 freq drier (2) - 9 freq rior (3) - 1 freq fryer (3) - 3 freq cower (3) - 12 freq caper (3) - 14 freq cher (3) - 6 freq crimea (3) - 4 freq caer (3) - 5 freq dryer (3) - 5 freq carr (3) - 3 freq cover (3) - 147 freq caries (3) - 1 freq cleer (3) - 6 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 |
CRIER |
| Time to execute Levenshtein function - 0.259985 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.429127 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.027792 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.037718 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.000906 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. |