| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hiddlin (0) - 4 freq diddlin (1) - 2 freq middlin (1) - 10 freq fiddlin (1) - 5 freq piddlin (1) - 2 freq hidlin (1) - 1 freq riddlin (1) - 1 freq hiddlins (1) - 1 freq hoddlin (1) - 1 freq hiddlie (1) - 5 freq hiddin (1) - 1 freq fiddling (2) - 1 freq kiddin (2) - 70 freq hidenin (2) - 1 freq hoddin (2) - 3 freq cuddlin (2) - 4 freq huddlit (2) - 1 freq hirslin (2) - 2 freq guddlin (2) - 11 freq hidden (2) - 70 freq middlins (2) - 2 freq handlin (2) - 1 freq widdin (2) - 4 freq huddin (2) - 23 freq twiddlin (2) - 2 freq |
hiddlin (0) - 4 freq hoddlin (1) - 1 freq middlin (2) - 10 freq hiddin (2) - 1 freq diddlin (2) - 2 freq hiddlins (2) - 1 freq hiddlie (2) - 5 freq riddlin (2) - 1 freq piddlin (2) - 2 freq fiddlin (2) - 5 freq hidlin (2) - 1 freq howdlin (3) - 1 freq haddin (3) - 15 freq hiddil (3) - 2 freq hurdlin (3) - 1 freq toddlin (3) - 2 freq waddlin (3) - 2 freq huddin (3) - 23 freq coddlin (3) - 1 freq hiddled (3) - 6 freq hiddlet (3) - 1 freq hiddle (3) - 10 freq peddlin (3) - 6 freq huddling (3) - 1 freq huddlit (3) - 1 freq |
SoundEx code - H345 heidlan - 1 freq heidline - 13 freq howdlin - 1 freq heidlamps - 4 freq hiddlin - 4 freq hoodlums - 1 freq heidlines - 11 freq huddlin-thegither - 1 freq hidlins - 10 freq heidlang - 4 freq heidlans - 1 freq headlang - 2 freq headlines - 6 freq hoddlin - 1 freq heidline's - 1 freq heidlamp - 2 freq headlands - 1 freq hidlin - 1 freq headlamps - 1 freq hiddlins - 1 freq heidlaun - 1 freq huddling - 1 freq hotline - 1 freq headline - 10 freq heedlines - 1 freq huwdwilliams - 1 freq |
MetaPhone code - HTLN heidlan - 1 freq heidline - 13 freq howdlin - 1 freq hiddlin - 4 freq hoddlin - 1 freq hidlin - 1 freq heidlaun - 1 freq hotline - 1 freq headline - 10 freq |
HIDDLIN |
| Time to execute Levenshtein function - 0.254321 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.436688 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.036056 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.041392 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.000967 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. |