| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| annuff (0) - 1 freq anuff (1) - 28 freq inuff (2) - 1 freq enuff (2) - 12 freq annual (2) - 24 freq anoff (2) - 6 freq snuff (2) - 9 freq annum (2) - 2 freq 'nuff (2) - 1 freq pluff (3) - 4 freq nufc (3) - 6 freq sneeff (3) - 1 freq anna (3) - 18 freq anneal (3) - 2 freq annan (3) - 4 freq anno (3) - 5 freq douff (3) - 2 freq ansuer (3) - 1 freq annecb (3) - 2 freq an-ugh (3) - 1 freq dandruff (3) - 12 freq ruff (3) - 12 freq anof (3) - 4 freq anne (3) - 74 freq macduff (3) - 18 freq |
annuff (0) - 1 freq anuff (2) - 28 freq 'nuff (3) - 1 freq snuff (3) - 9 freq anoff (3) - 6 freq enuff (3) - 12 freq inuff (3) - 1 freq runoff (4) - 1 freq enoff (4) - 1 freq nyaff (4) - 24 freq banff (4) - 45 freq kinneff (4) - 1 freq funff (4) - 1 freq niff (4) - 1 freq sniff (4) - 28 freq snuffy (4) - 14 freq annum (4) - 2 freq annual (4) - 24 freq ane-aff (4) - 4 freq sneeff (4) - 1 freq naff (4) - 2 freq enuf (5) - 13 freq annay (5) - 4 freq annaw (5) - 2 freq gruff (5) - 16 freq |
SoundEx code - A510 anuff - 28 freq annuff - 1 freq amoeba - 1 freq anof - 4 freq amp - 10 freq ane-aff - 4 freq anoff - 6 freq amoffa - 1 freq |
MetaPhone code - ANF aneugh - 15 freq anuff - 28 freq annuff - 1 freq anof - 4 freq anagh - 1 freq an-ugh - 1 freq ane-aff - 4 freq anoff - 6 freq €œaneugh - 1 freq |
ANNUFF |
| Time to execute Levenshtein function - 0.199383 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.354465 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.027629 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.036765 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.000956 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. |