| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eediom (0) - 15 freq eidiom (1) - 2 freq eedioms (1) - 8 freq eediot (1) - 5 freq eediots (2) - 1 freq idiom (2) - 9 freq edrom (2) - 1 freq eedikt (2) - 1 freq ediot (2) - 1 freq eedol (2) - 1 freq eidioms (2) - 2 freq eidiot (2) - 1 freq medium (2) - 71 freq feydom (3) - 2 freq seldom (3) - 27 freq eenies (3) - 15 freq peedie (3) - 285 freq weedin (3) - 7 freq weedit (3) - 1 freq eerily (3) - 1 freq weeding (3) - 1 freq buddom (3) - 5 freq edick (3) - 1 freq eenoo (3) - 57 freq fethom (3) - 1 freq |
eediom (0) - 15 freq eidiom (1) - 2 freq idiom (2) - 9 freq eediot (2) - 5 freq eedioms (2) - 8 freq dim (3) - 51 freq aidom (3) - 1 freq diem (3) - 2 freq doom (3) - 34 freq edam (3) - 45 freq dom (3) - 3 freq edm (3) - 1 freq edmo (3) - 1 freq adom (3) - 1 freq ediot (3) - 1 freq eidiot (3) - 1 freq edrom (3) - 1 freq medium (3) - 71 freq eidioms (3) - 2 freq eedol (3) - 1 freq vadim (4) - 1 freq edina (4) - 2 freq eddie (4) - 31 freq eeday (4) - 1 freq leim (4) - 2 freq |
SoundEx code - E350 eatin - 154 freq 'eaten - 1 freq eaten - 31 freq edwin - 29 freq 'edwin - 4 freq etten - 35 freq euidnae - 3 freq eden - 36 freq edam - 45 freq edam' - 1 freq 'edam - 3 freq eatin' - 2 freq eidein - 1 freq etna - 2 freq eton - 7 freq ettin - 13 freq edwun - 1 freq 'edwun - 1 freq edwina - 1 freq eetin - 3 freq eediom - 15 freq etin - 10 freq eitan - 1 freq eithne - 1 freq eidiom - 2 freq etioun - 2 freq eiehteen - 1 freq eaton - 1 freq eatan - 1 freq ehodni - 1 freq edm - 1 freq ethno - 1 freq edmo - 1 freq ethan - 1 freq edin - 4 freq edina - 2 freq edunn - 2 freq |
MetaPhone code - ETM ae-time - 5 freq edam - 45 freq edam' - 1 freq 'edam - 3 freq eediom - 15 freq eidiom - 2 freq edm - 1 freq edmo - 1 freq |
EEDIOM |
| Time to execute Levenshtein function - 0.387161 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.701683 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.033816 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.093890 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.000909 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. |