| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hieweyman (0) - 1 freq highwayman (3) - 1 freq hiewey (3) - 1 freq hielanman (3) - 3 freq liegeman (3) - 1 freq riseman (4) - 1 freq vieween (4) - 1 freq piece-an (4) - 1 freq hill-man (4) - 1 freq railwayman (4) - 2 freq hielandman (4) - 1 freq henchman (4) - 1 freq he-man (4) - 1 freq sweeman (4) - 3 freq fleeman (4) - 9 freq hielanmen (4) - 2 freq sereaman (4) - 1 freq weman (4) - 1 freq horseman (4) - 12 freq freeman (4) - 3 freq heedan (4) - 1 freq weiman (4) - 1 freq pieman (4) - 4 freq gweedman (4) - 3 freq sieman (4) - 1 freq |
hieweyman (0) - 1 freq herman (5) - 1 freq he-man (5) - 1 freq weman (5) - 1 freq heidman (5) - 1 freq houseman (5) - 2 freq newman (5) - 20 freq weiman (5) - 1 freq honeymin (5) - 1 freq sweeman (5) - 3 freq hielanman (5) - 3 freq wyman (5) - 1 freq hiewey (5) - 1 freq highwayman (5) - 1 freq liegeman (5) - 1 freq henman (5) - 1 freq weeman (5) - 9 freq hewn (6) - 2 freq weimen (6) - 12 freq hodman (6) - 1 freq wuman (6) - 40 freq wiemen (6) - 1 freq wiseman (6) - 1 freq haman (6) - 1 freq hymn (6) - 17 freq |
SoundEx code - H550 human - 315 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.216497 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.424128 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.029889 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.044608 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.004001 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. |