| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eidiot (0) - 1 freq ediot (1) - 1 freq eediot (1) - 5 freq eidiom (1) - 2 freq idiot (1) - 24 freq eidiot' (1) - 1 freq aidit (2) - 1 freq heidit (2) - 60 freq widit (2) - 1 freq eediots (2) - 1 freq €˜idiot (2) - 1 freq eidioms (2) - 2 freq hidit (2) - 1 freq eediom (2) - 15 freq eildit (2) - 12 freq eikit (2) - 65 freq eliot (2) - 1 freq idiom (2) - 9 freq eident (2) - 47 freq elliot (2) - 17 freq endit (2) - 55 freq edict (2) - 2 freq d'idiot (2) - 1 freq bidit (2) - 30 freq eijit (2) - 1 freq |
eidiot (0) - 1 freq idiot (1) - 24 freq eediot (1) - 5 freq ediot (1) - 1 freq idot (2) - 1 freq idoot (2) - 1 freq edit (2) - 17 freq eidiot' (2) - 1 freq aidit (2) - 1 freq eidiom (2) - 2 freq eedikt (3) - 1 freq bidit (3) - 30 freq idiots (3) - 20 freq eijit (3) - 1 freq eidart (3) - 1 freq diet (3) - 71 freq dot (3) - 47 freq edict (3) - 2 freq sidit (3) - 1 freq neidit (3) - 1 freq doot (3) - 573 freq heidit (3) - 60 freq hidit (3) - 1 freq audit (3) - 12 freq eediots (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 |
EIDIOT |
| Time to execute Levenshtein function - 0.257189 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.423941 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.032518 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.042614 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.001136 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. |