| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| easel (0) - 1 freq esel (1) - 2 freq casel (1) - 1 freq eisel (1) - 1 freq eesel (1) - 1 freq easely (1) - 1 freq ersel (1) - 36 freq essel (1) - 1 freq masel (1) - 1006 freq weasel (1) - 3 freq eased (1) - 3 freq ease (1) - 91 freq seased (2) - 1 freq essex (2) - 2 freq deesel (2) - 8 freq enamel (2) - 5 freq eares (2) - 1 freq lapel (2) - 3 freq kael (2) - 5 freq vases (2) - 3 freq laser (2) - 4 freq leased (2) - 2 freq rael (2) - 109 freq mael (2) - 2 freq eaves (2) - 2 freq |
easel (0) - 1 freq eesel (1) - 1 freq eisel (1) - 1 freq easely (1) - 1 freq esel (1) - 2 freq easily (2) - 59 freq yesel (2) - 1 freq eosl (2) - 3 freq ousel (2) - 1 freq sel (2) - 75 freq asl (2) - 1 freq easle (2) - 2 freq masel (2) - 1006 freq essel (2) - 1 freq ersel (2) - 36 freq casel (2) - 1 freq eased (2) - 3 freq weasel (2) - 3 freq ease (2) - 91 freq sal (3) - 55 freq umsel (3) - 1 freq pael (3) - 2 freq aser (3) - 1 freq gael (3) - 2 freq hisel (3) - 18 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 |
EASEL |
| Time to execute Levenshtein function - 0.227376 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.392512 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.029292 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.042148 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.000843 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. |