| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hammin (0) - 1 freq bammin (1) - 3 freq jammin (1) - 4 freq rammin (1) - 3 freq lammin (1) - 2 freq himmin (1) - 4 freq shammin (1) - 1 freq hummin (1) - 18 freq himm'in (2) - 1 freq hae'in (2) - 6 freq hairin (2) - 3 freq haÂ’in (2) - 2 freq haunin (2) - 7 freq haepin (2) - 1 freq harin (2) - 2 freq mammie (2) - 6 freq damnin (2) - 2 freq haudin (2) - 374 freq harlin (2) - 3 freq warmin (2) - 30 freq hamil (2) - 2 freq hae-in (2) - 1 freq halpin (2) - 5 freq whammlin (2) - 1 freq hausin (2) - 2 freq |
hammin (0) - 1 freq hummin (1) - 18 freq himmin (1) - 4 freq rammin (2) - 3 freq bammin (2) - 3 freq shammin (2) - 1 freq jammin (2) - 4 freq lammin (2) - 2 freq summin (3) - 36 freq hatman (3) - 1 freq hamm (3) - 1 freq humming (3) - 3 freq wamman (3) - 1 freq dimmin (3) - 3 freq gummin (3) - 1 freq bummin (3) - 20 freq hammerin (3) - 18 freq cummin (3) - 30 freq hummin' (3) - 1 freq humpin (3) - 1 freq mammon (3) - 6 freq gemmin (3) - 1 freq wimmin (3) - 31 freq commin (3) - 8 freq hemmi (3) - 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 |
HAMMIN |
| Time to execute Levenshtein function - 0.222535 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.448020 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.027881 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.048295 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.001106 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. |