A Corpus of 21st Century Scots Texts

Intro a b c d e f g h i j k l m n o p q r s t u v w x y z Texts Writers Statistics Top200 Search Compare

Levenshtein Distance

Enter a word to find nearest neighbouring words, for example ablow

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to ncher in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
ncher (0) - 1 freq
ncer (1) - 1 freq
nicher (1) - 5 freq
acher (1) - 1 freq
cher (1) - 6 freq
dcer (2) - 1 freq
newer (2) - 7 freq
ficher (2) - 4 freq
sche (2) - 1 freq
vincher (2) - 1 freq
€œher (2) - 1 freq
hicher (2) - 1 freq
snicher (2) - 3 freq
cheir (2) - 9 freq
tther (2) - 6 freq
echr (2) - 1 freq
cer (2) - 1 freq
chaer (2) - 1 freq
nither (2) - 5 freq
chbr (2) - 1 freq
nether (2) - 26 freq
asher (2) - 1 freq
nahor (2) - 3 freq
'her (2) - 7 freq
ached (2) - 4 freq
ncher (0) - 1 freq
nicher (1) - 5 freq
anchor (2) - 28 freq
anocher (2) - 1 freq
cher (2) - 6 freq
ncer (2) - 1 freq
acher (2) - 1 freq
pincher (3) - 2 freq
lecher (3) - 1 freq
schir (3) - 2 freq
rocher (3) - 5 freq
nahr (3) - 1 freq
wuncher (3) - 1 freq
unther (3) - 9 freq
nch (3) - 2 freq
inches (3) - 98 freq
onnher (3) - 1 freq
richer (3) - 15 freq
cheer (3) - 154 freq
ichor (3) - 1 freq
picher (3) - 4 freq
archer (3) - 9 freq
nicer (3) - 6 freq
buncher (3) - 1 freq
schar (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 - NXR
nicher - 5 freq
ncher - 1 freq
NCHER
Time to execute Levenshtein function - 0.232889 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.445198 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.037516 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.043708 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.000862 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.