| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| annan (0) - 4 freq bannan (1) - 1 freq annand (1) - 10 freq rannan (1) - 1 freq annaa (1) - 1 freq annaw (1) - 2 freq annan' (1) - 1 freq annas (1) - 2 freq gannan (1) - 1 freq annad (1) - 1 freq fannan (1) - 1 freq annay (1) - 4 freq anna (1) - 18 freq vannan (1) - 1 freq canaan (2) - 3 freq runan (2) - 1 freq awnin (2) - 20 freq anaa (2) - 20 freq ongan (2) - 2 freq alan (2) - 150 freq cannas (2) - 2 freq inna (2) - 19 freq yarnan (2) - 3 freq anae (2) - 1 freq cannen (2) - 3 freq |
annan (0) - 4 freq vannan (2) - 1 freq anna (2) - 18 freq annay (2) - 4 freq ennin (2) - 2 freq nanna (2) - 1 freq annoyan (2) - 1 freq onnen (2) - 2 freq fannan (2) - 1 freq innin (2) - 34 freq annone (2) - 1 freq annand (2) - 10 freq annaw (2) - 2 freq annaa (2) - 1 freq annad (2) - 1 freq annan' (2) - 1 freq rannan (2) - 1 freq gannan (2) - 1 freq annas (2) - 2 freq bannan (2) - 1 freq nanny (3) - 7 freq inlan (3) - 1 freq nean (3) - 1 freq nonin (3) - 1 freq pannin (3) - 2 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 |
ANNAN |
| Time to execute Levenshtein function - 0.313089 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.604400 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.066779 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.037337 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.000867 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. |