| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| item (0) - 17 freq ite (1) - 3 freq itet (1) - 1 freq stem (1) - 18 freq items (1) - 21 freq ihe (2) - 2 freq yte (2) - 1 freq poem (2) - 357 freq stei (2) - 6 freq it'' (2) - 1 freq ices (2) - 2 freq itup (2) - 1 freq teu (2) - 29 freq xoem (2) - 1 freq itn (2) - 2 freq ice (2) - 254 freq iti (2) - 1 freq inter (2) - 2 freq chem (2) - 1 freq ileum (2) - 1 freq teh (2) - 1 freq enem (2) - 2 freq tee (2) - 165 freq kttm (2) - 1 freq ahem (2) - 12 freq |
item (0) - 17 freq teum (2) - 8 freq tim (2) - 46 freq tam (2) - 519 freq teem (2) - 46 freq tom (2) - 134 freq atm (2) - 3 freq tm (2) - 7 freq tym (2) - 2 freq tum (2) - 17 freq atom (2) - 5 freq itet (2) - 1 freq team (2) - 292 freq items (2) - 21 freq ite (2) - 3 freq stem (2) - 18 freq tmi (3) - 1 freq naem (3) - 48 freq tyme (3) - 219 freq bem (3) - 1 freq vem (3) - 1 freq sem (3) - 1 freq itz (3) - 2 freq aem (3) - 1 freq saem (3) - 4 freq |
SoundEx code - I350 iodine - 4 freq itn - 2 freq 'ithin - 2 freq item - 17 freq itan - 1 freq idiom - 9 freq ithin - 124 freq i'time - 22 freq i'toon - 8 freq i'don - 1 freq i'ythan - 1 freq idunn - 1 freq €˜ithin - 3 freq iden - 2 freq Èideann - 1 freq |
MetaPhone code - ITM item - 17 freq idiom - 9 freq i'time - 22 freq |
ITEM |
| Time to execute Levenshtein function - 0.216987 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.346192 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.030565 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.037612 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.000839 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. |