| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| han-in-han (0) - 1 freq hannin-oan (2) - 1 freq haun-in-haun (2) - 1 freq han-ower-han (4) - 1 freq hairn-pan (4) - 1 freq chainchan (4) - 1 freq hang-man (4) - 1 freq harn-pan (4) - 4 freq hingin-on (4) - 1 freq haund-in-haund (4) - 1 freq ahin-haun (4) - 1 freq taakin-an (4) - 1 freq haudin-on (4) - 1 freq son-in-law (4) - 4 freq dad-in-law (4) - 1 freq haudin-in (4) - 1 freq vanishan (4) - 1 freq hatchan (5) - 1 freq cun-nan (5) - 1 freq anti-tax (5) - 1 freq hapnan (5) - 2 freq waddin-day (5) - 1 freq hingan (5) - 18 freq yin-on-yin (5) - 1 freq hannibal (5) - 1 freq |
han-in-han (0) - 1 freq haun-in-haun (2) - 1 freq hannin-oan (4) - 1 freq haund-in-haund (6) - 1 freq hingin-on (6) - 1 freq ahin-haun (6) - 1 freq han-ower-han (6) - 1 freq hang-man (7) - 1 freq haudin-in (7) - 1 freq on-an-on (7) - 1 freq yin-on-yin (7) - 1 freq haudin-on (7) - 1 freq son-in-law (7) - 4 freq harn-pan (7) - 4 freq hairn-pan (7) - 1 freq ahint-haun (7) - 1 freq three-in-wan (8) - 1 freq hanchin (8) - 1 freq ahinhaan (8) - 1 freq ae-ane-yin-wan (8) - 1 freq han-dan- (8) - 1 freq hannah (8) - 10 freq sin-in-laaw (8) - 5 freq ahinhaun (8) - 2 freq aye-an-oan (8) - 2 freq |
SoundEx code - H555 haun-in-haun - 1 freq honeymin - 1 freq honeymoon - 7 freq honeymuin - 1 freq hinny-muin - 2 freq han-in-han - 1 freq honeymeen - 2 freq hannin-oan - 1 freq honeymeenin - 1 freq hey-ma-nanny - 1 freq hanuman - 1 freq hinnymoon - 1 freq homonyms - 1 freq hinniemuin - 1 freq |
MetaPhone code - HNNHN haun-in-haun - 1 freq han-in-han - 1 freq |
HAN-IN-HAN |
| Time to execute Levenshtein function - 0.222383 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.434615 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.034670 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.039458 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.000949 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. |