Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
huddled (0) - 20 freq hoddled (1) - 5 freq huddles (1) - 1 freq huddle (1) - 6 freq guddled (1) - 9 freq cuddled (1) - 7 freq muddled (1) - 4 freq puddled (1) - 2 freq fuddled (1) - 1 freq hiddled (1) - 6 freq hudded (1) - 1 freq raddled (2) - 1 freq huddies (2) - 1 freq huddl (2) - 1 freq paddled (2) - 5 freq riddled (2) - 7 freq hummled (2) - 1 freq cuddlet (2) - 1 freq hiddlet (2) - 1 freq puddles (2) - 12 freq humbled (2) - 1 freq hunkled (2) - 1 freq guddle (2) - 34 freq cuddied (2) - 1 freq cuddle (2) - 25 freq |
huddled (0) - 20 freq hoddled (1) - 5 freq hiddled (1) - 6 freq puddled (2) - 2 freq fuddled (2) - 1 freq muddled (2) - 4 freq hudded (2) - 1 freq huddles (2) - 1 freq cuddled (2) - 7 freq huddle (2) - 6 freq guddled (2) - 9 freq fiddled (3) - 1 freq addled (3) - 3 freq handled (3) - 7 freq diddled (3) - 2 freq huddlit (3) - 1 freq saddled (3) - 2 freq waddled (3) - 4 freq coddled (3) - 1 freq peddled (3) - 1 freq haundled (3) - 1 freq hiddle (3) - 10 freq riddled (3) - 7 freq paddled (3) - 5 freq huddl (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 |
HUDDLED |
Time to execute Levenshtein function - 0.205571 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.370456 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.028118 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.038053 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.000884 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. |