| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| himminÂ’ (0) - 1 freq himmin' (2) - 5 freq hinginÂ’ (2) - 1 freq himmin (2) - 4 freq dumpinÂ’ (3) - 1 freq humming (3) - 3 freq lininÂ’ (3) - 1 freq wimmins (3) - 4 freq kiddinÂ’ (3) - 1 freq dramminÂ’ (3) - 1 freq dimmin (3) - 3 freq pumpinÂ’ (3) - 1 freq singinÂ’ (3) - 1 freq firinÂ’ (3) - 1 freq fishinÂ’ (3) - 1 freq kickinÂ’ (3) - 1 freq livinÂ’ (3) - 2 freq simmins (3) - 1 freq hammin (3) - 1 freq hummin' (3) - 1 freq nickinÂ’ (3) - 1 freq himm'in (3) - 1 freq pishinÂ’ (3) - 1 freq wimmin's (3) - 1 freq wimmin (3) - 31 freq |
himminÂ’ (0) - 1 freq himmin (4) - 4 freq hinginÂ’ (4) - 1 freq himmin' (4) - 5 freq hammin (5) - 1 freq hummin' (5) - 1 freq honkinÂ’ (5) - 1 freq helpinÂ’ (5) - 1 freq hummin (5) - 18 freq pumpinÂ’ (5) - 1 freq humming (5) - 3 freq dumpinÂ’ (5) - 1 freq dramminÂ’ (5) - 1 freq hanÂ’ (6) - 2 freq humourÂ’ (6) - 1 freq pittinÂ’ (6) - 1 freq makinÂ’ (6) - 1 freq kimmins (6) - 1 freq wimmin (6) - 31 freq amazinÂ’ (6) - 1 freq sweeminÂ’ (6) - 1 freq hameÂ’ (6) - 1 freq movinÂ’ (6) - 1 freq windinÂ’ (6) - 1 freq firinÂ’ (6) - 1 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 - HMN human - 317 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 |
HIMMINÂ’ |
| Time to execute Levenshtein function - 0.221576 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.400873 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.032239 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.043156 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.001123 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. |