| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| corer (0) - 1 freq scorer (1) - 3 freq cooer (1) - 1 freq cower (1) - 11 freq core' (1) - 1 freq corey (1) - 1 freq cover (1) - 148 freq cores (1) - 3 freq core (1) - 54 freq corner (1) - 317 freq comer (1) - 4 freq carer (1) - 10 freq ofrer (2) - 1 freq coar (2) - 3 freq corsa (2) - 1 freq cole (2) - 1 freq courier (2) - 6 freq comers (2) - 1 freq rover (2) - 12 freq tore (2) - 69 freq cher (2) - 6 freq cler (2) - 1 freq sores (2) - 3 freq ooter (2) - 25 freq corps (2) - 13 freq |
corer (0) - 1 freq carer (1) - 10 freq comer (2) - 4 freq crier (2) - 2 freq courier (2) - 6 freq career (2) - 65 freq corner (2) - 317 freq carr (2) - 3 freq corri (2) - 1 freq cower (2) - 11 freq cooer (2) - 1 freq core (2) - 54 freq corey (2) - 1 freq core' (2) - 1 freq cover (2) - 148 freq cores (2) - 3 freq scorer (2) - 3 freq cors (3) - 1 freq creg (3) - 1 freq corrie (3) - 55 freq cleer (3) - 6 freq curers (3) - 1 freq porr (3) - 1 freq crem (3) - 2 freq corcur (3) - 4 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 |
CORER |
| Time to execute Levenshtein function - 0.227056 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.339335 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.027078 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.036779 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.000829 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. |