| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kxf (0) - 1 freq kif (1) - 1 freq kcf (1) - 1 freq kdf (1) - 1 freq xf (1) - 6 freq kyf (1) - 1 freq kf (1) - 3 freq kwf (1) - 1 freq kmf (1) - 1 freq kxx (1) - 1 freq kxo (1) - 1 freq kxn (1) - 1 freq kx (1) - 6 freq yxd (2) - 1 freq yxx (2) - 1 freq kix (2) - 1 freq obf (2) - 1 freq exy (2) - 1 freq kb (2) - 4 freq jf (2) - 1 freq kk (2) - 3 freq kat (2) - 156 freq xb (2) - 3 freq hxn (2) - 1 freq gcf (2) - 1 freq |
kxf (0) - 1 freq kxx (2) - 1 freq kxo (2) - 1 freq kx (2) - 6 freq kwf (2) - 1 freq kxn (2) - 1 freq kmf (2) - 1 freq kf (2) - 3 freq kif (2) - 1 freq kdf (2) - 1 freq kcf (2) - 1 freq xf (2) - 6 freq kyf (2) - 1 freq kaif (3) - 1 freq knif (3) - 1 freq kffi (3) - 1 freq kxiw (3) - 1 freq koxo (3) - 2 freq xfu (3) - 1 freq kix (3) - 1 freq kko (4) - 3 freq uxfm (4) - 1 freq xs (4) - 2 freq lxr (4) - 1 freq key (4) - 217 freq |
SoundEx code - K100 keep - 1525 freq kep - 136 freq kip - 38 freq keevee - 1 freq 'keep - 23 freq keip - 4 freq keepy - 1 freq kap - 1 freq 'kappa' - 1 freq kowp - 1 freq kop - 2 freq kepe - 4 freq koffie - 1 freq kep' - 2 freq kaip - 2 freq kaif - 1 freq €™kiep - 1 freq kypie - 1 freq €œkeep - 8 freq keppy - 1 freq €˜keep - 2 freq kappa - 1 freq kb - 4 freq kyoab - 1 freq kee-vee - 2 freq keb - 2 freq €™keep - 1 freq kubby - 1 freq kgb - 3 freq kv - 10 freq kwf - 1 freq ksjyvvf - 1 freq kyf - 1 freq kcf - 1 freq kaypee - 2 freq kf - 3 freq kp - 6 freq kev - 6 freq kif - 1 freq kwuavb - 1 freq kkv - 1 freq kabb - 1 freq kufae - 1 freq ko-fi - 1 freq kxf - 1 freq kcwphh - 1 freq kgv - 1 freq kpv - 1 freq kffi - 1 freq kjcsf - 2 freq kbp - 1 freq kapo - 1 freq |
MetaPhone code - KKSF cqsveh - 1 freq kxf - 1 freq |
KXF |
| Time to execute Levenshtein function - 0.211199 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.347659 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.027411 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.040238 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.000854 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. |