Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cuddles (0) - 9 freq cuddler (1) - 1 freq guddles (1) - 2 freq cuddies (1) - 49 freq cruddles (1) - 1 freq cuddlet (1) - 1 freq huddles (1) - 1 freq puddles (1) - 12 freq cuddle (1) - 25 freq cuddled (1) - 7 freq middles (2) - 1 freq cundies (2) - 5 freq guddle (2) - 34 freq duddies (2) - 2 freq cuddies' (2) - 2 freq huddle (2) - 6 freq cuddlan (2) - 1 freq caundles (2) - 1 freq huddled (2) - 20 freq huddies (2) - 1 freq riddles (2) - 9 freq hurdles (2) - 1 freq muddle (2) - 9 freq coddled (2) - 1 freq caddies (2) - 2 freq |
cuddles (0) - 9 freq huddles (2) - 1 freq puddles (2) - 12 freq cuddled (2) - 7 freq cuddlet (2) - 1 freq cuddle (2) - 25 freq cruddles (2) - 1 freq cuddler (2) - 1 freq guddles (2) - 2 freq cuddies (2) - 49 freq cuddys (3) - 1 freq tiddles (3) - 8 freq cuddy's (3) - 1 freq paddles (3) - 1 freq waddles (3) - 1 freq piddles (3) - 4 freq cuddlean (3) - 1 freq toddles (3) - 1 freq candles (3) - 9 freq doddles (3) - 2 freq fiddles (3) - 18 freq cradles (3) - 6 freq seddles (3) - 1 freq cuddie's (3) - 10 freq saddles (3) - 3 freq |
SoundEx code - C342 catalogue - 16 freq catholic - 52 freq couthie-like - 2 freq catalyst - 8 freq coat-tails - 5 freq chattels - 1 freq catholics - 10 freq catalogued - 2 freq cuddles - 9 freq coatless - 1 freq cathlics - 2 freq cowt-lik - 1 freq cataloguin' - 2 freq catholicism - 1 freq catalysts - 1 freq cutlasses - 1 freq cuttie-like - 1 freq catwalk - 1 freq catholik - 1 freq cuttie-lik - 2 freq cat-like - 1 freq caithlick - 2 freq chattles - 2 freq cataloag - 1 freq cdlkturj - 1 freq |
MetaPhone code - KTLS kittles - 7 freq godless - 12 freq ketil's - 2 freq gutless - 1 freq kettle's - 1 freq cuddles - 9 freq coatless - 1 freq kettles - 2 freq guidless - 3 freq guddle's - 1 freq guddles - 2 freq gödless - 1 freq |
CUDDLES |
Time to execute Levenshtein function - 0.592814 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 - 1.003559 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.080756 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.038972 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.000881 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. |