| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoddled (0) - 5 freq huddled (1) - 20 freq coddled (1) - 1 freq hoddle (1) - 1 freq hiddled (1) - 6 freq huddles (2) - 1 freq hodged (2) - 3 freq toddler (2) - 2 freq hudded (2) - 1 freq hooded (2) - 1 freq muddled (2) - 4 freq riddled (2) - 7 freq cuddled (2) - 7 freq howled (2) - 15 freq hobbled (2) - 2 freq fuddled (2) - 1 freq hiddle (2) - 10 freq doddle (2) - 4 freq heddle (2) - 1 freq troddled (2) - 1 freq diddled (2) - 2 freq toddied (2) - 1 freq noddle (2) - 2 freq fiddled (2) - 1 freq peddled (2) - 1 freq |
hoddled (0) - 5 freq huddled (1) - 20 freq hiddled (1) - 6 freq hoddle (2) - 1 freq coddled (2) - 1 freq saddled (3) - 2 freq puddled (3) - 2 freq hoddlin (3) - 1 freq fiddled (3) - 1 freq paddled (3) - 5 freq peddled (3) - 1 freq addled (3) - 3 freq piddled (3) - 1 freq huddle (3) - 6 freq raddled (3) - 1 freq waddled (3) - 4 freq diddled (3) - 2 freq guddled (3) - 9 freq handled (3) - 7 freq hiddlet (3) - 1 freq cuddled (3) - 7 freq fuddled (3) - 1 freq huddles (3) - 1 freq riddled (3) - 7 freq hiddle (3) - 10 freq |
SoundEx code - H343 huddled - 20 freq hiddelt - 3 freq huddlit - 1 freq huddilt - 1 freq hoddled - 5 freq hiddled - 6 freq hiddilt - 1 freq hiddlet - 1 freq |
MetaPhone code - HTLT huddled - 20 freq hiddelt - 3 freq huddlit - 1 freq huddilt - 1 freq hoddled - 5 freq hiddled - 6 freq heidlight - 1 freq hiddilt - 1 freq hiddlet - 1 freq |
HODDLED |
| Time to execute Levenshtein function - 0.213430 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.720338 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.058714 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.036560 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.000761 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. |