| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anoff (0) - 6 freq anof (1) - 4 freq anuff (1) - 28 freq enoff (1) - 1 freq ano (2) - 6 freq aff (2) - 4397 freq loff (2) - 2 freq coff (2) - 19 freq off (2) - 546 freq anoot (2) - 1 freq wan-off (2) - 1 freq niff (2) - 1 freq geoff (2) - 2 freq naff (2) - 2 freq sniff (2) - 28 freq anon (2) - 6 freq aloft (2) - 3 freq runoff (2) - 1 freq doff (2) - 3 freq inuff (2) - 1 freq hoff (2) - 1 freq toff (2) - 12 freq enuff (2) - 12 freq enof (2) - 5 freq adolf (2) - 2 freq |
anoff (0) - 6 freq enoff (1) - 1 freq anuff (1) - 28 freq niff (2) - 1 freq naff (2) - 2 freq inuff (2) - 1 freq enuff (2) - 12 freq anof (2) - 4 freq hoff (3) - 1 freq toff (3) - 12 freq snuff (3) - 9 freq 'nuff (3) - 1 freq annuff (3) - 1 freq banff (3) - 45 freq amoffa (3) - 1 freq runoff (3) - 1 freq enof (3) - 5 freq doff (3) - 3 freq coff (3) - 19 freq loff (3) - 2 freq aff (3) - 4397 freq nyaff (3) - 24 freq off (3) - 546 freq naffu (3) - 1 freq geoff (3) - 2 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 |
ANOFF |
| Time to execute Levenshtein function - 0.301265 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.531512 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.067263 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.084036 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.001293 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. |