| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aanin (0) - 2 freq kanin (1) - 1 freq aakin (1) - 3 freq ranin (1) - 1 freq awnin (1) - 20 freq aahin (1) - 3 freq yanin (1) - 1 freq aatin (1) - 1 freq ainin (1) - 1 freq gaanin (1) - 3 freq wanin (1) - 2 freq haanin (1) - 1 freq gawin (2) - 26 freq mani (2) - 1 freq pawin (2) - 3 freq pavin (2) - 4 freq hangin (2) - 29 freq rasin (2) - 1 freq lain (2) - 18 freq yazin (2) - 3 freq gauin (2) - 46 freq lawin (2) - 2 freq yasin (2) - 15 freq ajynin (2) - 1 freq wantin (2) - 326 freq |
aanin (0) - 2 freq yanin (1) - 1 freq ainin (1) - 1 freq nin (2) - 1 freq enin (2) - 4 freq nain (2) - 5 freq eenin (2) - 5 freq nani (2) - 1 freq anon (2) - 6 freq anen (2) - 49 freq annie (2) - 108 freq ann (2) - 105 freq naein (2) - 1 freq gaanin (2) - 3 freq awnin (2) - 20 freq aahin (2) - 3 freq wanin (2) - 2 freq ranin (2) - 1 freq kanin (2) - 1 freq haanin (2) - 1 freq aakin (2) - 3 freq aatin (2) - 1 freq aaned (3) - 1 freq ownin (3) - 22 freq ahin (3) - 262 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 - ANN awnin - 20 freq annan - 4 freq anon - 6 freq an-in - 1 freq anen - 49 freq ainin - 1 freq aanin - 2 freq annone - 1 freq annan' - 1 freq |
AANIN |
| Time to execute Levenshtein function - 0.197846 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.379416 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.029847 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.041003 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.000917 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. |