| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nfum (0) - 2 freq fum (1) - 1 freq nyum (1) - 2 freq nfu (1) - 1 freq wnzum (2) - 1 freq bum (2) - 44 freq nffc (2) - 1 freq nvm (2) - 1 freq 'cum (2) - 4 freq nfxo (2) - 1 freq nxm (2) - 1 freq mum (2) - 181 freq €˜um (2) - 33 freq neuk (2) - 183 freq ofzm (2) - 1 freq furm (2) - 20 freq tfrm (2) - 1 freq gum (2) - 19 freq nub (2) - 5 freq acum (2) - 1 freq eum (2) - 1 freq cfuvm (2) - 1 freq fume (2) - 4 freq nahum (2) - 3 freq 'fur (2) - 8 freq |
nfum (0) - 2 freq fum (2) - 1 freq nfu (2) - 1 freq nyum (2) - 2 freq fm (3) - 90 freq nym (3) - 1 freq nehm (3) - 1 freq numm (3) - 1 freq naem (3) - 48 freq nim (3) - 9 freq nrm (3) - 3 freq nfb (3) - 1 freq nuf (3) - 1 freq injum (3) - 1 freq fom (3) - 2 freq naim (3) - 5 freq nfl (3) - 2 freq annum (3) - 2 freq neem (3) - 22 freq oncum (3) - 50 freq nm (3) - 2 freq infur (3) - 1 freq nsm (3) - 1 freq gfm (3) - 1 freq norm (3) - 11 freq |
SoundEx code - N150 nippin - 31 freq nebbin - 2 freq nippin' - 3 freq nippen - 1 freq nappin - 1 freq novena - 1 freq neibin - 3 freq neebin - 2 freq navyne - 3 freq nippan - 1 freq nuppin - 1 freq nibon - 1 freq nyow-funn - 1 freq nabbin - 2 freq niven - 3 freq n'ben - 1 freq newheiven - 1 freq nfum - 2 freq nvm - 1 freq nevin - 1 freq naefun - 1 freq npn - 1 freq nvmm - 1 freq |
MetaPhone code - NFM nfum - 2 freq nvm - 1 freq nvmm - 1 freq |
NFUM |
| Time to execute Levenshtein function - 0.205407 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.383154 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.029322 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.039805 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.001002 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. |