| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| easily (0) - 60 freq easely (1) - 1 freq eerily (2) - 1 freq basil (2) - 2 freq aesily (2) - 2 freq easy (2) - 444 freq lazily (2) - 12 freq early (2) - 366 freq heavily (2) - 9 freq weasely (2) - 1 freq easie (2) - 4 freq deasil (2) - 1 freq family (2) - 329 freq emily (2) - 11 freq easle (2) - 2 freq haily (2) - 27 freq easin (2) - 11 freq fasil (2) - 1 freq warily (2) - 3 freq measly (2) - 1 freq daily (2) - 110 freq eardly (2) - 1 freq easier (2) - 114 freq hazily (2) - 1 freq uneasily (2) - 4 freq |
easily (0) - 60 freq easely (1) - 1 freq easel (2) - 1 freq easle (2) - 2 freq aisily (2) - 1 freq aesily (2) - 2 freq busily (3) - 6 freq sile (3) - 9 freq easier (3) - 114 freq asl (3) - 1 freq uneasily (3) - 4 freq esel (3) - 2 freq eesel (3) - 1 freq eosl (3) - 3 freq eisel (3) - 1 freq esli (3) - 3 freq saaly (3) - 1 freq sail (3) - 100 freq daily (3) - 110 freq asail (3) - 1 freq cosily (3) - 1 freq easy (3) - 444 freq basil (3) - 2 freq deasil (3) - 1 freq early (3) - 366 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 |
EASILY |
| Time to execute Levenshtein function - 0.194277 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.371205 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.027811 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.038171 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.001063 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. |