| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| theeker (0) - 1 freq theeter (1) - 1 freq wheeker (1) - 25 freq heefer (2) - 1 freq teaker (2) - 1 freq teeter (2) - 1 freq wheeter (2) - 1 freq tweeter (2) - 2 freq queeker (2) - 4 freq wheeler (2) - 4 freq wheeked (2) - 8 freq theer (2) - 1 freq theeerr (2) - 1 freq heeder (2) - 1 freq chekker (2) - 1 freq keeker (2) - 3 freq seeker (2) - 2 freq thinker (2) - 4 freq cheeper (2) - 4 freq sheener (2) - 1 freq theekit (2) - 2 freq theesel (2) - 6 freq teeger (2) - 187 freq theek (2) - 6 freq steeker (2) - 1 freq |
theeker (0) - 1 freq wheeker (2) - 25 freq theeter (2) - 1 freq thicker (3) - 11 freq theeerr (3) - 1 freq thinker (3) - 4 freq teaker (3) - 1 freq theek (3) - 6 freq theer (3) - 1 freq theekit (3) - 2 freq threeeee (4) - 1 freq thehaar (4) - 1 freq trooker (4) - 2 freq therr (4) - 11 freq choaker (4) - 7 freq thoner (4) - 2 freq ther (4) - 111 freq theik (4) - 8 freq they'r (4) - 35 freq thesaur (4) - 2 freq tinker (4) - 21 freq ticker (4) - 3 freq the'ir (4) - 4 freq theyeir (4) - 2 freq three (4) - 1487 freq |
SoundEx code - T260 teacher - 340 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 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 |
THEEKER |
| Time to execute Levenshtein function - 0.187521 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.361283 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.027012 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.036421 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.000810 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. |