| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoosehold (0) - 12 freq hooseholds (1) - 1 freq hoosehald (1) - 1 freq household (1) - 10 freq househald (2) - 2 freq hoosehauld (2) - 2 freq hoosehaud (2) - 62 freq moose-holl (3) - 1 freq hooseboun (3) - 1 freq hoosework (3) - 6 freq moose-hole (3) - 3 freq moose-hol (3) - 1 freq hoose'll (3) - 2 freq hoosemaid (3) - 6 freq hooshed (3) - 1 freq hoosed (3) - 6 freq hoosecoat (3) - 2 freq foothold (3) - 2 freq hoosehauds (3) - 5 freq hoose-end (3) - 2 freq hooseie (4) - 1 freq hoosewark (4) - 5 freq hooseen- (4) - 1 freq arsehole (4) - 19 freq hous-heid (4) - 1 freq |
hoosehold (0) - 12 freq hoosehald (1) - 1 freq household (1) - 10 freq hoosehauld (2) - 2 freq househald (2) - 2 freq hooseholds (2) - 1 freq hoosehaud (3) - 62 freq hooshed (4) - 1 freq hoosed (5) - 6 freq foothold (5) - 2 freq hoose-end (5) - 2 freq hoosemaid (5) - 6 freq hoosehauds (5) - 5 freq hoose'll (5) - 2 freq hochled (6) - 1 freq threshold (6) - 14 freq hushed (6) - 10 freq rosehill (6) - 3 freq hoased (6) - 1 freq 'should (6) - 2 freq hooled (6) - 1 freq hooched (6) - 3 freq hidiehole (6) - 1 freq ersehole (6) - 12 freq hooshin (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 |
HOOSEHOLD |
| Time to execute Levenshtein function - 0.183131 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.345707 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.032563 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.037287 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.000872 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. |