| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| koyehhbiis (0) - 1 freq konshis (5) - 1 freq foreheids (5) - 1 freq rosehips (5) - 1 freq owerhails (5) - 1 freq kechynis (5) - 1 freq somethins (5) - 2 freq kythins (5) - 1 freq kyefis (5) - 1 freq coneheids (5) - 1 freq kishies (6) - 4 freq hubris (6) - 1 freq onesies (6) - 1 freq kæbils (6) - 1 freq keyholes (6) - 2 freq ayewcis (6) - 1 freq derbies (6) - 2 freq moothins (6) - 1 freq somethin's (6) - 19 freq oreegins (6) - 2 freq yettis (6) - 1 freq leeshins (6) - 1 freq overbite (6) - 1 freq braeheids (6) - 1 freq kythit (6) - 25 freq |
koyehhbiis (0) - 1 freq kechynis (7) - 1 freq kythins (7) - 1 freq kerbs (8) - 3 freq kechs (8) - 1 freq knobbies (8) - 2 freq yhybys (8) - 1 freq doughboys (8) - 2 freq kebabs (8) - 3 freq kehs (8) - 1 freq hobbies (8) - 8 freq dotheboys (8) - 1 freq kubis (8) - 3 freq kythes (8) - 64 freq keyholes (8) - 2 freq owerhails (8) - 1 freq kyths (8) - 6 freq rosehips (8) - 1 freq foreheids (8) - 1 freq konshis (8) - 1 freq kyefis (8) - 1 freq coneheids (8) - 1 freq keechs (8) - 1 freq kishies (8) - 4 freq hbbs (9) - 1 freq |
SoundEx code - K120 keeps - 161 freq keep's - 3 freq kybosh - 3 freq kebbock - 2 freq kips - 3 freq keps - 6 freq kubis - 3 freq kebbuck - 5 freq kippage - 1 freq kebbok - 1 freq keb-hoose - 1 freq keep-hoose - 3 freq kfc - 5 freq ksvvkca - 1 freq kfcs - 1 freq kpj - 1 freq koyehhbiis - 1 freq kpju - 1 freq kibosh - 1 freq keeeeebzy - 2 freq kpxs - 1 freq kjjvsgo - 1 freq kbaek - 1 freq kps - 1 freq kjovoiz - 1 freq kyefis - 1 freq kbgc - 1 freq kbzjo - 1 freq |
MetaPhone code - KYBS koyehhbiis - 1 freq |
KOYEHHBIIS |
| Time to execute Levenshtein function - 0.251495 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.430440 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.029911 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.040465 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.001090 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. |