| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anon (0) - 6 freq avon (1) - 3 freq aon (1) - 4 freq anoo (1) - 7 freq non (1) - 39 freq anof (1) - 4 freq apon (1) - 90 freq ann (1) - 105 freq alon (1) - 2 freq anen (1) - 49 freq canon (1) - 11 freq ano (1) - 6 freq abon (1) - 1 freq amon (1) - 23 freq atin (2) - 3 freq ikon (2) - 1 freq non- (2) - 1 freq fon (2) - 3 freq ante (2) - 1 freq azor (2) - 4 freq alson (2) - 1 freq uon (2) - 1 freq opon (2) - 1 freq canon' (2) - 2 freq canons (2) - 1 freq |
anon (0) - 6 freq anen (1) - 49 freq ann (1) - 105 freq non (1) - 39 freq anyone (2) - 67 freq none (2) - 57 freq aanin (2) - 2 freq noon (2) - 29 freq union (2) - 192 freq inn (2) - 29 freq nen (2) - 6 freq onion (2) - 14 freq neon (2) - 7 freq annoy (2) - 12 freq anyun (2) - 1 freq ainin (2) - 1 freq anna (2) - 18 freq anny (2) - 1 freq nun (2) - 10 freq yanin (2) - 1 freq nono (2) - 1 freq noun (2) - 48 freq nan (2) - 14 freq unn (2) - 5 freq anno (2) - 5 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 |
ANON |
| Time to execute Levenshtein function - 0.204148 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.504298 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.027972 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.071432 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.000878 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. |