| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| han-looms (0) - 1 freq han-tools (2) - 1 freq hand-loom (2) - 2 freq hand-oots (3) - 1 freq bar-rooms (3) - 1 freq han-less (3) - 1 freq hanfoos (3) - 1 freq bathrooms (4) - 1 freq handbook (4) - 1 freq hanlon (4) - 2 freq an-soor (4) - 1 freq blooms (4) - 9 freq hantles (4) - 1 freq alloos (4) - 38 freq haund-luims (4) - 1 freq wanlos (4) - 1 freq baloos (4) - 1 freq phantoms (4) - 4 freq handfoo (4) - 1 freq hin-laigs (4) - 1 freq hit-forms (4) - 1 freq earldoms (4) - 1 freq handoot (4) - 1 freq hallows (4) - 2 freq hin-legs (4) - 2 freq |
han-looms (0) - 1 freq han-tools (4) - 1 freq han-less (4) - 1 freq hand-loom (4) - 2 freq hin-laigs (5) - 1 freq haund-luims (5) - 1 freq hin-legs (5) - 2 freq handlume (6) - 1 freq handless (6) - 3 freq han'les (6) - 1 freq hannles (6) - 5 freq handlers (6) - 1 freq handles (6) - 4 freq hanlins (6) - 1 freq hen-hoose (6) - 13 freq hannlins (6) - 39 freq hen-hooses (6) - 6 freq hanles (6) - 1 freq hantles (6) - 1 freq bar-rooms (6) - 1 freq hanfoos (6) - 1 freq hand-oots (6) - 1 freq handsome (7) - 41 freq hymn-books (7) - 1 freq pan-loaf (7) - 4 freq |
SoundEx code - H545 hamelaund - 1 freq hyne-launds - 1 freq hameland - 7 freq haunlin - 5 freq hanlins - 1 freq hummelness - 1 freq hamelan' - 1 freq haunling - 6 freq han-looms - 1 freq hannlin - 26 freq hannlins - 39 freq hamelins - 1 freq hamelan - 1 freq himalayan - 1 freq haunnlin - 1 freq homeland - 1 freq himlane - 1 freq hameliness - 1 freq hamelaun - 1 freq hanlon - 2 freq |
MetaPhone code - HNLMS han-looms - 1 freq |
HAN-LOOMS |
| Time to execute Levenshtein function - 0.211962 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.517509 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.031095 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.046875 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.001167 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. |