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 ahint

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

Similar words to cider in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
cider (0) - 38 freq
aider (1) - 2 freq
cider' (1) - 1 freq
rider (1) - 10 freq
wider (1) - 54 freq
cinder (1) - 2 freq
eider (1) - 3 freq
'cider (1) - 1 freq
wieder (2) - 1 freq
fifer (2) - 11 freq
cinders (2) - 7 freq
ainer (2) - 2 freq
dides (2) - 1 freq
dide (2) - 2 freq
caiver (2) - 1 freq
hirer (2) - 1 freq
einer (2) - 1 freq
riter (2) - 1 freq
guider (2) - 4 freq
kiver (2) - 5 freq
fiver (2) - 46 freq
siner (2) - 1 freq
cheer (2) - 153 freq
wiver (2) - 1 freq
cleer (2) - 6 freq
cider (0) - 38 freq
eider (2) - 3 freq
'cider (2) - 1 freq
cinder (2) - 2 freq
cedar (2) - 4 freq
wider (2) - 54 freq
aider (2) - 2 freq
cider' (2) - 1 freq
rider (2) - 10 freq
cuter (3) - 1 freq
chaer (3) - 1 freq
cadger (3) - 5 freq
cadet (3) - 2 freq
comer (3) - 4 freq
cigar (3) - 19 freq
crier (3) - 2 freq
eilder (3) - 1 freq
cer (3) - 1 freq
tidier (3) - 1 freq
caber (3) - 4 freq
calder (3) - 12 freq
faider (3) - 61 freq
cicero (3) - 1 freq
udder (3) - 1 freq
cidni (3) - 1 freq
SoundEx code - C360
cater - 5 freq
cedar - 4 freq
cider - 38 freq
cheddar - 6 freq
chitter - 14 freq
chatter - 11 freq
cotter - 3 freq
cawdor - 1 freq
cheatrie - 1 freq
cheater - 1 freq
cutter - 5 freq
catter - 16 freq
catrry - 1 freq
cottar - 28 freq
cither - 1 freq
cetera - 1 freq
'cider - 1 freq
cider' - 1 freq
chowder - 1 freq
chitterie - 1 freq
coutar - 1 freq
cawther - 1 freq
€˜cotter - 1 freq
ceterae - 1 freq
cattiewurrie - 1 freq
cawdour - 1 freq
caw-throu - 1 freq
coothier - 2 freq
cuiter - 1 freq
cattery - 8 freq
couture - 1 freq
cowdary - 1 freq
cuter - 1 freq
chatrie - 1 freq
chittery - 1 freq
MetaPhone code - STR
stair - 173 freq
stoor - 100 freq
stare - 69 freq
story - 697 freq
steer - 118 freq
store - 79 freq
stoorie - 21 freq
soutar - 39 freq
stir - 19 freq
cedar - 4 freq
stour - 101 freq
stuir - 4 freq
sture - 6 freq
hysteria - 9 freq
sotter - 34 freq
straa - 9 freq
strae - 102 freq
cider - 38 freq
star - 255 freq
stray - 29 freq
steir - 22 freq
storie - 28 freq
stereo - 7 freq
stairy - 1 freq
seatter - 1 freq
stourie - 13 freq
straw - 27 freq
straiy - 1 freq
syder - 5 freq
stoary - 1 freq
stoar - 1 freq
stare' - 1 freq
stoory - 19 freq
stur - 3 freq
sadder - 4 freq
souter - 9 freq
sottar - 10 freq
staere - 1 freq
star' - 2 freq
satire - 14 freq
starrie - 5 freq
'steer - 1 freq
storey - 4 freq
starry - 7 freq
strew - 1 freq
hïstrie - 8 freq
sterr - 11 freq
cetera - 1 freq
see-trou - 1 freq
'cider - 1 freq
cider' - 1 freq
'star - 1 freq
setter - 4 freq
stra - 1 freq
stoury - 5 freq
ster - 3 freq
'stair' - 1 freq
satyr - 1 freq
-ster - 1 freq
staur - 3 freq
souder - 1 freq
steerie - 2 freq
'stour' - 1 freq
straue - 1 freq
ceterae - 1 freq
stere - 1 freq
strow - 1 freq
zadar - 4 freq
str - 1 freq
story- - 1 freq
steery - 1 freq
sottery - 1 freq
hsitory - 1 freq
stouer - 1 freq
seater - 1 freq
zodr - 1 freq
stree - 1 freq
‘star’ - 1 freq
sitter - 1 freq
xtra - 5 freq
satyre - 1 freq
CIDER
Time to execute Levenshtein function - 0.218569 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.346155 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.027190 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.036837 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.000835 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.