Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hoosehald (0) - 1 freq hoosehauld (1) - 2 freq househald (1) - 2 freq hoosehold (1) - 12 freq hoosehaud (1) - 62 freq household (2) - 10 freq hoosehauds (2) - 5 freq hooseholds (2) - 1 freq hoosemaid (2) - 6 freq hooshed (3) - 1 freq hoose-end (3) - 2 freq hoosebay (3) - 3 freq housemaid (3) - 1 freq hoosed (3) - 6 freq horsehair (3) - 3 freq hoose'll (3) - 2 freq hoosewark (3) - 5 freq hoosemaids (3) - 1 freq moose-a (4) - 3 freq house-heid (4) - 1 freq soshal (4) - 4 freq hoovered (4) - 4 freq moose-holl (4) - 1 freq hooswark (4) - 1 freq horsefaal (4) - 11 freq |
hoosehald (0) - 1 freq househald (1) - 2 freq hoosehold (1) - 12 freq hoosehauld (1) - 2 freq household (2) - 10 freq hoosehaud (2) - 62 freq hooseholds (3) - 1 freq hooshed (4) - 1 freq hoosemaid (4) - 6 freq hoosehauds (4) - 5 freq hoose'll (5) - 2 freq housemaid (5) - 1 freq hoosed (5) - 6 freq hoose-end (5) - 2 freq hous-heid (6) - 1 freq hochled (6) - 1 freq haerald (6) - 1 freq hashed (6) - 4 freq hooched (6) - 3 freq rosehill (6) - 3 freq hoased (6) - 1 freq herald (6) - 33 freq hooshin (6) - 1 freq goswald (6) - 1 freq shooled (6) - 1 freq |
SoundEx code - H243 haglet - 1 freq huckled - 12 freq heckled - 1 freq hauchled - 1 freq higgeldy-piggeldy - 1 freq hochlet - 1 freq higgledy - 1 freq hoosehold - 12 freq huckelt - 1 freq hochled - 1 freq haggult - 1 freq household - 10 freq heckelt - 1 freq heukelt - 2 freq hoosehald - 1 freq higgledy-piggledy - 1 freq higgelty-piggelty - 1 freq heighlit - 1 freq heich-leid - 1 freq hechl't - 2 freq hochl't - 2 freq hazeldean' - 1 freq hickled - 1 freq hacklet - 1 freq hechlet - 1 freq househald - 2 freq high-heeled - 1 freq hoosehauld - 2 freq hushlet - 1 freq hagglet - 2 freq higgilty - 1 freq hazelheed - 1 freq hooseholds - 1 freq |
MetaPhone code - HSHLT hoosehold - 12 freq household - 10 freq hoosehald - 1 freq househald - 2 freq hoosehauld - 2 freq |
HOOSEHALD |
Time to execute Levenshtein function - 0.208387 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.406912 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.027533 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.037172 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.000763 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. |