| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hand-oots (0) - 1 freq hand-oot (1) - 1 freq hand-out (2) - 1 freq handoot (2) - 1 freq handfoo (3) - 1 freq handbook (3) - 1 freq hanfoos (3) - 1 freq hand-loom (3) - 2 freq han-tools (3) - 1 freq han-looms (3) - 1 freq laid-oot (3) - 1 freq handyhock (4) - 2 freq hard-oan (4) - 1 freq standoot (4) - 1 freq anoot (4) - 1 freq andros (4) - 1 freq hadrons (4) - 1 freq hauf-oor (4) - 8 freq daen-oot (4) - 1 freq sandiloos (4) - 1 freq hand-marks (4) - 1 freq laid-out (4) - 1 freq hind-ends (4) - 1 freq handis (4) - 1 freq handsomest (4) - 1 freq |
hand-oots (0) - 1 freq hand-oot (2) - 1 freq hand-out (3) - 1 freq handoot (4) - 1 freq han-tools (5) - 1 freq hand-loom (5) - 2 freq hunderts (5) - 1 freq handbags (6) - 2 freq handrails (6) - 1 freq hands (6) - 175 freq handis (6) - 1 freq hind-ends (6) - 1 freq hants (6) - 1 freq handers (6) - 1 freq handlers (6) - 1 freq handles (6) - 4 freq endoits (6) - 1 freq handit (6) - 27 freq bandits (6) - 5 freq hancairts (6) - 1 freq handfoo (6) - 1 freq laid-oot (6) - 1 freq han-looms (6) - 1 freq handbook (6) - 1 freq hen-taes (6) - 1 freq |
SoundEx code - H533 huntit - 29 freq hauntit - 15 freq hoondit - 1 freq hunted - 11 freq haunded - 19 freq handit - 27 freq handed - 49 freq haundit - 62 freq hantit - 3 freq hintit - 2 freq handoot - 1 freq hinted - 2 freq haunted - 11 freq hand-oots - 1 freq hand-oot - 1 freq haundet - 4 freq hauntet - 2 freq hintet - 1 freq hand-out - 1 freq hanted - 2 freq haandit - 8 freq haanded - 6 freq haand-hadd - 1 freq handed' - 2 freq hindit - 1 freq hematite - 1 freq haantit - 1 freq hounded - 1 freq handedness - 1 freq |
MetaPhone code - HNTTS hand-oots - 1 freq |
HAND-OOTS |
| Time to execute Levenshtein function - 0.267037 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.410672 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.028967 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.042553 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.000915 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. |