| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eediots (0) - 1 freq eedyots (1) - 1 freq eediot (1) - 5 freq ekediots (1) - 1 freq eedioms (1) - 8 freq eelits (2) - 1 freq eidiot' (2) - 1 freq eidioms (2) - 2 freq eidiot (2) - 1 freq eediom (2) - 15 freq tedious (2) - 1 freq eediotic (2) - 4 freq eedyits (2) - 1 freq ediot (2) - 1 freq eedikt (2) - 1 freq idiots (2) - 20 freq eedols (2) - 1 freq eejits (2) - 50 freq dints (3) - 2 freq radios (3) - 6 freq edin's (3) - 1 freq eekit (3) - 6 freq eegit (3) - 4 freq keerious (3) - 3 freq idiot's (3) - 1 freq |
eediots (0) - 1 freq eedyots (1) - 1 freq eedioms (2) - 8 freq eedyits (2) - 1 freq idiots (2) - 20 freq ekediots (2) - 1 freq eediot (2) - 5 freq eedols (3) - 1 freq diets (3) - 4 freq eejits (3) - 50 freq eelits (3) - 1 freq doots (3) - 33 freq eidioms (3) - 2 freq ediot (3) - 1 freq eidiot (3) - 1 freq dots (3) - 7 freq eidiot' (3) - 1 freq eediotic (3) - 4 freq editors (4) - 23 freq divots (4) - 5 freq edith (4) - 18 freq idioms (4) - 7 freq dists (4) - 1 freq edit (4) - 17 freq odious (4) - 4 freq |
SoundEx code - E332 eediotically - 1 freq eediotic - 4 freq eediotically-muckle - 1 freq eediotic-lookin - 1 freq eediots - 1 freq eedyits - 1 freq eteaueds - 1 freq eedyots - 1 freq |
MetaPhone code - ETTS eediots - 1 freq eteaueds - 1 freq |
EEDIOTS |
| Time to execute Levenshtein function - 0.207908 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.348144 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.028762 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.037230 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.000838 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. |