Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hidiehole (0) - 1 freq hidie-hole (1) - 4 freq hideyhole (2) - 6 freq hidie-holl (2) - 1 freq hidie-holes (2) - 1 freq bidie-hole (2) - 1 freq shitehole (3) - 10 freq hydie-holl (3) - 1 freq hidey-hole (3) - 6 freq hidsel (4) - 7 freq hidey-holes (4) - 1 freq hoidy-hol (4) - 1 freq arsehole (4) - 19 freq ersehole (4) - 12 freq hellhole (4) - 2 freq hedgehog (4) - 39 freq hideout (4) - 1 freq hidie (4) - 1 freq tod-hole (4) - 3 freq heidphone (4) - 2 freq helliehowe (4) - 1 freq hoosehold (4) - 12 freq shithole (4) - 2 freq hideous (4) - 7 freq hedgehogs (4) - 12 freq |
hidiehole (0) - 1 freq hideyhole (2) - 6 freq hidie-hole (2) - 4 freq bidie-hole (4) - 1 freq hidey-hole (4) - 6 freq hidie-holes (4) - 1 freq hidie-holl (4) - 1 freq hidsel (5) - 7 freq hiddle (5) - 10 freq hoidy-hol (5) - 1 freq hydie-holl (5) - 1 freq shitehole (5) - 10 freq rdhale (6) - 3 freq hid'l (6) - 1 freq hiddil (6) - 2 freq hechle (6) - 1 freq ridicule (6) - 7 freq hiddlie (6) - 5 freq heichlie (6) - 2 freq hiddelt (6) - 3 freq huddle (6) - 6 freq heddle (6) - 1 freq hoddle (6) - 1 freq hushle (6) - 1 freq heighly (6) - 1 freq |
SoundEx code - H340 hidie-hole - 4 freq hotel - 91 freq heid'll - 2 freq hiddle - 10 freq hidey-hole - 6 freq heathowl - 1 freq hid'll - 15 freq hottle - 1 freq 'hid'll - 1 freq hit'll - 14 freq hotly - 1 freq 'hotel - 1 freq hoidall - 1 freq hootel - 3 freq hid'l - 1 freq heddle - 1 freq hid'il - 1 freq huddle - 6 freq hoidy-hol - 1 freq hidey-hole - 1 freq httle - 1 freq hideyhole - 6 freq huddl - 1 freq hidiehole - 1 freq hidie-holl - 1 freq hydie-holl - 1 freq hiddil - 2 freq hiddlie - 5 freq hedley - 1 freq heatlie - 3 freq hoddle - 1 freq hodyhöl - 1 freq |
MetaPhone code - HTHL hidie-hole - 4 freq hidey-hole - 6 freq hoidy-hol - 1 freq hidey-hole - 1 freq hideyhole - 6 freq hidiehole - 1 freq hidie-holl - 1 freq |
HIDIEHOLE |
Time to execute Levenshtein function - 0.206745 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.405493 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.038727 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.048460 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.001057 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. |