| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anywan (0) - 28 freq onywan (1) - 19 freq anyway (1) - 109 freq awan (2) - 1 freq anywaiy (2) - 17 freq anyday (2) - 3 freq knowan (2) - 2 freq anyfin (2) - 8 freq 'anyway (2) - 1 freq anyt'n (2) - 1 freq anyhin (2) - 69 freq anya (2) - 1 freq anyways (2) - 12 freq tywan (2) - 1 freq anywye (2) - 1 freq oanyway (2) - 2 freq onyway (2) - 22 freq andean (2) - 1 freq anywhar (2) - 2 freq onyman (2) - 1 freq anythn (2) - 1 freq anywiy (2) - 8 freq annan (2) - 4 freq anyun (2) - 1 freq anywey (2) - 36 freq |
anywan (0) - 28 freq onywan (1) - 19 freq anyway (2) - 109 freq onyway (3) - 22 freq andean (3) - 1 freq anywye (3) - 1 freq onyman (3) - 1 freq oanyway (3) - 2 freq anyun (3) - 1 freq naewan (3) - 22 freq anywey (3) - 36 freq tywan (3) - 1 freq anywiy (3) - 8 freq annan (3) - 4 freq anyways (3) - 12 freq awan (3) - 1 freq anywaiy (3) - 17 freq anyfin (3) - 8 freq knowan (3) - 2 freq anyhin (3) - 69 freq newin (3) - 1 freq anyone (4) - 67 freq nean (4) - 1 freq annay (4) - 4 freq uncan (4) - 57 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 - ANWN anywan - 28 freq |
ANYWAN |
| Time to execute Levenshtein function - 0.176969 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.331520 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.029443 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.038045 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.000954 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. |