| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ncer (0) - 1 freq acer (1) - 1 freq ner (1) - 53 freq cer (1) - 1 freq dcer (1) - 1 freq ncher (1) - 1 freq ncar (1) - 1 freq neer (1) - 51 freq gcer (1) - 2 freq nicer (1) - 6 freq seer (2) - 39 freq nyerp (2) - 1 freq cer- (2) - 1 freq aces (2) - 5 freq aner (2) - 2 freq meer (2) - 9 freq pler (2) - 1 freq efer (2) - 1 freq once (2) - 129 freq nyir (2) - 1 freq neep (2) - 130 freq nne (2) - 1 freq ne'er (2) - 173 freq newer (2) - 7 freq €œer (2) - 1 freq |
ncer (0) - 1 freq ncar (1) - 1 freq nicer (1) - 6 freq ouncer (2) - 1 freq cer (2) - 1 freq acer (2) - 1 freq nucear (2) - 1 freq gcer (2) - 2 freq incur (2) - 2 freq neer (2) - 51 freq ncher (2) - 1 freq dcer (2) - 1 freq ner (2) - 53 freq ulcer (3) - 1 freq nuce (3) - 1 freq niwer (3) - 28 freq inner (3) - 46 freq nvr (3) - 2 freq hcr (3) - 2 freq namer (3) - 1 freq near (3) - 1175 freq nxur (3) - 1 freq wycer (3) - 6 freq nweir (3) - 6 freq ncs (3) - 2 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 - NSR nicer - 6 freq ncer - 1 freq nucear - 1 freq nisra - 2 freq nasser - 1 freq nazir - 1 freq |
NCER |
| Time to execute Levenshtein function - 0.363380 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.687364 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.070093 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.079070 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.001263 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. |