| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| maidenhoods (0) - 1 freq maidenheid (3) - 1 freq maidenhead (3) - 1 freq maidens (4) - 8 freq maiden's (4) - 1 freq bairnhood (4) - 11 freq manhood (4) - 4 freq wadderheads (5) - 1 freq haudendoon (5) - 1 freq methods (5) - 8 freq mainlands (5) - 2 freq haenhooses (5) - 1 freq calderwood (5) - 2 freq warehoos (5) - 1 freq mailoots (5) - 1 freq macdonalds (5) - 3 freq side-rodds (5) - 1 freq wammanhood (5) - 1 freq maidenkirk (5) - 3 freq tigerwoods (5) - 1 freq maidens' (5) - 1 freq midhoose (5) - 1 freq maiden (5) - 18 freq maiden' (5) - 1 freq weanhoods (5) - 1 freq |
maidenhoods (0) - 1 freq maidenhead (4) - 1 freq maidenheid (4) - 1 freq manhood (6) - 4 freq maiden's (6) - 1 freq maidens (6) - 8 freq weanhoods (7) - 1 freq macdonalds (7) - 3 freq midhoose (7) - 1 freq methods (7) - 8 freq bairnhood (7) - 11 freq bairnheids (7) - 1 freq manheid (8) - 2 freq reidheids (8) - 1 freq amends (8) - 3 freq inhauds (8) - 3 freq midlands (8) - 3 freq mends (8) - 3 freq minds (8) - 153 freq doonhauds (8) - 6 freq madrids (8) - 1 freq madness (8) - 30 freq meenads (8) - 11 freq madhouse (8) - 1 freq mcdonalds (8) - 6 freq |
SoundEx code - M353 mathematies - 2 freq maddened - 1 freq mutant - 3 freq mathematics - 7 freq mid-twentieth - 2 freq maidenheid - 1 freq mid-winter - 4 freq moutent - 3 freq mathematical - 4 freq midwinter - 3 freq mutton-dummy - 1 freq motioned - 1 freq mathematick - 1 freq maidenhoods - 1 freq moat-and-castle-biggin - 1 freq mid-twinties - 1 freq mittened - 1 freq mathematician - 1 freq mittent - 1 freq muttontief - 11 freq maitand - 1 freq maidenhead - 1 freq maidenwatford - 2 freq meattwenty - 1 freq mtmdavbzku - 1 freq mattmaytum - 3 freq |
MetaPhone code - MTNHTS maidenhoods - 1 freq |
MAIDENHOODS |
| Time to execute Levenshtein function - 0.254185 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.400584 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.028467 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.038983 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.000898 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. |