| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itida (0) - 1 freq itis (2) - 1 freq itill (2) - 2 freq ibid (2) - 2 freq tidal (2) - 9 freq idda (2) - 89 freq stide (2) - 2 freq iika (2) - 1 freq atidda (2) - 7 freq ida (2) - 127 freq tid (2) - 25 freq noida (2) - 1 freq 'tina (2) - 1 freq iside (2) - 1 freq iiid (2) - 1 freq cuida (2) - 2 freq t'da (2) - 5 freq wiida (2) - 1 freq ktid (2) - 1 freq ita (2) - 10 freq tids (2) - 2 freq ati'da (2) - 18 freq itsa (2) - 1 freq inda (2) - 1 freq itif (2) - 1 freq |
itida (0) - 1 freq tid (2) - 25 freq tide (2) - 118 freq tidy (2) - 50 freq wida (3) - 5 freq stid (3) - 11 freq taday (3) - 2 freq tina (3) - 17 freq i'da (3) - 1 freq it'd (3) - 67 freq tidn (3) - 1 freq gtid (3) - 1 freq iid (3) - 1 freq imid (3) - 1 freq tad (3) - 54 freq taid (3) - 2 freq ted (3) - 13 freq utd (3) - 11 freq today (3) - 161 freq tod (3) - 276 freq tyd (3) - 4 freq td (3) - 9 freq todo (3) - 1 freq tied (3) - 120 freq etude (3) - 1 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 |
ITIDA |
| Time to execute Levenshtein function - 0.199193 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.382438 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.027621 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.037624 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.000843 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. |