| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nsync (0) - 1 freq sync (1) - 6 freq syc (2) - 1 freq ync (2) - 1 freq nfyfc (2) - 1 freq neyn (2) - 1 freq nyc (2) - 1 freq 'syne (2) - 10 freq nyne (2) - 4 freq nsne (2) - 1 freq synt (2) - 1 freq snc (2) - 1 freq synd (2) - 4 freq syne (2) - 1913 freq syn (2) - 6 freq peynt (3) - 1 freq sand (3) - 87 freq kynch (3) - 1 freq xyn (3) - 1 freq onc (3) - 1 freq bryni (3) - 1 freq nen (3) - 6 freq xhyn (3) - 1 freq franc (3) - 6 freq nhsggc (3) - 1 freq |
nsync (0) - 1 freq sync (2) - 6 freq snc (3) - 1 freq nsne (3) - 1 freq sence (4) - 1 freq nusnp (4) - 2 freq since (4) - 586 freq nance (4) - 7 freq nuance (4) - 3 freq nosin (4) - 2 freq insec (4) - 2 freq unsung (4) - 2 freq nasin (4) - 1 freq nuisance (4) - 8 freq insane (4) - 8 freq nuncy (4) - 1 freq nosn (4) - 1 freq nancy (4) - 37 freq 'since (4) - 1 freq nyc (4) - 1 freq 'syne (4) - 10 freq neyn (4) - 1 freq nfyfc (4) - 1 freq syc (4) - 1 freq ync (4) - 1 freq |
SoundEx code - N252 no-sae-muckle - 5 freq nijinski - 1 freq nagemist - 1 freq no-saeinnocent - 1 freq neo-cons - 2 freq nosiness - 1 freq newsins - 4 freq noggins - 2 freq nicey-nice - 2 freq ïncense - 3 freq newcome's - 1 freq noise-ye-mak-afore-stertin-a-bit-o-poetry - 1 freq nay-saying - 1 freq noshuns - 1 freq nuisance - 8 freq newsnight - 2 freq newsing - 1 freq nickums - 1 freq ncimga - 1 freq nhsnss - 5 freq naechance - 1 freq nsxsinq - 1 freq nhgsmixspx - 1 freq ngunctfmzm - 1 freq noxyinxxprisons - 1 freq nosenicky - 1 freq nsync - 1 freq newsonscotland - 1 freq |
MetaPhone code - NSNK newsing - 1 freq nosenicky - 1 freq nsync - 1 freq |
NSYNC |
| Time to execute Levenshtein function - 0.200282 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.407187 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.032745 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.039580 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.000932 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. |