| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twa-an-a-hauf (4) - 2 freq a-a-ah (4) - 1 freq ane-aff (4) - 4 freq aawhaur (4) - 5 freq ahin-haun (4) - 1 freq near-haun (4) - 5 freq anywhaur (4) - 2 freq an-aa (4) - 7 freq nearhaun (4) - 69 freq oor-an-a-hauf (4) - 2 freq oniewhaur (5) - 16 freq near-at-haun (5) - 2 freq an-oh (5) - 2 freq on-gaun (5) - 1 freq tae-haud (5) - 1 freq fore-a-haun (5) - 1 freq an-aw (5) - 17 freq aa-but (5) - 1 freq affhaun (5) - 1 freq han-in-han (5) - 1 freq 'hauf (5) - 5 freq ahint-haun (5) - 1 freq aathou (5) - 1 freq any-whar (5) - 1 freq aa-heal (5) - 1 freq |
oor-an-a-hauf (6) - 2 freq near-haun (6) - 5 freq ane-aff (6) - 4 freq a-a-ah (6) - 1 freq anti-ref (7) - 1 freq one-aff (7) - 1 freq an-ugh (7) - 1 freq twa-an-a-hauf (7) - 2 freq any-whar (7) - 1 freq onie-whaur (7) - 1 freq onie-hou (7) - 7 freq anti-hero (7) - 1 freq an-ohhh (7) - 1 freq an-och (7) - 1 freq ahin-haun (7) - 1 freq nearhaun (7) - 69 freq an-aa (7) - 7 freq an-oh (7) - 2 freq nae-whaur (7) - 1 freq anywhaur (7) - 2 freq anthum (8) - 1 freq afore-haun (8) - 1 freq an---och (8) - 1 freq in-house (8) - 1 freq aboot-haun (8) - 1 freq |
SoundEx code - A510 anuff - 28 freq annuff - 1 freq amoeba - 1 freq anof - 4 freq amp - 10 freq ane-aff - 4 freq anoff - 6 freq amoffa - 1 freq |
MetaPhone code - ANHF |
AN-A-HAUF |
| Time to execute Levenshtein function - 0.286549 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.418119 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.067507 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.075472 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.000926 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. |