| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nsfw (0) - 4 freq nsfwy (1) - 1 freq 'nsfw' (2) - 1 freq drfw (2) - 1 freq ufw (2) - 1 freq csw (2) - 2 freq xsfl (2) - 1 freq sw (2) - 3 freq nsz (2) - 1 freq msfc (2) - 3 freq sjw (2) - 1 freq nvw (2) - 1 freq gsfc (2) - 2 freq stw (2) - 43 freq nufc (2) - 6 freq sow (2) - 17 freq nsm (2) - 1 freq nsne (2) - 1 freq bufw (2) - 1 freq sfp (2) - 4 freq sf (2) - 6 freq pmfw (2) - 1 freq njfa (2) - 1 freq new (2) - 2325 freq nsh (2) - 1 freq |
nsfw (0) - 4 freq nsfwy (1) - 1 freq naw (4) - 909 freq nffc (4) - 1 freq sew (4) - 9 freq niff (4) - 1 freq dsfl (4) - 1 freq rsw (4) - 1 freq nmw (4) - 1 freq vsw (4) - 1 freq ysw (4) - 1 freq msw (4) - 1 freq niaw (4) - 1 freq nsa (4) - 1 freq nuf (4) - 1 freq ns (4) - 15 freq naff (4) - 2 freq saw (4) - 1038 freq neow (4) - 1 freq nsxo (4) - 1 freq rpfw (4) - 1 freq unsafe (4) - 2 freq instaw (4) - 1 freq onfaw (4) - 4 freq ns's (4) - 1 freq |
SoundEx code - N210 necp - 1 freq ncb - 1 freq 'nae-chap - 1 freq ngobo - 4 freq nescafe - 1 freq njzf - 7 freq neighboo - 1 freq nseva - 1 freq nxb - 1 freq njfa - 1 freq nousave - 1 freq nessybhoy - 1 freq nsfwy - 1 freq 'nsfw' - 1 freq nsfw - 4 freq ncsjkkyahf - 1 freq |
MetaPhone code - NSF nseva - 1 freq nousave - 1 freq nsfwy - 1 freq 'nsfw' - 1 freq nsfw - 4 freq |
NSFW |
| Time to execute Levenshtein function - 0.325264 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.705498 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.076117 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.085640 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.000878 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. |