| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoosemates (0) - 1 freq hoosemaids (2) - 1 freq hoosehauds (3) - 5 freq horseman's (3) - 10 freq hoosecoats (3) - 1 freq hoosewives (3) - 1 freq hoosemaid (3) - 6 freq hoose-names (3) - 1 freq hooseaiver (4) - 1 freq goosefat (4) - 1 freq oniegates (4) - 15 freq hoose-taps (4) - 1 freq hoose's (4) - 5 freq hostages (4) - 1 freq hooseie (4) - 1 freq hoosomever (4) - 1 freq horseman (4) - 12 freq hoosehald (4) - 1 freq operates (4) - 4 freq hoosehauders (4) - 1 freq moosewabs (4) - 2 freq hoolets (4) - 5 freq homemaker (4) - 1 freq hooseholds (4) - 1 freq horsemen (4) - 16 freq |
hoosemates (0) - 1 freq hoosemaids (3) - 1 freq hoosecoats (4) - 1 freq hoosewives (5) - 1 freq hoosemaid (5) - 6 freq hesitates (5) - 1 freq hoosehauds (5) - 5 freq hooses (6) - 251 freq hoolets (6) - 5 freq housemaid (6) - 1 freq hoasts (6) - 8 freq hoosecoat (6) - 2 freq hoosumever (6) - 16 freq houseman (6) - 2 freq hoosumiver (6) - 2 freq hoosomiver (6) - 1 freq hooseless (6) - 1 freq hostages (6) - 1 freq hoosies (6) - 9 freq yosemite (6) - 2 freq hoose-names (6) - 1 freq horseman's (6) - 10 freq hoose-taps (6) - 1 freq hoose's (6) - 5 freq hoosomever (6) - 1 freq |
SoundEx code - H253 hoose-end - 2 freq hoosemaid - 6 freq hous-maid - 1 freq husn't - 2 freq hoosemaids - 1 freq hexameter - 1 freq hasn't - 6 freq hackneyed - 2 freq housomdevir - 5 freq howsomdevir - 2 freq hook-haunds - 3 freq hook-haundit - 17 freq hookhaundit - 2 freq hey-sned - 1 freq 'hackneydness' - 1 freq housemaid - 1 freq heich-haunit - 1 freq hyacinth - 1 freq hyacinths - 3 freq haesn't - 1 freq hoose-huntin - 2 freq housomdever - 1 freq hoosemates - 1 freq hazmat - 1 freq hassendean - 1 freq hasnt - 1 freq higgindazs - 1 freq |
MetaPhone code - HSMTS hoosemaids - 1 freq hoosemates - 1 freq |
HOOSEMATES |
| Time to execute Levenshtein function - 0.243018 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.387444 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.031077 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.040178 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.000823 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. |