| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| idiot (0) - 24 freq ediot (1) - 1 freq idiom (1) - 9 freq idoot (1) - 1 freq eidiot (1) - 1 freq idot (1) - 1 freq idiots (1) - 20 freq idol (2) - 12 freq riot (2) - 31 freq isit (2) - 1 freq idiocy (2) - 3 freq eidiom (2) - 2 freq edict (2) - 2 freq adio (2) - 1 freq eediot (2) - 5 freq dirt (2) - 70 freq €œidiot (2) - 1 freq €™iot (2) - 13 freq iscot (2) - 1 freq aeiot (2) - 1 freq eidiot' (2) - 1 freq diet (2) - 71 freq dot (2) - 47 freq iio (2) - 1 freq indict (2) - 1 freq |
idiot (0) - 24 freq idot (1) - 1 freq eidiot (1) - 1 freq idoot (1) - 1 freq ediot (1) - 1 freq aidit (2) - 1 freq eediot (2) - 5 freq doot (2) - 573 freq idiots (2) - 20 freq idiom (2) - 9 freq edit (2) - 17 freq diet (2) - 71 freq dot (2) - 47 freq idil (3) - 1 freq iit (3) - 1 freq dat (3) - 1391 freq init (3) - 1 freq widit (3) - 1 freq sidit (3) - 1 freq i-it (3) - 1 freq dout (3) - 167 freq dote (3) - 2 freq dyit (3) - 2 freq doit (3) - 3 freq deet (3) - 24 freq |
SoundEx code - I330 ithout - 11 freq idiot - 24 freq ithoot - 53 freq idoot - 1 freq itida - 1 freq €˜ithoot - 3 freq 'ithoot - 1 freq €™ithoot - 6 freq €˜idiot - 1 freq €œidiot - 1 freq idot - 1 freq itet - 1 freq |
MetaPhone code - ITT it'd - 67 freq idiot - 24 freq idoot - 1 freq 'it'd - 1 freq itida - 1 freq it't - 1 freq €˜idiot - 1 freq €œidiot - 1 freq idot - 1 freq itÂ’d - 3 freq id'd - 1 freq itet - 1 freq |
IDIOT |
| Time to execute Levenshtein function - 0.176155 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.323127 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.027342 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.036886 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.000932 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. |