| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| idot (0) - 1 freq idol (1) - 12 freq dot (1) - 47 freq idoot (1) - 1 freq idiot (1) - 21 freq plot (2) - 38 freq idee (2) - 17 freq ydo (2) - 1 freq 'dat (2) - 2 freq aidom (2) - 1 freq iko (2) - 1 freq irkt (2) - 1 freq gdog (2) - 1 freq brot (2) - 1 freq gigot (2) - 1 freq doat (2) - 1 freq doth (2) - 9 freq abot (2) - 1 freq midst (2) - 33 freq bot (2) - 437 freq ado (2) - 4 freq icon (2) - 10 freq dop (2) - 1 freq itet (2) - 1 freq dob (2) - 1 freq |
idot (0) - 1 freq idoot (1) - 1 freq idiot (1) - 21 freq dot (1) - 47 freq eidiot (2) - 1 freq det (2) - 3 freq doit (2) - 3 freq idol (2) - 12 freq doot (2) - 565 freq doyt (2) - 1 freq aidit (2) - 1 freq dat (2) - 1391 freq dt (2) - 3 freq dote (2) - 2 freq edit (2) - 17 freq ediot (2) - 1 freq dout (2) - 167 freq doat (2) - 1 freq iht (3) - 1 freq it (3) - 32760 freq dht (3) - 1 freq idiots (3) - 20 freq not (3) - 712 freq idda (3) - 89 freq izat (3) - 1 freq |
SoundEx code - I330 ithout - 11 freq idiot - 21 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 - 21 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 |
IDOT |
| Time to execute Levenshtein function - 0.220890 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.365207 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.031935 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.044305 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.001061 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. |