| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keekingless (0) - 1 freq keekin-gless (1) - 27 freq kiekin-gless (2) - 1 freq keckin-gless (2) - 1 freq seein-gless (3) - 1 freq meaningless (3) - 4 freq lookingless (3) - 1 freq keekin-glesses (3) - 2 freq leukin-gless (3) - 1 freq neediness (4) - 1 freq peetiless (4) - 1 freq lukin-gless (4) - 1 freq freindless (4) - 1 freq skeeliness (4) - 1 freq leukkin-gless (4) - 1 freq reekless (4) - 1 freq meaninless (4) - 2 freq keeking (4) - 1 freq reek-less (4) - 1 freq seediness (4) - 1 freq seekness (4) - 11 freq luikin-gless (4) - 1 freq teenless (4) - 1 freq kinless (4) - 1 freq keenness (4) - 1 freq |
keekingless (0) - 1 freq keekin-gless (2) - 27 freq kiekin-gless (3) - 1 freq keckin-gless (4) - 1 freq lookingless (4) - 1 freq leukin-gless (5) - 1 freq keekin-glesses (5) - 2 freq meaningless (5) - 4 freq kinless (6) - 1 freq leukkin-gless (6) - 1 freq lukin-gless (6) - 1 freq luikin-gless (6) - 1 freq seein-gless (6) - 1 freq keenness (7) - 1 freq teenless (7) - 1 freq seekness (7) - 11 freq songless (7) - 1 freq kungles (7) - 1 freq kinglassie (7) - 4 freq sangless (7) - 2 freq freindless (7) - 1 freq reekless (7) - 1 freq meaninless (7) - 2 freq reek-less (7) - 1 freq keeking (7) - 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 - KKNKLS keekin-gless - 27 freq kiekin-gless - 1 freq keekingless - 1 freq keckin-gless - 1 freq |
KEEKINGLESS |
| Time to execute Levenshtein function - 0.285414 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.588514 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.027500 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.073530 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.000933 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. |