| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kizzens (0) - 6 freq rizzens (1) - 1 freq sizzens (1) - 8 freq pizzens (1) - 1 freq dizzens (1) - 19 freq izzens (1) - 1 freq kizzen (1) - 10 freq gizzens (1) - 1 freq cizzens (1) - 1 freq bizzen (2) - 2 freq gizzen (2) - 5 freq kittens (2) - 7 freq gizzes (2) - 2 freq sizzent (2) - 1 freq wizzen (2) - 4 freq wizzent (2) - 5 freq gizzerns (2) - 1 freq dizzen (2) - 85 freq fizzers (2) - 1 freq dizens (2) - 1 freq kinnens (2) - 4 freq jizzen (2) - 4 freq gizzent (2) - 8 freq wizzen's (2) - 1 freq sizzen (2) - 3 freq |
kizzens (0) - 6 freq kizzen (2) - 10 freq gizzens (2) - 1 freq izzens (2) - 1 freq cizzens (2) - 1 freq dizzens (2) - 19 freq sizzens (2) - 8 freq pizzens (2) - 1 freq rizzens (2) - 1 freq kizzin (3) - 1 freq jizzen (4) - 4 freq kinnens (4) - 4 freq dizens (4) - 1 freq gizzent (4) - 8 freq wizzen's (4) - 1 freq fizzers (4) - 1 freq pizzen (4) - 2 freq pizzenous (4) - 2 freq sizzen (4) - 3 freq gizzen (4) - 5 freq bizzen (4) - 2 freq dizzen (4) - 85 freq kittens (4) - 7 freq gizzes (4) - 2 freq gizzerns (4) - 1 freq |
SoundEx code - K252 kizzens - 6 freq keekin-gless - 27 freq kicking - 6 freq k-i-s-s-i-n-g-ee - 1 freq keekin-glesses - 2 freq kiekin-gless - 1 freq keekingless - 1 freq keckin-gless - 1 freq kechynis - 1 freq keiching - 1 freq kissing - 2 freq keeking - 1 freq kashanacauley - 1 freq kazmackscot - 4 freq |
MetaPhone code - KSNS cousins - 46 freq kizzens - 6 freq cousin's - 15 freq casinos - 1 freq cuisins - 1 freq cousins - 1 freq casino's - 1 freq |
KIZZENS |
| Time to execute Levenshtein function - 0.275105 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.426025 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.030577 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.039056 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.000906 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. |