Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
thicker (0) - 11 freq ticker (1) - 3 freq thicket (1) - 1 freq thinker (1) - 4 freq wicker (2) - 2 freq tinker (2) - 21 freq thickens (2) - 1 freq shicken (2) - 2 freq hicher (2) - 1 freq smicker (2) - 1 freq tickler (2) - 4 freq sticker (2) - 10 freq quicker (2) - 57 freq bicker (2) - 12 freq whisker (2) - 1 freq tricked (2) - 1 freq chirker (2) - 1 freq flicker (2) - 13 freq chicked (2) - 1 freq trickery (2) - 1 freq thacket (2) - 1 freq tricket (2) - 9 freq thicko (2) - 1 freq thickly (2) - 1 freq licker (2) - 1 freq |
thicker (0) - 11 freq thicket (2) - 1 freq thinker (2) - 4 freq ticker (2) - 3 freq thick (3) - 227 freq thickly (3) - 1 freq thicko (3) - 1 freq thacket (3) - 1 freq thickin (3) - 1 freq thickos (3) - 1 freq trucker (3) - 1 freq trickery (3) - 1 freq whacker (3) - 1 freq shocker (3) - 4 freq theeker (3) - 1 freq checker (3) - 5 freq trickerie (4) - 1 freq hickory (4) - 3 freq thinken (4) - 2 freq sicker (4) - 8 freq nicker (4) - 1 freq thack (4) - 2 freq thuck (4) - 1 freq snicker (4) - 1 freq thicklie (4) - 1 freq |
SoundEx code - T260 teacher - 370 freq thicker - 11 freq tougher - 3 freq tagore - 2 freq tizer - 3 freq theeker - 1 freq teucher - 4 freq tiger - 27 freq tocher - 25 freq ticher - 3 freq teeger - 187 freq tyger - 2 freq taser - 3 freq taaker - 1 freq t-shir - 1 freq taicher - 3 freq ticker - 3 freq tusker - 2 freq tyocher - 1 freq teuscher - 1 freq 'teeger - 8 freq teeger' - 1 freq thesaur - 2 freq thesaury - 1 freq teegar - 4 freq teachur - 2 freq 'teacher - 3 freq towser - 6 freq teichar - 2 freq teiger - 1 freq teecher - 1 freq tug-o-war - 1 freq tak-ower - 1 freq toker - 1 freq €˜teacher - 1 freq teachar - 1 freq takower - 1 freq tackar - 1 freq tosser - 2 freq teaker - 1 freq tjur - 1 freq tjr - 1 freq toysareaway - 1 freq |
MetaPhone code - 0KR thicker - 11 freq theeker - 1 freq |
THICKER |
Time to execute Levenshtein function - 0.241507 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.421743 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.036665 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.045036 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.000890 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. |