| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kiekin-gless (0) - 1 freq keekin-gless (1) - 27 freq keekingless (2) - 1 freq keckin-gless (2) - 1 freq wirkin-cless (3) - 6 freq leukin-gless (3) - 1 freq keekin-glesses (3) - 2 freq lukin-gless (3) - 1 freq luikin-gless (3) - 1 freq seein-gless (3) - 1 freq lookin-giess (4) - 1 freq green-gless (4) - 1 freq wirking-cless (4) - 1 freq leukkin-gless (4) - 1 freq lookingless (4) - 1 freq reek-less (5) - 1 freq freindless (5) - 1 freq bienless (5) - 2 freq workin-class (5) - 1 freq wurkin-class (5) - 4 freq hie-gloss (5) - 1 freq kinless (5) - 1 freq lookan-giess (5) - 1 freq leukin-glesses (5) - 1 freq meaningless (5) - 4 freq |
kiekin-gless (0) - 1 freq keekin-gless (1) - 27 freq keckin-gless (3) - 1 freq keekingless (3) - 1 freq luikin-gless (4) - 1 freq keekin-glesses (4) - 2 freq lukin-gless (4) - 1 freq leukin-gless (4) - 1 freq leukkin-gless (5) - 1 freq seein-gless (5) - 1 freq wirkin-cless (6) - 6 freq lookingless (6) - 1 freq green-gless (6) - 1 freq lookin-giess (6) - 1 freq looking-glass (7) - 1 freq lookan-giess (7) - 1 freq leukin-glesses (7) - 1 freq meaningless (8) - 4 freq reek-less (8) - 1 freq ooir-gless (8) - 1 freq kinless (8) - 1 freq wirking-cless (8) - 1 freq wurkin-class (8) - 4 freq hie-gloss (8) - 1 freq workin-class (8) - 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 |
KIEKIN-GLESS |
| Time to execute Levenshtein function - 0.629186 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.978857 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.030541 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.088212 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.001067 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. |