| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoosemaid (0) - 7 freq housemaid (1) - 1 freq hoosemaids (1) - 1 freq hous-maid (2) - 1 freq hoosehald (2) - 1 freq hoosehaud (2) - 62 freq horsehair (3) - 3 freq hoosehold (3) - 12 freq houseman (3) - 2 freq hoosebay (3) - 3 freq hoosehauld (3) - 2 freq hoosed (3) - 6 freq hoose-end (3) - 2 freq hoosemates (3) - 1 freq hoosewark (3) - 5 freq horseman (3) - 12 freq hoosehauds (3) - 5 freq househald (3) - 2 freq hooseie (3) - 1 freq hous-heid (4) - 1 freq rose-rid (4) - 1 freq loosenin (4) - 2 freq hosea (4) - 1 freq hoosecoat (4) - 2 freq hoosework (4) - 6 freq |
hoosemaid (0) - 7 freq housemaid (1) - 1 freq hoosemaids (2) - 1 freq hoosehaud (3) - 62 freq hous-maid (3) - 1 freq hoosehald (4) - 1 freq hoosed (4) - 6 freq houseman (4) - 2 freq hosed (5) - 1 freq hooseie (5) - 1 freq hooshed (5) - 1 freq hoased (5) - 1 freq homemade (5) - 3 freq househald (5) - 2 freq housed (5) - 1 freq haunmaid (5) - 1 freq hoosehauds (5) - 5 freq hoose-end (5) - 2 freq hoosebay (5) - 3 freq hoosehauld (5) - 2 freq hoosemates (5) - 1 freq hoosehold (5) - 12 freq horseman (5) - 12 freq hiosea (6) - 1 freq soomed (6) - 7 freq |
SoundEx code - H253 hoose-end - 2 freq hoosemaid - 7 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 - HSMT hoosemaid - 7 freq hous-maid - 1 freq housemaid - 1 freq hazmat - 1 freq |
HOOSEMAID |
| Time to execute Levenshtein function - 0.288066 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.398938 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.027574 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.043785 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.001280 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. |