| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoddled (0) - 5 freq hoddle (1) - 1 freq coddled (1) - 1 freq huddled (1) - 20 freq hiddled (1) - 6 freq hooded (2) - 1 freq toddied (2) - 1 freq hochled (2) - 1 freq fiddled (2) - 1 freq doddle (2) - 4 freq saddled (2) - 2 freq piddled (2) - 1 freq fuddled (2) - 1 freq huddle (2) - 6 freq raddled (2) - 1 freq nodded (2) - 71 freq addled (2) - 3 freq hiddlet (2) - 1 freq heddle (2) - 1 freq guddled (2) - 9 freq riddled (2) - 7 freq paddled (2) - 5 freq diddled (2) - 2 freq howled (2) - 15 freq peddled (2) - 1 freq |
hoddled (0) - 5 freq hiddled (1) - 6 freq huddled (1) - 20 freq hoddle (2) - 1 freq coddled (2) - 1 freq handled (3) - 7 freq muddled (3) - 4 freq peddled (3) - 1 freq paddled (3) - 5 freq cuddled (3) - 7 freq diddled (3) - 2 freq hiddle (3) - 10 freq huddles (3) - 1 freq hudded (3) - 1 freq guddled (3) - 9 freq hoddlin (3) - 1 freq waddled (3) - 4 freq puddled (3) - 2 freq riddled (3) - 7 freq fuddled (3) - 1 freq huddle (3) - 6 freq piddled (3) - 1 freq saddled (3) - 2 freq fiddled (3) - 1 freq heddle (3) - 1 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.204424 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.373584 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.032674 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.048888 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.001139 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. |