Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eesell (0) - 1 freq mesell (1) - 2 freq eersell (1) - 1 freq eesel (1) - 1 freq itsell (2) - 16 freq eesed (2) - 65 freq hisell (2) - 2 freq easel (2) - 1 freq eesee (2) - 3 freq eezsel (2) - 1 freq yees'll (2) - 2 freq ersel (2) - 36 freq pensell (2) - 2 freq ess'll (2) - 1 freq eet'll (2) - 9 freq chesell (2) - 1 freq eeswal (2) - 10 freq erse'll (2) - 1 freq eesefu (2) - 3 freq een'll (2) - 3 freq meself (2) - 2 freq eeses (2) - 1 freq deyell (2) - 1 freq idsell (2) - 11 freq easely (2) - 1 freq |
eesell (0) - 1 freq eesel (2) - 1 freq sell (2) - 164 freq eersell (2) - 1 freq mesell (2) - 2 freq sewell (3) - 1 freq sull (3) - 4 freq ee'll (3) - 12 freq masell (3) - 67 freq easely (3) - 1 freq essel (3) - 1 freq yeself (3) - 1 freq sall (3) - 97 freq 'sell (3) - 1 freq maesell (3) - 1 freq selly (3) - 1 freq weell (3) - 1 freq yesel (3) - 1 freq eisel (3) - 1 freq idsell (3) - 11 freq mysell (3) - 2 freq esel (3) - 2 freq yersell (3) - 26 freq hisell (3) - 2 freq isella (3) - 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 - 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 |
EESELL |
Time to execute Levenshtein function - 0.221966 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.435447 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.030387 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.037670 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.000798 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. |