| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nosin (0) - 2 freq nosn (1) - 1 freq nonin (1) - 1 freq nosie (1) - 1 freq nasin (1) - 1 freq nogin (1) - 1 freq notin (1) - 6 freq noisin (1) - 2 freq nomin (1) - 1 freq posin (1) - 9 freq losin (1) - 38 freq nohin (1) - 1 freq oshin (2) - 1 freq snokin (2) - 2 freq dovin (2) - 2 freq oesin (2) - 1 freq bowsin (2) - 1 freq robin (2) - 196 freq nuhin (2) - 48 freq tokin (2) - 4 freq loasin (2) - 6 freq issin (2) - 1 freq ooin (2) - 1 freq non (2) - 39 freq yasin (2) - 15 freq |
nosin (0) - 2 freq noisin (1) - 2 freq nosn (1) - 1 freq nasin (1) - 1 freq nomin (2) - 1 freq nohin (2) - 1 freq losin (2) - 38 freq posin (2) - 9 freq notin (2) - 6 freq nonin (2) - 1 freq nosie (2) - 1 freq nogin (2) - 1 freq roisin (3) - 2 freq aisin (3) - 1 freq notion (3) - 223 freq nosey (3) - 13 freq cousin (3) - 100 freq nosed (3) - 6 freq rousin (3) - 5 freq naein (3) - 1 freq hoosin (3) - 19 freq nose (3) - 216 freq nsne (3) - 1 freq noses (3) - 20 freq boson (3) - 1 freq |
SoundEx code - N250 newsin - 29 freq na-sayin - 4 freq noshun - 3 freq noggin - 1 freq noisome - 1 freq nasin - 1 freq naggin - 10 freq nickin - 8 freq neeson - 1 freq newsan - 2 freq nikkin - 1 freq neo-con - 3 freq neocon - 1 freq nahshon - 7 freq nashin - 3 freq nogin - 1 freq naggan - 2 freq nyaagin - 1 freq nickum - 1 freq nignae - 1 freq nosin - 2 freq nyiggin - 1 freq noisin - 2 freq neckin - 3 freq neighin - 1 freq nixon - 8 freq nmcginn - 1 freq nosn - 1 freq nsm - 1 freq nsne - 1 freq nxm - 1 freq nkcuuom - 1 freq nickin - 1 freq nucmw - 1 freq nkmy - 1 freq nscan - 1 freq nxsjm - 1 freq nauseam - 1 freq njoyin - 1 freq |
MetaPhone code - NSN newsin - 29 freq nasin - 1 freq neeson - 1 freq newsan - 2 freq nosin - 2 freq noisin - 2 freq nosn - 1 freq nsne - 1 freq |
NOSIN |
| Time to execute Levenshtein function - 0.206045 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.383159 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.032617 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.037216 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.000896 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. |