| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kittlin (0) - 59 freq kittlie (1) - 7 freq kittling (1) - 4 freq kittlit (1) - 1 freq littlin (1) - 17 freq tittlin (1) - 1 freq kittin (1) - 1 freq kittlins (1) - 5 freq kittlen (1) - 1 freq kitthin (1) - 1 freq kettlin (1) - 3 freq kitlin (1) - 4 freq kittln (1) - 1 freq kipplin (2) - 1 freq kittles (2) - 7 freq kittie (2) - 3 freq kinnlin (2) - 10 freq kitchin (2) - 2 freq killin (2) - 61 freq fettlin (2) - 6 freq kitten (2) - 5 freq kindlin (2) - 5 freq littlins (2) - 25 freq kinlin (2) - 2 freq rettlin (2) - 2 freq |
kittlin (0) - 59 freq kettlin (1) - 3 freq kittlen (1) - 1 freq kittln (1) - 1 freq kittlie (2) - 7 freq kitlin (2) - 4 freq littlin (2) - 17 freq kitthin (2) - 1 freq kittling (2) - 4 freq tittlin (2) - 1 freq kittlit (2) - 1 freq kittin (2) - 1 freq kittlins (2) - 5 freq kettlie (3) - 3 freq kittlt (3) - 4 freq ettlin (3) - 314 freq cuttlin (3) - 1 freq nettlin (3) - 1 freq battlin (3) - 4 freq kittil (3) - 9 freq kittled (3) - 24 freq futtlin (3) - 1 freq kittle (3) - 43 freq sattlin (3) - 4 freq rattlin (3) - 51 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 - KTLN cuddlin - 4 freq kittlin - 59 freq guddlin - 11 freq cuddle-an - 1 freq catalan - 24 freq catalonia - 8 freq codlin - 3 freq kittlen - 1 freq kettilonia - 4 freq cuddlean - 1 freq catilin - 1 freq kodaline - 1 freq kettlin - 3 freq cuddlan - 1 freq kittln - 1 freq cowdlin - 1 freq kitlin - 4 freq godlin - 1 freq coddlin - 1 freq cuttlin - 1 freq catalunia - 1 freq caitlin - 3 freq catalonie - 1 freq cdolan - 12 freq |
KITTLIN |
| Time to execute Levenshtein function - 0.231072 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.369346 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.027420 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.038498 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.000805 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. |