| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aye-an-oan (0) - 2 freq on-an-on (4) - 1 freq aye-bidan (4) - 3 freq yet-an (5) - 2 freq can-can (5) - 3 freq bean-bag (5) - 1 freq demandan (5) - 1 freq taen-on (5) - 3 freq leanan (5) - 4 freq aeaeron (5) - 5 freq aneyinwan (5) - 7 freq ayelestan (5) - 4 freq mean-ah (5) - 1 freq ye-aa (5) - 1 freq ah-ah-ah (5) - 1 freq wan-man (5) - 1 freq ayebidan (5) - 3 freq aye-gaun (5) - 1 freq oot-an-oot (5) - 3 freq speakan-an (5) - 1 freq amscanlon (5) - 1 freq yernan (5) - 1 freq amyjcanavan (5) - 1 freq fryan-pan (5) - 1 freq re-union (5) - 1 freq |
aye-an-oan (0) - 2 freq on-an-on (5) - 1 freq een-an (6) - 1 freq ken-an (6) - 3 freq taen-on (6) - 3 freq aye-bidan (6) - 3 freq aye-bidin (7) - 2 freq ane-tae-ane (7) - 4 freq tae--an (7) - 1 freq meanan (7) - 12 freq aye-bydin (7) - 5 freq year-en (7) - 1 freq eyes-an (7) - 3 freq sign-oan (7) - 1 freq a-a-ah (7) - 1 freq eeran-loun (7) - 2 freq aa-an (7) - 1 freq --an (7) - 3 freq eenou-an (7) - 2 freq an-in (7) - 1 freq tin-an (7) - 1 freq ken-nae (7) - 3 freq sein-na (7) - 1 freq rein-in (7) - 1 freq taen-in (7) - 1 freq |
SoundEx code - A550 anyone - 64 freq anyhin - 72 freq awnin - 20 freq annoyin - 25 freq aimin - 10 freq amean - 1 freq ahinhaan - 1 freq ahin-haun - 1 freq amon - 22 freq aman - 2 freq annan - 4 freq aname - 1 freq anon - 6 freq amen - 24 freq amano - 1 freq an-in - 1 freq amana - 1 freq anywan - 22 freq anen - 49 freq 'anyone - 1 freq amen' - 1 freq ainin - 1 freq a'winnin - 1 freq aman' - 1 freq annoyan - 1 freq aemin - 1 freq a'myn - 4 freq aanin - 2 freq aye-an-oan - 2 freq 'amen - 2 freq ammonia - 8 freq annum - 2 freq ahinhaun - 2 freq amin - 1 freq amun - 5 freq anemia - 1 freq anaemia - 1 freq anyun - 1 freq amene - 1 freq annone - 1 freq annan' - 1 freq |
MetaPhone code - AYNN aye-an-oan - 2 freq |
AYE-AN-OAN |
| Time to execute Levenshtein function - 0.463662 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.642934 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.077751 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.085021 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. |