| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hieweyman (0) - 1 freq liegeman (3) - 1 freq hielanman (3) - 3 freq highwayman (3) - 1 freq hiewey (3) - 1 freq fleeman (4) - 9 freq hielanmen (4) - 2 freq sweeman (4) - 3 freq vieween (4) - 1 freq weiman (4) - 1 freq honeymin (4) - 1 freq weman (4) - 1 freq linesman (4) - 5 freq piece-an (4) - 1 freq tinkerman (4) - 1 freq heedan (4) - 1 freq breedman (4) - 1 freq three-man (4) - 1 freq herman (4) - 1 freq riseman (4) - 1 freq lineman (4) - 2 freq ferryman (4) - 3 freq henman (4) - 1 freq weeman (4) - 9 freq heidman (4) - 1 freq |
hieweyman (0) - 1 freq henman (5) - 1 freq herman (5) - 1 freq heidman (5) - 1 freq weman (5) - 1 freq newman (5) - 20 freq he-man (5) - 1 freq wyman (5) - 1 freq honeymin (5) - 1 freq houseman (5) - 2 freq weeman (5) - 9 freq highwayman (5) - 1 freq hiewey (5) - 1 freq sweeman (5) - 3 freq hielanman (5) - 3 freq liegeman (5) - 1 freq weiman (5) - 1 freq hewn (6) - 2 freq hanuman (6) - 1 freq weimin (6) - 1 freq himmin (6) - 4 freq hymen (6) - 3 freq weemin (6) - 178 freq weimen (6) - 12 freq honeymeen (6) - 2 freq |
SoundEx code - H550 human - 317 freq hammin - 1 freq hummin - 18 freq haman - 1 freq haanin - 1 freq humane - 4 freq hainin - 20 freq henman - 1 freq hannin - 3 freq hömin - 2 freq hnnin - 1 freq haunin - 7 freq hinnyin - 1 freq hynin - 1 freq hümin - 1 freq hieweyman - 1 freq haunnin - 1 freq he-man - 1 freq honin - 2 freq hymen - 3 freq €˜hymen - 1 freq himminÂ’ - 1 freq himmin' - 5 freq himmin - 4 freq himm'in - 1 freq hummin' - 1 freq |
MetaPhone code - HWMN hieweyman - 1 freq |
HIEWEYMAN |
| Time to execute Levenshtein function - 0.236436 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.430785 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.027772 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.037536 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.000945 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. |