| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enoff (0) - 1 freq enof (1) - 5 freq anoff (1) - 6 freq enuff (1) - 12 freq enuf (2) - 13 freq anof (2) - 4 freq runoff (2) - 1 freq sniff (2) - 28 freq inuff (2) - 1 freq off (2) - 546 freq hoff (2) - 1 freq niff (2) - 1 freq naff (2) - 2 freq scoff (2) - 12 freq spoff (2) - 4 freq enogh (2) - 20 freq enou (2) - 1 freq enosh (2) - 3 freq enoo (2) - 8 freq loff (2) - 2 freq eiff (2) - 1 freq eno (2) - 9 freq eneuf (2) - 1 freq anuff (2) - 28 freq enoug (2) - 1 freq |
enoff (0) - 1 freq enuff (1) - 12 freq anoff (1) - 6 freq niff (2) - 1 freq naff (2) - 2 freq inuff (2) - 1 freq anuff (2) - 28 freq enof (2) - 5 freq eneuf (3) - 1 freq toff (3) - 12 freq eff (3) - 13 freq snuff (3) - 9 freq 'nuff (3) - 1 freq coff (3) - 19 freq nyaff (3) - 24 freq enu'f (3) - 1 freq geoff (3) - 2 freq eiff (3) - 1 freq doff (3) - 3 freq naffu (3) - 1 freq sniff (3) - 28 freq off (3) - 546 freq runoff (3) - 1 freq enuf (3) - 13 freq anof (3) - 4 freq |
SoundEx code - E510 empie - 25 freq envy - 25 freq envie - 2 freq enuf - 13 freq enu'f - 1 freq empy - 6 freq eneuf - 1 freq enuff - 12 freq emva - 1 freq enof - 5 freq env - 1 freq emyf - 1 freq eiemv - 1 freq enoff - 1 freq |
MetaPhone code - ENF enough - 911 freq eneugh - 49 freq envy - 25 freq envie - 2 freq enuf - 13 freq enu'f - 1 freq enugh - 2 freq eneuf - 1 freq enogh - 20 freq enough-a - 1 freq 'enough - 1 freq enuff - 12 freq €œenough - 1 freq enof - 5 freq env - 1 freq enoff - 1 freq |
ENOFF |
| Time to execute Levenshtein function - 0.199584 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.360666 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.027874 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.038941 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.000882 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. |