Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
noshun (0) - 3 freq noshuns (1) - 1 freq moshun (1) - 1 freq nothin (2) - 194 freq moshin (2) - 1 freq joshua (2) - 13 freq oshin (2) - 1 freq fashun (2) - 2 freq nosin (2) - 2 freq loshan (2) - 1 freq nosn (2) - 1 freq nosh (2) - 1 freq shun (2) - 9 freq bohun (2) - 2 freq noun (2) - 48 freq nohin (2) - 1 freq nothen (2) - 1 freq nashin (2) - 3 freq shuv (3) - 7 freq nihin (3) - 5 freq hooshin (3) - 1 freq josh (3) - 3 freq shuk (3) - 29 freq ashen (3) - 2 freq nou- (3) - 1 freq |
noshun (0) - 3 freq moshun (2) - 1 freq nashin (2) - 3 freq noshuns (2) - 1 freq nosh (3) - 1 freq shun (3) - 9 freq nothen (3) - 1 freq loshan (3) - 1 freq nohin (3) - 1 freq nosn (3) - 1 freq nothin (3) - 194 freq moshin (3) - 1 freq oshin (3) - 1 freq nosin (3) - 2 freq fashun (3) - 2 freq nesh (4) - 4 freq nyhn (4) - 1 freq fashan (4) - 2 freq dashan (4) - 1 freq gnashin (4) - 3 freq rashan (4) - 2 freq shuin (4) - 99 freq elshin (4) - 1 freq rushin (4) - 17 freq fashin (4) - 28 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 - NXN notion - 223 freq nation - 144 freq noshun - 3 freq notion' - 1 freq nahshon - 7 freq nashin - 3 freq gnashin - 3 freq nation' - 2 freq naitioun - 7 freq natioun - 5 freq naition - 1 freq nation - 1 freq |
NOSHUN |
Time to execute Levenshtein function - 0.418887 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.669685 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.030758 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.074440 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.001179 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. |