| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aneyinwan (0) - 7 freq anywan (3) - 28 freq beginnan (4) - 11 freq steinway (4) - 4 freq ane-twa (4) - 4 freq american (4) - 92 freq annan (4) - 4 freq inchinnan (4) - 1 freq ayebidan (4) - 3 freq anemia (4) - 1 freq anglian (4) - 1 freq ninian (4) - 5 freq onywan (4) - 19 freq anointin (4) - 1 freq remindan (4) - 1 freq angina (4) - 3 freq snawinan (4) - 1 freq anglican (4) - 1 freq anyway (4) - 109 freq fryinpan (4) - 1 freq inginan (4) - 1 freq anderina (4) - 1 freq agenda (5) - 23 freq andean (5) - 1 freq epinal (5) - 1 freq |
aneyinwan (0) - 7 freq anywan (4) - 28 freq anointin (5) - 1 freq onywan (5) - 19 freq ninian (5) - 5 freq annan (5) - 4 freq nynorn (6) - 1 freq naewan (6) - 22 freq anderina (6) - 1 freq annoyan (6) - 1 freq neeenaaw (6) - 1 freq annexin (6) - 1 freq onendin (6) - 1 freq unenin (6) - 1 freq annoyin (6) - 25 freq anyway (6) - 109 freq knowan (6) - 2 freq inginan (6) - 1 freq anglian (6) - 1 freq niniane (6) - 3 freq annaw (6) - 2 freq unendin (6) - 2 freq newin (6) - 1 freq snawinan (6) - 1 freq angina (6) - 3 freq |
SoundEx code - A555 anemones - 2 freq anonymously - 4 freq anemone's - 1 freq anonymous - 25 freq amenments - 1 freq anonymity - 5 freq anonymises - 1 freq anonymise - 1 freq anonymised - 2 freq ane-wumman - 1 freq ae-ane-yin-wan - 1 freq aimeeannenaylor - 119 freq aneyinwan - 7 freq |
MetaPhone code - ANYNWN aneyinwan - 7 freq |
ANEYINWAN |
| Time to execute Levenshtein function - 0.216861 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.357553 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.027617 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.037458 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.000950 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. |