| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kittliness (0) - 1 freq kittlin's (2) - 2 freq kittlins' (2) - 1 freq kittlins (2) - 5 freq kittles (3) - 7 freq likeliness (3) - 1 freq pithiness (3) - 1 freq laithliness (3) - 1 freq kittling (3) - 4 freq kittlie (3) - 7 freq kittlin (3) - 59 freq littlin's (3) - 2 freq littlins (3) - 25 freq bitterness (3) - 9 freq kitlins (3) - 6 freq pitiless (4) - 1 freq ditties (4) - 1 freq kittie (4) - 3 freq fitness (4) - 20 freq lipliners (4) - 1 freq bitties (4) - 29 freq tittlin (4) - 1 freq kisties (4) - 8 freq emptiness (4) - 8 freq kineness (4) - 2 freq |
kittliness (0) - 1 freq kittlin's (3) - 2 freq kittlins (3) - 5 freq kittlins' (3) - 1 freq littlins (5) - 25 freq bitterness (5) - 9 freq littlin's (5) - 2 freq kettleens (5) - 3 freq kitlins (5) - 6 freq kittlin (5) - 59 freq kittles (5) - 7 freq kittling (5) - 4 freq laithliness (5) - 1 freq ettlins (6) - 26 freq kittenish (6) - 1 freq kittens (6) - 7 freq kitten's (6) - 1 freq kittlen (6) - 1 freq kittln (6) - 1 freq ettlin's (6) - 1 freq kettles (6) - 2 freq littleins (6) - 1 freq littlans (6) - 2 freq gentleness (6) - 1 freq knotless (6) - 3 freq |
SoundEx code - K345 kittliness - 1 freq kittlin - 59 freq kathleen - 25 freq kittlen - 1 freq kittlins' - 1 freq kettilonia - 4 freq kodaline - 1 freq kittlins - 5 freq kettlin - 3 freq kettleens - 3 freq kitlins - 6 freq kittln - 1 freq kittlin's - 2 freq kitlin - 4 freq kittling - 4 freq kathleenjamie - 1 freq |
MetaPhone code - KTLNS kittliness - 1 freq catalans - 3 freq codlin's - 13 freq codlins - 4 freq kittlins' - 1 freq kittlins - 5 freq kettleens - 3 freq kitlins - 6 freq guidelines - 26 freq kittlin's - 2 freq quaetlins - 10 freq godliness - 1 freq €˜cotillions - 1 freq |
KITTLINESS |
| Time to execute Levenshtein function - 0.248944 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.466952 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.029768 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.044184 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.001161 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. |