| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eezsel (0) - 1 freq eersel (1) - 28 freq eesel (1) - 1 freq heezsel (1) - 1 freq eensel (1) - 6 freq hersel (2) - 1057 freq eesed (2) - 65 freq pensel (2) - 1 freq easel (2) - 1 freq eeses (2) - 1 freq hessel (2) - 9 freq hizsel (2) - 1 freq eense (2) - 16 freq weasel (2) - 3 freq meesel (2) - 2 freq yersel (2) - 913 freq eezer (2) - 1 freq eese (2) - 106 freq yesel (2) - 1 freq reesel (2) - 4 freq eesell (2) - 1 freq eersell (2) - 1 freq ersel (2) - 36 freq essel (2) - 1 freq esel (2) - 2 freq |
eezsel (0) - 1 freq heezsel (2) - 1 freq eensel (2) - 6 freq eesel (2) - 1 freq eersel (2) - 28 freq desel (3) - 4 freq essel (3) - 1 freq reesel (3) - 4 freq deesel (3) - 8 freq ersel (3) - 36 freq zsl (3) - 1 freq eisel (3) - 1 freq yesel (3) - 1 freq uersel (3) - 1 freq mesel (3) - 59 freq esel (3) - 2 freq weasel (3) - 3 freq easel (3) - 1 freq meesel (3) - 2 freq hizsel (3) - 1 freq yersel (3) - 913 freq misel (4) - 14 freq hisel (4) - 18 freq seel (4) - 1 freq deasil (4) - 1 freq |
SoundEx code - E240 easily - 59 freq easely - 1 freq e-coli - 1 freq equal - 71 freq egil - 4 freq 'egil - 2 freq eeswal - 10 freq eeswally - 4 freq equally - 35 freq eagle - 20 freq excel - 3 freq exile - 20 freq eisweel - 3 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 eezsel - 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 - ESSL ees-sel - 1 freq eezsel - 1 freq |
EEZSEL |
| Time to execute Levenshtein function - 0.362379 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.505005 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.036367 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.050919 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.001138 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. |