| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| awnin (0) - 20 freq dawnin (1) - 7 freq ainin (1) - 1 freq aanin (1) - 2 freq mawnin (1) - 5 freq awnit (1) - 2 freq awin (1) - 5 freq awhin (1) - 1 freq ownin (1) - 22 freq awkin (1) - 2 freq yawnin (1) - 12 freq downin (2) - 4 freq twein (2) - 1 freq anen (2) - 49 freq wain (2) - 15 freq ownins (2) - 1 freq awie (2) - 1 freq gawin (2) - 25 freq awid (2) - 2 freq pannin (2) - 2 freq atonin (2) - 2 freq ain (2) - 2875 freq rawlin (2) - 1 freq haanin (2) - 1 freq awfil (2) - 4 freq |
awnin (0) - 20 freq yawnin (1) - 12 freq ownin (1) - 22 freq aanin (2) - 2 freq wanin (2) - 2 freq yawnan (2) - 2 freq dawnin (2) - 7 freq awkin (2) - 2 freq ainin (2) - 1 freq mawnin (2) - 5 freq awin (2) - 5 freq awnit (2) - 2 freq awhin (2) - 1 freq jynin (3) - 33 freq winn (3) - 1 freq whin (3) - 755 freq nonin (3) - 1 freq win (3) - 976 freq menin (3) - 2 freq awn (3) - 118 freq kaenin (3) - 2 freq minin (3) - 26 freq finin (3) - 3 freq awned (3) - 27 freq awan (3) - 1 freq |
SoundEx code - A550 anyone - 67 freq anyhin - 68 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 - 27 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 |
AWNIN |
| Time to execute Levenshtein function - 0.212532 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.370877 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.027901 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.036950 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.000820 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. |