| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ecoul (0) - 1 freq coul (1) - 56 freq scoul (1) - 2 freq ecrml (2) - 2 freq col (2) - 11 freq schul (2) - 13 freq scowl (2) - 10 freq seoul (2) - 2 freq moul (2) - 1 freq scol (2) - 1 freq scout (2) - 13 freq coulg (2) - 1 freq eould (2) - 2 freq coud (2) - 152 freq coal (2) - 134 freq ectual (2) - 3 freq ecus (2) - 1 freq doul (2) - 4 freq 'foul (2) - 1 freq 'could (2) - 16 freq cool (2) - 138 freq toul (2) - 161 freq recoup (2) - 3 freq coum (2) - 2 freq stoul (2) - 1 freq |
ecoul (0) - 1 freq coul (1) - 56 freq coal (2) - 134 freq cool (2) - 138 freq coil (2) - 1 freq caul (2) - 79 freq col (2) - 11 freq scoul (2) - 2 freq recoil (3) - 3 freq coll (3) - 7 freq caal (3) - 98 freq soul (3) - 117 freq 'cool (3) - 1 freq croul (3) - 1 freq could (3) - 2677 freq cowl (3) - 8 freq boul (3) - 15 freq cl (3) - 5 freq houl (3) - 83 freq coli (3) - 1 freq goul (3) - 3 freq roul (3) - 17 freq acual (3) - 1 freq cal (3) - 29 freq cole (3) - 1 freq |
SoundEx code - E240 easily - 60 freq easely - 1 freq e-coli - 1 freq equal - 71 freq egil - 4 freq 'egil - 2 freq eeswal - 10 freq eeswally - 4 freq equally - 36 freq eagle - 20 freq excel - 3 freq exile - 20 freq eisweel - 3 freq eezsel - 4 freq eggle - 2 freq ess'll - 1 freq 'equal - 1 freq eisel - 1 freq 'e-colly' - 1 freq ecoul - 1 freq equallie - 1 freq esli - 3 freq easel - 1 freq ees-sel - 1 freq eheswally - 1 freq essel - 1 freq esel - 2 freq e-sgoil - 1 freq €™ecole - 1 freq eggshell - 1 freq 'esel' - 2 freq easle - 2 freq eequalee - 1 freq eesel - 1 freq eesell - 1 freq eosl - 3 freq |
MetaPhone code - EKL e-coli - 1 freq equal - 71 freq equally - 36 freq eagle - 20 freq eggle - 2 freq 'equal - 1 freq 'e-colly' - 1 freq ecoul - 1 freq equallie - 1 freq €™ecole - 1 freq eequalee - 1 freq |
ECOUL |
| Time to execute Levenshtein function - 0.256319 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.512692 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.063298 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.040016 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.035362 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. |