Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nicher (0) - 5 freq nicker (1) - 1 freq ticher (1) - 3 freq ncher (1) - 1 freq sicher (1) - 1 freq richer (1) - 15 freq niches (1) - 1 freq ficher (1) - 4 freq hicher (1) - 1 freq snicher (1) - 3 freq nicer (1) - 6 freq niche (1) - 7 freq picher (1) - 4 freq nither (1) - 5 freq nether (2) - 26 freq wither (2) - 142 freq tiched (2) - 2 freq anither (2) - 2001 freq riches (2) - 23 freq laicher (2) - 5 freq niver (2) - 849 freq lichen (2) - 8 freq higher (2) - 76 freq siched (2) - 9 freq nivver (2) - 976 freq |
nicher (0) - 5 freq ncher (1) - 1 freq nicer (2) - 6 freq snicher (2) - 3 freq anocher (2) - 1 freq picher (2) - 4 freq hicher (2) - 1 freq nither (2) - 5 freq niche (2) - 7 freq nicker (2) - 1 freq ficher (2) - 4 freq sicher (2) - 1 freq ticher (2) - 3 freq niches (2) - 1 freq richer (2) - 15 freq aircher (3) - 1 freq ichor (3) - 1 freq acher (3) - 1 freq neither (3) - 166 freq ncer (3) - 1 freq archer (3) - 9 freq naither (3) - 63 freq tocher (3) - 25 freq nichty (3) - 3 freq nithir (3) - 1 freq |
SoundEx code - N260 nicer - 6 freq nicher - 5 freq ncer - 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 - NXR nicher - 5 freq ncher - 1 freq |
NICHER |
Time to execute Levenshtein function - 0.240927 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.458701 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.030987 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.041072 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.000933 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. |