| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aname (0) - 1 freq 'name (1) - 2 freq name (1) - 1220 freq anae (1) - 1 freq panama (2) - 1 freq anee (2) - 1 freq gnome (2) - 2 freq anse (2) - 4 freq dame (2) - 16 freq agate (2) - 2 freq arnage (2) - 1 freq ana (2) - 143 freq mame (2) - 2 freq axae (2) - 1 freq crame (2) - 1 freq arase (2) - 1 freq ame (2) - 3 freq tame (2) - 23 freq adage (2) - 2 freq eame (2) - 1 freq enamel (2) - 5 freq 'nae (2) - 94 freq naime (2) - 7 freq anaw (2) - 198 freq nape (2) - 2 freq |
aname (0) - 1 freq name (1) - 1220 freq nayme (2) - 2 freq naime (2) - 7 freq nme (2) - 2 freq 'name (2) - 2 freq anae (2) - 1 freq inimie (3) - 2 freq poame (3) - 1 freq ande (3) - 4 freq jame (3) - 3 freq ante (3) - 1 freq anal (3) - 1 freq andie (3) - 1 freq rame (3) - 3 freq came (3) - 899 freq namer (3) - 1 freq bame (3) - 2 freq adam (3) - 189 freq nom (3) - 2 freq naem (3) - 48 freq anar (3) - 1 freq annie (3) - 108 freq nave (3) - 1 freq nae (3) - 9872 freq |
SoundEx code - A550 anyone - 67 freq anyhin - 69 freq awnin - 20 freq annoyin - 25 freq aimin - 10 freq amean - 1 freq ahinhaan - 1 freq ahin-haun - 1 freq amon - 23 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 - 28 freq amon' - 4 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 - ANM aname - 1 freq annum - 2 freq anemia - 1 freq anaemia - 1 freq |
ANAME |
| Time to execute Levenshtein function - 0.609213 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 - 1.293555 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.093440 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.105402 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.000873 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. |