| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eisel (0) - 1 freq eise (1) - 2 freq hisel (1) - 18 freq esel (1) - 2 freq easel (1) - 1 freq misel (1) - 14 freq eesel (1) - 1 freq essel (1) - 1 freq ersel (1) - 36 freq uersel (2) - 1 freq imsel (2) - 29 freq tisen (2) - 1 freq rise (2) - 242 freq hissel (2) - 371 freq ersei (2) - 1 freq eiked (2) - 3 freq uised (2) - 277 freq ersed (2) - 6 freq cheisel (2) - 2 freq aises (2) - 1 freq eiffel (2) - 2 freq tise (2) - 3 freq eisin (2) - 1 freq easely (2) - 1 freq rises (2) - 41 freq |
eisel (0) - 1 freq eesel (1) - 1 freq easel (1) - 1 freq esel (1) - 2 freq yesel (2) - 1 freq eosl (2) - 3 freq easely (2) - 1 freq ousel (2) - 1 freq ersel (2) - 36 freq hisel (2) - 18 freq eise (2) - 2 freq sel (2) - 75 freq misel (2) - 14 freq essel (2) - 1 freq yersel (3) - 913 freq eiss (3) - 31 freq casel (3) - 1 freq yirsel (3) - 79 freq eisie (3) - 2 freq masel (3) - 1006 freq ease (3) - 91 freq sl (3) - 7 freq yiel (3) - 1 freq eisy (3) - 1 freq yeirsel (3) - 2 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 - ESL easily - 59 freq easely - 1 freq ess'll - 1 freq eisel - 1 freq esli - 3 freq easel - 1 freq aesily - 2 freq essel - 1 freq esel - 2 freq 'esel' - 2 freq easle - 2 freq eesel - 1 freq eesell - 1 freq eosl - 3 freq |
EISEL |
| Time to execute Levenshtein function - 0.185946 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.338260 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.027351 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.038100 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.000856 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. |