| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| khqxhsi (0) - 1 freq kuqhip (4) - 1 freq quasi (4) - 1 freq kqks (4) - 1 freq bhxhv (4) - 1 freq kyths (4) - 5 freq hxi (4) - 1 freq shansi (4) - 1 freq knox's (4) - 2 freq kehs (4) - 1 freq highs (4) - 1 freq hsi (4) - 2 freq hochs (4) - 12 freq hihi (4) - 6 freq thighs' (4) - 1 freq keechs (4) - 1 freq xhs (4) - 1 freq hqwzs (4) - 1 freq khsmi (4) - 1 freq hhsm (4) - 1 freq hhqs (4) - 1 freq kpxs (4) - 1 freq lhhfhni (4) - 1 freq hfxfhi (4) - 1 freq hcxiti (4) - 1 freq |
khqxhsi (0) - 1 freq thighs (7) - 14 freq hochs (7) - 12 freq keechs (7) - 1 freq xhs (7) - 1 freq kpxs (7) - 1 freq hhqs (7) - 1 freq hqwzs (7) - 1 freq kqms (7) - 1 freq highs (7) - 1 freq bhxhv (7) - 1 freq kqks (7) - 1 freq kuqhip (7) - 1 freq kehs (7) - 1 freq kyths (7) - 5 freq hexham (7) - 1 freq kechs (7) - 1 freq knox's (7) - 2 freq hughesie (8) - 1 freq hughes (8) - 5 freq kinches (8) - 8 freq heichs (8) - 2 freq sykeqhs (8) - 1 freq ckhhyys (8) - 1 freq whyqx (8) - 1 freq |
SoundEx code - K220 kisses - 29 freq keechs - 1 freq keysies - 1 freq kakes - 1 freq kishies - 4 freq kyisses - 1 freq kissies - 1 freq kaces - 1 freq kiujsyewxa - 1 freq kechs - 1 freq kuzyk - 1 freq kessock - 1 freq kukukg - 1 freq kickass - 1 freq kizziewiz - 2 freq khqxhsi - 1 freq kaikos - 1 freq |
MetaPhone code - KKKSS gqkzs - 1 freq khqxhsi - 1 freq |
KHQXHSI |
| Time to execute Levenshtein function - 0.295826 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.518405 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.066260 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.085078 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.000843 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. |