| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| courier (0) - 6 freq courie (1) - 6 freq courtier (1) - 1 freq couried (1) - 6 freq couriet (1) - 1 freq coured (2) - 1 freq cairier (2) - 1 freq bourie (2) - 5 freq collier (2) - 2 freq couper (2) - 2 freq cooried (2) - 63 freq courried (2) - 1 freq coarner (2) - 46 freq courit (2) - 7 freq codriver (2) - 1 freq corner (2) - 317 freq coories (2) - 5 freq couler (2) - 1 freq couser (2) - 2 freq corries (2) - 14 freq scourie (2) - 2 freq courin (2) - 1 freq ourie (2) - 3 freq coorien (2) - 1 freq mourner (2) - 2 freq |
courier (0) - 6 freq courrie (2) - 1 freq corer (2) - 1 freq corrie (2) - 55 freq cairier (2) - 1 freq crier (2) - 2 freq courtier (2) - 1 freq courie (2) - 6 freq couried (2) - 6 freq couriet (2) - 1 freq career (3) - 65 freq caurie (3) - 2 freq coorser (3) - 4 freq courries (3) - 1 freq carer (3) - 10 freq curie (3) - 1 freq conrie (3) - 1 freq corri (3) - 1 freq currie (3) - 1 freq carrie (3) - 11 freq cerrier (3) - 1 freq carrier (3) - 15 freq course (3) - 489 freq dourer (3) - 2 freq elcourier (3) - 34 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 |
COURIER |
| Time to execute Levenshtein function - 0.189395 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.334677 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.026816 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.036378 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.000823 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. |