Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tiddles (0) - 8 freq riddles (1) - 9 freq tiddler (1) - 2 freq fiddles (1) - 14 freq piddles (1) - 4 freq middles (1) - 1 freq tiddle (1) - 1 freq toddles (1) - 1 freq fiddler (2) - 21 freq cuddles (2) - 9 freq toddler (2) - 2 freq biddies (2) - 3 freq toddle (2) - 3 freq seddles (2) - 1 freq huddles (2) - 1 freq saddles (2) - 3 freq teddies (2) - 2 freq idles (2) - 1 freq tiles (2) - 16 freq puddles (2) - 12 freq piddle (2) - 3 freq doddles (2) - 2 freq riddle (2) - 32 freq tides (2) - 22 freq diddies (2) - 2 freq |
tiddles (0) - 8 freq toddles (1) - 1 freq tiddle (2) - 1 freq tiddler (2) - 2 freq middles (2) - 1 freq riddles (2) - 9 freq piddles (2) - 4 freq fiddles (2) - 14 freq tiddly (3) - 1 freq doddles (3) - 2 freq paiddles (3) - 2 freq waddles (3) - 1 freq paddles (3) - 1 freq puddles (3) - 12 freq taddies (3) - 1 freq guddles (3) - 2 freq toddlers (3) - 3 freq toddle (3) - 3 freq cuddles (3) - 9 freq huddles (3) - 1 freq seddles (3) - 1 freq saddles (3) - 3 freq toddler (3) - 2 freq teddies (3) - 2 freq piddled (4) - 1 freq |
SoundEx code - T342 toddles - 1 freq tytal's - 1 freq thoattless - 1 freq titles - 13 freq tautological - 2 freq title's - 1 freq toothless - 3 freq tod-tails - 1 freq teitils - 2 freq teetles - 1 freq towtie-lik - 1 freq tea-towels - 2 freq tiddles - 8 freq €œtiddles - 1 freq tuithless - 2 freq tattoo-like - 1 freq tattles - 3 freq thetalk - 1 freq tothelake - 1 freq tweetolectology - 4 freq thatlassie - 1 freq |
MetaPhone code - TTLS details - 70 freq dootless - 7 freq toddles - 1 freq tytal's - 1 freq titles - 13 freq title's - 1 freq deedless - 1 freq doddles - 2 freq doutless - 4 freq dawdles - 1 freq teitils - 2 freq teetles - 1 freq dedalus - 1 freq daedalus - 27 freq tiddles - 8 freq €œtiddles - 1 freq tattles - 3 freq |
TIDDLES |
Time to execute Levenshtein function - 0.197283 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.379098 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.028337 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.037244 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.000869 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. |