| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| easely (0) - 1 freq easel (1) - 1 freq weasely (1) - 1 freq easily (1) - 60 freq peasey (2) - 1 freq early (2) - 366 freq masel' (2) - 10 freq easy (2) - 444 freq weasel (2) - 3 freq sagely (2) - 2 freq eases (2) - 1 freq eesel (2) - 1 freq tensely (2) - 2 freq lakely (2) - 2 freq casey (2) - 7 freq emsels (2) - 4 freq eardly (2) - 1 freq masell (2) - 67 freq epely (2) - 1 freq mosely (2) - 2 freq nately (2) - 2 freq sarely (2) - 1 freq easle (2) - 2 freq eased (2) - 3 freq lastly (2) - 5 freq |
easely (0) - 1 freq easel (1) - 1 freq easily (1) - 60 freq esel (2) - 2 freq easle (2) - 2 freq eisel (2) - 1 freq weasely (2) - 1 freq eesel (2) - 1 freq ersel (3) - 36 freq fausely (3) - 1 freq eesell (3) - 1 freq eely (3) - 2 freq safely (3) - 41 freq wisely (3) - 8 freq casel (3) - 1 freq ease (3) - 94 freq masel (3) - 1037 freq aisily (3) - 1 freq asl (3) - 1 freq yesel (3) - 1 freq sly (3) - 15 freq esli (3) - 3 freq seely (3) - 4 freq aesily (3) - 2 freq measly (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 - ESL easily - 60 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 |
EASELY |
| Time to execute Levenshtein function - 0.238193 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.385334 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.027520 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.037975 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.000888 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. |