| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anyone (0) - 67 freq annone (1) - 1 freq onyone (1) - 23 freq 'anyone (1) - 1 freq anyont (1) - 1 freq oanyone (1) - 1 freq lanyon (2) - 1 freq anoonce (2) - 1 freq onyene (2) - 1 freq anyun (2) - 1 freq atone (2) - 2 freq abyne (2) - 2 freq anyone's (2) - 2 freq alone (2) - 72 freq ayont (2) - 277 freq apone (2) - 3 freq undone (2) - 4 freq anyoch (2) - 25 freq antoni (2) - 1 freq anon (2) - 6 freq 'none (2) - 1 freq yone (2) - 7 freq anymore (2) - 14 freq anne (2) - 77 freq none (2) - 57 freq |
anyone (0) - 67 freq oanyone (1) - 1 freq onyone (1) - 23 freq anne (2) - 77 freq anon (2) - 6 freq onyane (2) - 13 freq anyun (2) - 1 freq none (2) - 57 freq nyne (2) - 4 freq anyont (2) - 1 freq annone (2) - 1 freq onyene (2) - 1 freq 'anyone (2) - 1 freq nine (3) - 234 freq neon (3) - 7 freq anno (3) - 5 freq annoay (3) - 1 freq anen (3) - 49 freq onion (3) - 14 freq nane (3) - 547 freq inion (3) - 1 freq anna (3) - 18 freq non (3) - 39 freq union (3) - 192 freq onyin (3) - 1 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 |
ANYONE |
| Time to execute Levenshtein function - 0.256391 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.507640 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.027908 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.039654 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.000910 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. |