| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eeswal (0) - 10 freq leswalt (2) - 2 freq eesell (2) - 1 freq uiswal (2) - 6 freq eeswally (2) - 4 freq mescal (2) - 1 freq eestae (2) - 3 freq beeswax (2) - 5 freq eesel (2) - 1 freq uswal (2) - 8 freq eesta (2) - 1 freq shal (3) - 26 freq eesefu (3) - 3 freq ackwal (3) - 3 freq goswald (3) - 1 freq uesw (3) - 1 freq leetral (3) - 1 freq ees (3) - 87 freq beerial (3) - 10 freq devaal (3) - 5 freq vessil (3) - 1 freq mental (3) - 118 freq esa (3) - 2 freq regal (3) - 2 freq hesna (3) - 12 freq |
eeswal (0) - 10 freq uiswal (2) - 6 freq uswal (2) - 8 freq swael (3) - 2 freq eisweel (3) - 3 freq eesel (3) - 1 freq swaal (3) - 2 freq eeswally (3) - 4 freq eesell (3) - 1 freq sewel (3) - 1 freq sewan (4) - 1 freq sowel (4) - 87 freq sal (4) - 55 freq ooneeswal (4) - 2 freq jewel (4) - 19 freq swaw (4) - 12 freq sexual (4) - 21 freq eiswecl (4) - 1 freq skal (4) - 1 freq swall (4) - 20 freq ushal (4) - 1 freq sowl (4) - 128 freq sweil (4) - 1 freq swan (4) - 23 freq saal (4) - 3 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 - ESWL eeswal - 10 freq eeswally - 4 freq eisweel - 3 freq |
EESWAL |
| Time to execute Levenshtein function - 0.241623 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.390205 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.032616 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.038920 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.000874 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. |