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 sonsie

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

Similar words to nascar in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
nascar (0) - 2 freq
caspar (2) - 1 freq
oscar (2) - 8 freq
mascarg (2) - 1 freq
mascara (2) - 3 freq
pascal (2) - 1 freq
ncar (2) - 1 freq
scar (2) - 16 freq
nasal (2) - 9 freq
rascal (2) - 5 freq
nasser (2) - 1 freq
naar (2) - 7 freq
aspar (2) - 1 freq
nasa (2) - 17 freq
nscan (2) - 1 freq
washer (3) - 5 freq
asap (3) - 10 freq
basan (3) - 1 freq
wasnae (3) - 137 freq
zadar (3) - 4 freq
cascade (3) - 3 freq
sar (3) - 1 freq
fnaar (3) - 2 freq
tuscan (3) - 3 freq
qatar (3) - 9 freq
nascar (0) - 2 freq
nasser (3) - 1 freq
nscan (3) - 1 freq
scar (3) - 16 freq
ncar (3) - 1 freq
mascara (3) - 3 freq
oscar (3) - 8 freq
scair (4) - 2 freq
saucer (4) - 13 freq
ansar (4) - 1 freq
scaar (4) - 20 freq
nicer (4) - 6 freq
scare (4) - 20 freq
siecar (4) - 1 freq
ncer (4) - 1 freq
nescol (4) - 1 freq
nisra (4) - 2 freq
insear (4) - 1 freq
scur (4) - 1 freq
nswer (4) - 1 freq
nucear (4) - 1 freq
rascal (4) - 5 freq
naar (4) - 7 freq
nasal (4) - 9 freq
pascal (4) - 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 - NSKR
nascar - 2 freq
NASCAR
Time to execute Levenshtein function - 0.683928 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.914428 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.091533 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.108994 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.000868 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.