| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| njr (0) - 1 freq nr (1) - 8 freq mjr (1) - 23 freq nar (1) - 15 freq ndr (1) - 1 freq nhr (1) - 1 freq nor (1) - 1978 freq njl (1) - 1 freq nxr (1) - 1 freq ner (1) - 53 freq nvr (1) - 2 freq ajr (1) - 1 freq jr (1) - 17 freq nj (1) - 4 freq njc (1) - 1 freq nur (1) - 61 freq pjr (1) - 1 freq nir (1) - 49 freq njk (1) - 1 freq tjr (1) - 1 freq gjr (1) - 1 freq nqr (1) - 1 freq pj (2) - 10 freq noor (2) - 44 freq jrb (2) - 3 freq |
njr (0) - 1 freq nur (2) - 61 freq njc (2) - 1 freq jr (2) - 17 freq pjr (2) - 1 freq nj (2) - 4 freq nir (2) - 49 freq nqr (2) - 1 freq gjr (2) - 1 freq tjr (2) - 1 freq ajr (2) - 1 freq njk (2) - 1 freq ndr (2) - 1 freq mjr (2) - 23 freq nr (2) - 8 freq nvr (2) - 2 freq nhr (2) - 1 freq nar (2) - 15 freq ner (2) - 53 freq nxr (2) - 1 freq njl (2) - 1 freq nor (2) - 1978 freq neri (3) - 3 freq nare (3) - 1 freq intr (3) - 1 freq |
SoundEx code - N260 nicer - 6 freq nicher - 5 freq ncer - 1 freq noughr - 1 freq nswer - 1 freq ncher - 1 freq nucear - 1 freq ncar - 1 freq nicker - 1 freq nisra - 2 freq niagara - 1 freq nasser - 1 freq nigeria - 5 freq niger - 1 freq nagarr - 2 freq neiger - 1 freq €œneiger - 1 freq nxur - 1 freq njr - 1 freq naeyisser - 1 freq nxsir - 1 freq nqr - 1 freq nazir - 1 freq nascar - 2 freq nxr - 1 freq |
MetaPhone code - NJR nigeria - 5 freq niger - 1 freq neiger - 1 freq €œneiger - 1 freq njr - 1 freq ndgear - 1 freq |
NJR |
| Time to execute Levenshtein function - 0.224872 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.386858 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.027466 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.037931 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.000946 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. |