| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tsimmit (0) - 1 freq simmit (1) - 6 freq trimmlt (2) - 3 freq semmit (2) - 23 freq trimmt (2) - 1 freq simmet (2) - 3 freq dsimmie (2) - 1 freq sommit (2) - 3 freq summit (2) - 54 freq tuimit (2) - 3 freq trimmin (2) - 2 freq simmir (2) - 1 freq timit (2) - 1 freq trimmlit (2) - 1 freq semmits (3) - 9 freq tuimt (3) - 8 freq tummlt (3) - 8 freq jimpit (3) - 5 freq smdit (3) - 1 freq trimming (3) - 1 freq fimmist (3) - 1 freq tumit (3) - 1 freq sirit (3) - 1 freq simmer (3) - 309 freq tippit (3) - 10 freq |
tsimmit (0) - 1 freq simmit (2) - 6 freq summit (3) - 54 freq sommit (3) - 3 freq simmet (3) - 3 freq trimmt (3) - 1 freq semmit (3) - 23 freq trimmlit (4) - 1 freq summat (4) - 1 freq sommat (4) - 47 freq timit (4) - 1 freq 'sommat (4) - 1 freq simmir (4) - 1 freq trimmlt (4) - 3 freq dsimmie (4) - 1 freq tuimit (4) - 3 freq trimmin (4) - 2 freq thumbit (5) - 1 freq trimmer (5) - 1 freq sammi (5) - 1 freq tommie (5) - 1 freq commit (5) - 17 freq submit (5) - 13 freq thoomit (5) - 1 freq timmert (5) - 1 freq |
SoundEx code - T253 thoosand - 115 freq thoosands - 53 freq thousands - 17 freq thousand - 12 freq thoosand's - 1 freq thoosint - 2 freq thoosant - 4 freq thousant - 4 freq teachin'the - 1 freq t-century - 1 freq thousants - 2 freq thowsand - 3 freq tissue-matchin - 2 freq th-century - 16 freq tsimmit - 1 freq thoosan-telt - 1 freq thooosunds - 1 freq thooosands - 1 freq takemeout - 1 freq thoosinds - 1 freq thejamtarts - 1 freq tgshuntly - 1 freq |
MetaPhone code - TSMT tsimmit - 1 freq |
TSIMMIT |
| Time to execute Levenshtein function - 0.176208 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.350658 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.027464 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.036768 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.000846 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. |