| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kyisses (0) - 1 freq kisses (1) - 29 freq yisses (1) - 2 freq kissies (2) - 1 freq misses (2) - 16 freq hisses (2) - 3 freq vlisses (2) - 2 freq plisses (2) - 4 freq fisses (2) - 1 freq uisses (2) - 2 freq wisses (2) - 4 freq kissed (2) - 66 freq blisses (2) - 3 freq pisses (2) - 4 freq kisser (2) - 5 freq kyiss (2) - 1 freq klosses (2) - 1 freq knipes (3) - 3 freq uissis (3) - 1 freq faissis (3) - 1 freq yissfu (3) - 2 freq lissen (3) - 10 freq raisse (3) - 1 freq kissie (3) - 1 freq kines (3) - 21 freq |
kyisses (0) - 1 freq kisses (1) - 29 freq kissies (2) - 1 freq yisses (2) - 2 freq pisses (3) - 4 freq kissed (3) - 66 freq kisser (3) - 5 freq klosses (3) - 1 freq wisses (3) - 4 freq kyiss (3) - 1 freq uisses (3) - 2 freq fisses (3) - 1 freq misses (3) - 16 freq hisses (3) - 3 freq passes (4) - 68 freq issues (4) - 86 freq fesses (4) - 1 freq kists (4) - 31 freq masses (4) - 12 freq bosses (4) - 9 freq lasses (4) - 69 freq basses (4) - 2 freq kiss (4) - 120 freq yasss (4) - 1 freq yassss (4) - 4 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 - KYSS kyisses - 1 freq |
KYISSES |
| Time to execute Levenshtein function - 0.292777 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.627797 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.061832 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.038612 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.000936 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. |