Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
anyun (0) - 1 freq aiyun (1) - 1 freq atoun (2) - 1 freq baiyun (2) - 1 freq lanyon (2) - 1 freq yun (2) - 140 freq anyd (2) - 2 freq naun (2) - 1 freq ayui (2) - 1 freq nun (2) - 10 freq angus (2) - 120 freq canyon (2) - 1 freq agyen (2) - 2 freq anen (2) - 49 freq ancus (2) - 2 freq wanun (2) - 1 freq onyin (2) - 1 freq annan (2) - 4 freq abeun (2) - 5 freq anywan (2) - 28 freq ayur (2) - 1 freq amun (2) - 5 freq anya (2) - 1 freq ann (2) - 105 freq noun (2) - 48 freq |
anyun (0) - 1 freq ann (2) - 105 freq noun (2) - 48 freq anen (2) - 49 freq onyin (2) - 1 freq anyone (2) - 67 freq nun (2) - 10 freq anon (2) - 6 freq naun (2) - 1 freq aiyun (2) - 1 freq ennui (3) - 1 freq naen (3) - 10 freq naeyin (3) - 2 freq onion (3) - 14 freq neen (3) - 131 freq nen (3) - 6 freq nuin (3) - 14 freq nain (3) - 5 freq union (3) - 192 freq yinyin (3) - 1 freq anny (3) - 1 freq anno (3) - 5 freq nin (3) - 1 freq unean (3) - 1 freq onyeen (3) - 14 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 - ANYN anyone - 67 freq annoyin - 25 freq 'anyone - 1 freq annoyan - 1 freq anyun - 1 freq |
ANYUN |
Time to execute Levenshtein function - 0.188589 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.337015 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.028019 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.036980 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.000876 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. |