| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puddles (0) - 12 freq paddles (1) - 1 freq puddled (1) - 2 freq huddles (1) - 1 freq cuddles (1) - 9 freq piddles (1) - 4 freq guddles (1) - 2 freq puddle (1) - 26 freq fuddled (2) - 1 freq middles (2) - 1 freq paddled (2) - 5 freq cuddle (2) - 25 freq toddles (2) - 1 freq puckles (2) - 14 freq riddles (2) - 9 freq puddins (2) - 13 freq cruddles (2) - 1 freq paddle (2) - 23 freq huddled (2) - 20 freq guddle (2) - 34 freq puddeens (2) - 1 freq guddled (2) - 9 freq saddles (2) - 3 freq fiddles (2) - 18 freq hurdles (2) - 1 freq |
puddles (0) - 12 freq piddles (1) - 4 freq paddles (1) - 1 freq guddles (2) - 2 freq paiddles (2) - 2 freq puddle (2) - 26 freq cuddles (2) - 9 freq puddled (2) - 2 freq huddles (2) - 1 freq puddlin (3) - 1 freq piddled (3) - 1 freq doddles (3) - 2 freq seddles (3) - 1 freq fiddles (3) - 18 freq puddens (3) - 7 freq waddles (3) - 1 freq piddle (3) - 3 freq saddles (3) - 3 freq peddled (3) - 1 freq puddoks (3) - 1 freq paddler (3) - 2 freq tiddles (3) - 8 freq paddle (3) - 23 freq riddles (3) - 9 freq puddins (3) - 13 freq |
SoundEx code - P342 petals - 22 freq padlock - 5 freq puddles - 12 freq podlie's - 1 freq padlocks - 1 freq potless - 1 freq pitlochory - 1 freq pathologically - 1 freq peitiless - 2 freq pitlochry - 7 freq paiddles - 2 freq pitiless - 1 freq peetiless - 1 freq piddles - 4 freq pedals - 3 freq pot-holes - 1 freq pathologist - 1 freq pathological - 1 freq paddles - 1 freq potlicht - 1 freq ptlz - 1 freq padlocks - 1 freq |
MetaPhone code - PTLS petals - 22 freq puddles - 12 freq podlie's - 1 freq potless - 1 freq peitiless - 2 freq paiddles - 2 freq pitiless - 1 freq peetiless - 1 freq piddles - 4 freq pedals - 3 freq paddles - 1 freq ptlz - 1 freq |
PUDDLES |
| Time to execute Levenshtein function - 0.186318 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.376311 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.029369 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.043407 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.001046 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. |