Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
anyhin (0) - 69 freq anyhing (1) - 33 freq anyfin (1) - 8 freq anythin (1) - 145 freq onyhin (1) - 23 freq enyhin (1) - 1 freq aathin (2) - 203 freq anythn (2) - 1 freq anyhoo (2) - 9 freq an-in (2) - 1 freq anywan (2) - 28 freq hanchin (2) - 1 freq anywiy (2) - 8 freq onythin (2) - 498 freq ganshin (2) - 3 freq nohin (2) - 1 freq anglin (2) - 2 freq oanyhing (2) - 1 freq anyhin'd (2) - 1 freq anythin' (2) - 2 freq oanythin (2) - 2 freq ahin (2) - 1 freq ahin (2) - 262 freq nyhn (2) - 1 freq anything (2) - 138 freq |
anyhin (0) - 69 freq enyhin (1) - 1 freq onyhin (1) - 23 freq nohin (2) - 1 freq nyhn (2) - 1 freq onhin (2) - 2 freq nuhin (2) - 48 freq enihin (2) - 1 freq anythin (2) - 145 freq nihin (2) - 5 freq anyfin (2) - 8 freq anyhing (2) - 33 freq anyhow (3) - 5 freq aa'hin (3) - 1 freq inchin (3) - 2 freq achin (3) - 14 freq onyin (3) - 1 freq naehin (3) - 3 freq onyhing (3) - 11 freq awhin (3) - 1 freq arhin (3) - 1 freq enythin (3) - 1 freq onyyin (3) - 1 freq anyun (3) - 1 freq oniehin (3) - 3 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 - ANHN anyhin - 69 freq |
ANYHIN |
Time to execute Levenshtein function - 0.246883 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.391068 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.037077 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.037239 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.000883 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. |