| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kqks (0) - 1 freq kks (1) - 1 freq kqms (1) - 1 freq keks (1) - 4 freq qzs (2) - 1 freq kicks (2) - 29 freq gqkzs (2) - 1 freq loks (2) - 1 freq toks (2) - 1 freq kko (2) - 3 freq srks (2) - 1 freq kqe (2) - 1 freq kakes (2) - 1 freq taks (2) - 458 freq koko (2) - 1 freq qkf (2) - 1 freq elks (2) - 2 freq irks (2) - 1 freq aiks (2) - 3 freq kky (2) - 1 freq ilks (2) - 1 freq hnks (2) - 1 freq kfcs (2) - 1 freq knas (2) - 1 freq kieks (2) - 3 freq |
kqks (0) - 1 freq kqms (2) - 1 freq keks (2) - 4 freq kks (2) - 1 freq kecks (3) - 5 freq kieks (3) - 3 freq kakes (3) - 1 freq kinks (3) - 12 freq kirks (3) - 30 freq keeks (3) - 16 freq kicks (3) - 29 freq ktkn (4) - 1 freq kake (4) - 1 freq siks (4) - 4 freq uks (4) - 1 freq aks (4) - 18 freq kays (4) - 1 freq kips (4) - 3 freq waks (4) - 8 freq asks (4) - 216 freq arks (4) - 1 freq qis (4) - 1 freq kms (4) - 1 freq noks (4) - 1 freq wks (4) - 1 freq |
SoundEx code - K000 kye - 140 freq ka - 12 freq k - 205 freq key - 219 freq kg - 4 freq ko - 7 freq k's - 1 freq kk - 4 freq ky - 6 freq ke - 18 freq kaay - 1 freq kiwi - 2 freq kïss - 3 freq kay - 67 freq kiæie - 1 freq kaa - 2 freq kew - 1 freq kau - 2 freq 'ke - 1 freq žk - 3 freq ‹k - 3 freq ªk - 3 freq kyo - 2 freq ku - 3 freq kye' - 1 freq kko - 3 freq kkaw - 1 freq kh - 5 freq kaye - 4 freq kie - 16 freq €˜k - 3 freq kuei - 2 freq kso - 2 freq kuo - 3 freq ks - 3 freq kye- - 1 freq kke - 1 freq kc - 7 freq kx - 6 freq kzeyi - 1 freq kz - 4 freq kczoe - 1 freq kj - 4 freq kxx - 1 freq kca - 1 freq kky - 1 freq kyu - 1 freq kqu - 1 freq kge - 1 freq ki - 3 freq kqks - 1 freq kci - 1 freq ksc - 1 freq kgs - 1 freq kks - 1 freq kqe - 1 freq kjkz - 1 freq kgq - 1 freq kxo - 1 freq kxiw - 1 freq kwai - 1 freq kjow - 1 freq kua - 1 freq kw - 1 freq |
MetaPhone code - KKKS yccx - 1 freq kqks - 1 freq qwkqs - 1 freq |
KQKS |
| Time to execute Levenshtein function - 0.204850 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.415333 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.028923 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.040742 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.001063 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. |