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 cozzies in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
cozzies (0) - 1 freq
mozzies (1) - 1 freq
cozzie (1) - 3 freq
coories (2) - 5 freq
vizzies (2) - 3 freq
hizzies (2) - 4 freq
copies (2) - 40 freq
fozzie (2) - 1 freq
cunzies (2) - 1 freq
dizzies (2) - 1 freq
coggies (2) - 1 freq
dazzies (2) - 1 freq
corbies (2) - 20 freq
condies (2) - 2 freq
wuzzies (2) - 1 freq
corries (2) - 14 freq
costies (2) - 8 freq
comfies (2) - 2 freq
cosies (2) - 1 freq
cooties (2) - 1 freq
collies (2) - 1 freq
coapies (2) - 4 freq
cookies (2) - 10 freq
wordies (3) - 6 freq
cizzens (3) - 1 freq
cozzies (0) - 1 freq
cozzie (2) - 3 freq
mozzies (2) - 1 freq
dizzies (3) - 1 freq
wuzzies (3) - 1 freq
dazzies (3) - 1 freq
cunzies (3) - 1 freq
vizzies (3) - 3 freq
hizzies (3) - 4 freq
cookies (4) - 10 freq
cooties (4) - 1 freq
coapies (4) - 4 freq
buzzes (4) - 4 freq
cizzens (4) - 1 freq
cosies (4) - 1 freq
gizzes (4) - 2 freq
cuzzin (4) - 1 freq
cizzin (4) - 1 freq
collies (4) - 1 freq
coggies (4) - 1 freq
comfies (4) - 2 freq
copies (4) - 40 freq
coories (4) - 5 freq
corbies (4) - 20 freq
fozzie (4) - 1 freq
SoundEx code - C220
chuckies - 25 freq
cakes - 54 freq
coaches - 9 freq
chices - 1 freq
causeys - 4 freq
écossais - 1 freq
cases - 54 freq
cassie's - 2 freq
chookies - 19 freq
coughs - 6 freq
chyces - 15 freq
cheques - 13 freq
causies - 6 freq
chicago - 3 freq
cages - 8 freq
coggies - 1 freq
choices - 26 freq
cuckoo's - 2 freq
chookie's - 10 freq
caises - 2 freq
cokes - 2 freq
causes - 23 freq
chooses - 7 freq
ciggies - 2 freq
cheeses - 1 freq
cossack - 8 freq
chazza's - 1 freq
cozzies - 1 freq
cookies - 10 freq
ca'ses - 1 freq
chases - 7 freq
choises - 1 freq
casses - 1 freq
'chookies - 1 freq
'chook-chook - 1 freq
chasies - 1 freq
cowshus - 5 freq
chookies' - 1 freq
cassies - 6 freq
caases - 3 freq
chassis - 4 freq
chuckie's - 1 freq
chiesis - 1 freq
chicawgie - 2 freq
coo-cake - 1 freq
cochise - 5 freq
caesses - 2 freq
causays - 1 freq
chokes - 2 freq
coach's - 1 freq
€˜chiesis - 1 freq
chukkies - 2 freq
coke's - 1 freq
chyges - 2 freq
cokkis - 1 freq
cakies - 1 freq
couscous - 2 freq
coshes - 1 freq
couches - 2 freq
Écossaise - 1 freq
choukies - 2 freq
cosies - 1 freq
cocoaooze - 1 freq
cascasg - 1 freq
coigach - 1 freq
chachacha - 1 freq
czechs - 1 freq
MetaPhone code - KSS
kisses - 29 freq
causeys - 4 freq
écossais - 1 freq
cases - 54 freq
cassie's - 2 freq
causies - 6 freq
caises - 2 freq
causes - 23 freq
gazes - 2 freq
cozzies - 1 freq
guces - 1 freq
ca'ses - 1 freq
keysies - 1 freq
casses - 1 freq
guesses - 6 freq
gases - 6 freq
cassies - 6 freq
caases - 3 freq
caesses - 2 freq
kissies - 1 freq
causays - 1 freq
guises - 1 freq
gaseous - 7 freq
kaces - 1 freq
€˜guesses - 1 freq
goose's - 1 freq
cses - 2 freq
Écossaise - 1 freq
quizzes - 4 freq
cosies - 1 freq
czazo - 1 freq
csez - 1 freq
qzs - 1 freq
hqwzs - 1 freq
wxis - 1 freq
kzhz - 1 freq
COZZIES
Time to execute Levenshtein function - 0.198365 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.330990 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.027695 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.036716 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.000803 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.