| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kjkz (0) - 1 freq kj (2) - 4 freq kqks (2) - 1 freq keks (2) - 4 freq ijz (2) - 1 freq jjkb (2) - 1 freq jcz (2) - 1 freq jmz (2) - 1 freq kke (2) - 1 freq kko (2) - 3 freq ojjz (2) - 1 freq jkp (2) - 1 freq kkv (2) - 1 freq kky (2) - 1 freq qjz (2) - 1 freq jk (2) - 8 freq kjm (2) - 1 freq kidz (2) - 1 freq jz (2) - 1 freq kk (2) - 3 freq kdz (2) - 1 freq kz (2) - 4 freq khkr (2) - 1 freq djkd (2) - 1 freq qikz (2) - 1 freq |
kjkz (0) - 1 freq kaz (4) - 3 freq kwaz (4) - 1 freq djk (4) - 1 freq jyz (4) - 1 freq kake (4) - 1 freq tkz (4) - 1 freq klaz (4) - 1 freq koko (4) - 1 freq fjz (4) - 1 freq jkt (4) - 1 freq kjow (4) - 1 freq jgz (4) - 1 freq kdaz (4) - 1 freq wjz (4) - 2 freq njk (4) - 1 freq kzhz (4) - 1 freq kek (4) - 1 freq xgkz (4) - 1 freq kiz (4) - 18 freq kik (4) - 1 freq ktkn (4) - 1 freq qikz (4) - 1 freq kks (4) - 1 freq jmz (4) - 1 freq |
SoundEx code - K000 kye - 140 freq ka - 12 freq k - 204 freq key - 217 freq kg - 4 freq ko - 7 freq k's - 1 freq ke - 18 freq kaay - 1 freq kiwi - 2 freq ky - 5 freq kïss - 3 freq kk - 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 - KJKS kjkz - 1 freq |
KJKZ |
| Time to execute Levenshtein function - 0.211367 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.313267 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.027533 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.037600 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.000881 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. |