| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eediot (0) - 5 freq eidiot (1) - 1 freq eedikt (1) - 1 freq ediot (1) - 1 freq eediots (1) - 1 freq eediom (1) - 15 freq seedit (2) - 1 freq eeyit (2) - 1 freq elliot (2) - 17 freq mediat (2) - 1 freq aeiot (2) - 1 freq edict (2) - 2 freq heedit (2) - 6 freq eedol (2) - 1 freq ekediots (2) - 1 freq eediotic (2) - 4 freq eegit (2) - 4 freq weedit (2) - 1 freq eejit (2) - 71 freq fedit (2) - 1 freq teviot (2) - 2 freq eedjit (2) - 7 freq eliot (2) - 1 freq eidiom (2) - 2 freq ledit (2) - 1 freq |
eediot (0) - 5 freq ediot (1) - 1 freq eidiot (1) - 1 freq edit (2) - 17 freq eediom (2) - 15 freq idiot (2) - 24 freq eediots (2) - 1 freq eedikt (2) - 1 freq eidiot' (3) - 1 freq feedit (3) - 1 freq needit (3) - 167 freq redit (3) - 2 freq endit (3) - 55 freq eedyots (3) - 1 freq eekit (3) - 6 freq aidit (3) - 1 freq diet (3) - 71 freq deit (3) - 9 freq idot (3) - 1 freq audit (3) - 12 freq dot (3) - 47 freq deeit (3) - 1 freq ledit (3) - 1 freq doot (3) - 573 freq idoot (3) - 1 freq |
SoundEx code - E330 edith - 18 freq eidiot - 1 freq eidiot' - 1 freq edit - 17 freq eediot - 5 freq etude - 1 freq 'edit' - 1 freq eatit - 1 freq edyta - 7 freq €œedith - 3 freq eyeteeth - 1 freq ediot - 1 freq |
MetaPhone code - ETT eidiot - 1 freq eidiot' - 1 freq edit - 17 freq eediot - 5 freq etude - 1 freq 'edit' - 1 freq eatit - 1 freq edyta - 7 freq ediot - 1 freq |
EEDIOT |
| Time to execute Levenshtein function - 0.193312 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.399752 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.031346 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.038458 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.000918 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. |