| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| awnin (0) - 20 freq aanin (1) - 2 freq dawnin (1) - 7 freq awin (1) - 5 freq awkin (1) - 2 freq awhin (1) - 1 freq yawnin (1) - 12 freq mawnin (1) - 5 freq ownin (1) - 22 freq awnit (1) - 2 freq ainin (1) - 1 freq hawkin (2) - 3 freq aakin (2) - 3 freq hawin (2) - 2 freq achin (2) - 14 freq twynin (2) - 6 freq awfi (2) - 5 freq mannin (2) - 1 freq kenin (2) - 2 freq yawning (2) - 1 freq annie (2) - 107 freq awan (2) - 1 freq awhie (2) - 2 freq ackin (2) - 5 freq atwain (2) - 2 freq |
awnin (0) - 20 freq yawnin (1) - 12 freq ownin (1) - 22 freq ainin (2) - 1 freq yawnan (2) - 2 freq aanin (2) - 2 freq wanin (2) - 2 freq awin (2) - 5 freq awnit (2) - 2 freq awkin (2) - 2 freq awhin (2) - 1 freq dawnin (2) - 7 freq mawnin (2) - 5 freq jinin (3) - 8 freq innin (3) - 34 freq twinin (3) - 6 freq hynin (3) - 1 freq ajynin (3) - 1 freq hainin (3) - 20 freq mynin (3) - 14 freq haanin (3) - 1 freq wuin (3) - 3 freq wtin (3) - 1 freq tynin (3) - 20 freq annan (3) - 4 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 - 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.176386 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.359762 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.027543 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.036394 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.000791 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. |