Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
annoyin (0) - 25 freq annoying (1) - 8 freq annoyan (1) - 1 freq annexin (2) - 1 freq sannyin (2) - 1 freq injoyin (2) - 2 freq annoy (2) - 12 freq annoyt (2) - 5 freq enjoyin (2) - 68 freq annoys (2) - 4 freq annoyince (2) - 2 freq njoyin (2) - 1 freq annoyinly (2) - 1 freq annoyed (2) - 45 freq bannin (3) - 5 freq pannelin (3) - 1 freq allowin (3) - 6 freq anno (3) - 5 freq vannin (3) - 1 freq snoozin (3) - 9 freq dannerin (3) - 4 freq onieyin (3) - 4 freq ignorin (3) - 35 freq yinyin (3) - 1 freq enjosin (3) - 1 freq |
annoyin (0) - 25 freq annoyan (1) - 1 freq annoying (2) - 8 freq annoyed (3) - 45 freq annoyinly (3) - 1 freq annone (3) - 1 freq innin (3) - 34 freq njoyin (3) - 1 freq nonin (3) - 1 freq ennin (3) - 2 freq annan (3) - 4 freq annoyince (3) - 2 freq annoy (3) - 12 freq sannyin (3) - 1 freq injoyin (3) - 2 freq annoyt (3) - 5 freq enjoyin (3) - 68 freq annexin (3) - 1 freq annoys (3) - 4 freq nohin (4) - 1 freq annays (4) - 1 freq onyin (4) - 1 freq pannin (4) - 2 freq antonia (4) - 8 freq annie (4) - 107 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 - ANYN anyone - 64 freq annoyin - 25 freq 'anyone - 1 freq annoyan - 1 freq anyun - 1 freq |
ANNOYIN |
Time to execute Levenshtein function - 0.412438 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.785828 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.059854 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.080590 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.000979 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. |