Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
anen (0) - 49 freq agen (1) - 12 freq aken (1) - 1 freq aten (1) - 2 freq anes (1) - 218 freq afen (1) - 4 freq aren (1) - 3 freq aden (1) - 2 freq anee (1) - 1 freq anent (1) - 516 freq a'en (1) - 1 freq anon (1) - 6 freq apen (1) - 70 freq alen (1) - 1 freq aner (1) - 2 freq anew (1) - 14 freq ann (1) - 105 freq aen (1) - 10 freq nen (1) - 6 freq amen (1) - 24 freq anet (1) - 1 freq ane (1) - 2115 freq laen (2) - 3 freq ahn (2) - 1 freq eaten (2) - 31 freq |
anen (0) - 49 freq nen (1) - 6 freq anon (1) - 6 freq ann (1) - 105 freq nean (2) - 1 freq ainin (2) - 1 freq enn (2) - 36 freq anny (2) - 1 freq enin (2) - 4 freq neon (2) - 7 freq unn (2) - 5 freq anna (2) - 18 freq yanin (2) - 1 freq nne (2) - 1 freq inn (2) - 29 freq unean (2) - 1 freq nane (2) - 544 freq nein (2) - 4 freq nien (2) - 5 freq nan (2) - 14 freq non (2) - 36 freq nin (2) - 1 freq anyun (2) - 1 freq neen (2) - 130 freq nun (2) - 9 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 - 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 |
ANEN |
Time to execute Levenshtein function - 0.205019 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.353739 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.029721 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.039522 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.001084 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. |