| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| he-man (0) - 1 freq henman (1) - 1 freq herman (1) - 1 freq helpan (2) - 1 freq weman (2) - 1 freq hearan (2) - 14 freq headan (2) - 3 freq heilan (2) - 17 freq harman (2) - 1 freq sherman (2) - 1 freq me-an (2) - 1 freq heivan (2) - 1 freq kelman (2) - 6 freq ehman (2) - 1 freq teuman (2) - 1 freq haman (2) - 1 freq heisan (2) - 1 freq penman (2) - 1 freq be-an (2) - 17 freq no-man (2) - 2 freq re-mak (2) - 1 freq hevan (2) - 10 freq hermin (2) - 2 freq seaman (2) - 4 freq heidman (2) - 1 freq |
he-man (0) - 1 freq herman (2) - 1 freq henman (2) - 1 freq hodman (3) - 1 freq heidman (3) - 1 freq hermon (3) - 1 freq ehman (3) - 1 freq haman (3) - 1 freq harman (3) - 1 freq no-man (3) - 2 freq hermin (3) - 2 freq hatman (3) - 1 freq human (3) - 315 freq himmin (4) - 4 freq german (4) - 156 freq deman (4) - 1 freq newman (4) - 20 freq weeman (4) - 9 freq yin-man (4) - 2 freq herdan (4) - 1 freq oul-man (4) - 1 freq aul-man (4) - 4 freq hymen (4) - 3 freq heidmen (4) - 1 freq hammin (4) - 1 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 - HMN human - 315 freq hammin - 1 freq hummin - 18 freq haman - 1 freq humane - 4 freq hambane - 1 freq hambone - 1 freq he-man - 1 freq himminÂ’ - 1 freq himmin' - 5 freq himmin - 4 freq himm'in - 1 freq hummin' - 1 freq |
HE-MAN |
| Time to execute Levenshtein function - 0.186194 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.357148 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.030339 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.039614 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.000883 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. |