| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unhowkit (0) - 1 freq snowkit (2) - 1 freq chowkit (2) - 2 freq howkit (2) - 29 freq unlockit (2) - 2 freq shockit (3) - 1 freq howpit (3) - 19 freq unpackit (3) - 1 freq unmankit (3) - 1 freq choweit (3) - 1 freq endowit (3) - 1 freq begowkit (3) - 3 freq onlokkit (3) - 1 freq unloakin (3) - 1 freq chowit (3) - 1 freq unmerkit (3) - 2 freq unwarkit (3) - 1 freq gowkit (3) - 6 freq chokit (3) - 18 freq unlockin (3) - 2 freq knockit (3) - 13 freq hockit (3) - 3 freq hokkit (3) - 1 freq onhankit (3) - 2 freq powkit (3) - 14 freq |
unhowkit (0) - 1 freq howkit (3) - 29 freq chowkit (3) - 2 freq hawkit (4) - 1 freq onhankit (4) - 2 freq unlockit (4) - 2 freq snowkit (4) - 1 freq hookit (5) - 1 freq unhonest (5) - 1 freq unhook (5) - 1 freq chockit (5) - 2 freq unpikit (5) - 1 freq unheukin (5) - 1 freq invokit (5) - 3 freq howkin (5) - 59 freq yowkit (5) - 2 freq shokkit (5) - 2 freq chowkin (5) - 1 freq choakit (5) - 4 freq unmarkit (5) - 1 freq unlokket (5) - 1 freq cowkit (5) - 1 freq howzit (5) - 1 freq unheedit (5) - 1 freq unhooked (5) - 1 freq |
SoundEx code - U523 unsettl't - 2 freq unquateness - 1 freq uncut - 1 freq unsteady - 3 freq unsettled - 3 freq uncouthie - 3 freq unstringin - 1 freq unstoppable - 5 freq unsettlin - 3 freq unsettle - 1 freq un-yeesed - 1 freq unsaed - 1 freq ungoadly - 1 freq unskaithd - 1 freq unsettles - 1 freq unheuked - 1 freq unsaid - 6 freq unsteik - 1 freq unsteikit - 1 freq unsheathit - 1 freq 'unsteik - 1 freq unstappit - 2 freq unsticking - 1 freq unsettling - 3 freq unmistakable - 3 freq unwashed - 5 freq unkit's - 1 freq unhooked - 1 freq unasked-for - 1 freq uncouth - 5 freq unmistakeable - 3 freq unsatisfied - 1 freq unsuitable - 2 freq unwashit - 1 freq unsteeked - 1 freq unstuck - 1 freq unstick - 1 freq unctioneer - 2 freq unstaundart - 2 freq unst - 12 freq unstitute - 1 freq unsteek - 3 freq ungat - 1 freq unstapt - 1 freq unsheddied - 1 freq unshadowed - 1 freq unstable - 1 freq unsatisfactorie - 1 freq unwasht - 1 freq unsteekit - 2 freq unwaashed - 1 freq unstappable - 2 freq unstressed - 27 freq unstessed - 1 freq unquait - 1 freq unction - 1 freq unwaged - 1 freq unsattled - 1 freq unstintin - 1 freq unsturdy - 1 freq ungodly - 2 freq unsatisfactor - 1 freq uncuddomt - 1 freq unstappin - 1 freq unstickan - 1 freq unmistakible - 1 freq unhowkit - 1 freq unused - 2 freq unstintit - 1 freq unctuous - 1 freq unsaturatit - 1 freq unweshed - 1 freq unsteeks - 1 freq unscathed - 2 freq unsatisfaiän - 1 freq ungwdrj - 1 freq unstfest - 1 freq unstagram - 1 freq unmasked - 1 freq unistrathclyde - 1 freq unsteddy - 1 freq unstlass - 3 freq |
MetaPhone code - UNHKT unheuked - 1 freq unhooked - 1 freq unhowkit - 1 freq |
UNHOWKIT |
| Time to execute Levenshtein function - 0.396750 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.806570 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.029716 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.092083 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.000880 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. |