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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
canon (0) - 11 freq
cann (1) - 1 freq
canyon (1) - 1 freq
canons (1) - 1 freq
capon (1) - 1 freq
caron (1) - 1 freq
canton (1) - 2 freq
canon' (1) - 2 freq
cannon (1) - 13 freq
anon (1) - 6 freq
canae (2) - 28 freq
canopy (2) - 10 freq
cantor (2) - 1 freq
canle (2) - 2 freq
camo (2) - 1 freq
cain (2) - 24 freq
paton (2) - 2 freq
canto (2) - 27 freq
caven (2) - 1 freq
cabin (2) - 20 freq
benon (2) - 1 freq
carron (2) - 4 freq
mason (2) - 11 freq
candy (2) - 26 freq
alon (2) - 2 freq
canon (0) - 11 freq
canyon (1) - 1 freq
cann (1) - 1 freq
canno (2) - 26 freq
canine (2) - 3 freq
cnn (2) - 1 freq
canny (2) - 214 freq
canna (2) - 1230 freq
conn (2) - 14 freq
canne (2) - 7 freq
ceann (2) - 1 freq
canni (2) - 6 freq
canaan (2) - 3 freq
caron (2) - 1 freq
capon (2) - 1 freq
canons (2) - 1 freq
canton (2) - 2 freq
canon' (2) - 2 freq
anon (2) - 6 freq
cannon (2) - 13 freq
cainan (2) - 4 freq
croon (3) - 76 freq
cavin (3) - 1 freq
anen (3) - 49 freq
aanin (3) - 2 freq
SoundEx code - C550
comin - 1066 freq
common - 301 freq
'c'moan - 20 freq
c'mon - 87 freq
cunnin - 6 freq
c'moan - 34 freq
cowmon - 1 freq
cannon - 13 freq
canaan - 3 freq
canon' - 2 freq
'c'mon - 7 freq
comena - 2 freq
commin - 8 freq
caumin - 2 freq
cumin - 70 freq
cinema - 8 freq
'commen' - 1 freq
'commen - 1 freq
comin' - 19 freq
canine - 3 freq
coman - 41 freq
cumman - 11 freq
comyn - 3 freq
cumen - 1 freq
cummen - 26 freq
c''mon - 1 freq
cummin' - 1 freq
cmoan - 1 freq
connin - 1 freq
canon - 11 freq
'comin - 3 freq
cmon - 18 freq
cainan - 4 freq
comman - 4 freq
cunnin' - 2 freq
comim - 1 freq
chinnin - 1 freq
camin - 4 freq
comeen - 1 freq
cummin - 30 freq
cuman - 2 freq
coemmaan - 1 freq
con-man - 1 freq
cownan - 1 freq
cun-nan - 1 freq
'coman - 1 freq
cannen - 3 freq
commone - 2 freq
cie-men - 1 freq
ciemen - 1 freq
comunn - 1 freq
cannin - 3 freq
canyon - 1 freq
comon - 1 freq
commoun - 3 freq
€œcaman - 1 freq
commune - 3 freq
coinin - 1 freq
coamon - 1 freq
connin' - 1 freq
€œcannon - 1 freq
coman' - 1 freq
commaun - 1 freq
cÂ’mon - 6 freq
cumoan - 2 freq
‘c’mon - 1 freq
cimin - 1 freq
coomannie - 1 freq
caiman - 1 freq
choonin - 1 freq
cayman - 1 freq
MetaPhone code - KNN
kennin - 297 freq
cunnin - 6 freq
cannon - 13 freq
canaan - 3 freq
canon' - 2 freq
gainin - 11 freq
ken-nae - 3 freq
ken-an - 3 freq
keenin - 10 freq
canine - 3 freq
kennen - 2 freq
'kennin' - 1 freq
kennin' - 1 freq
connin - 1 freq
canon - 11 freq
ken'an - 1 freq
kennan - 14 freq
cainan - 4 freq
kenan - 3 freq
cunnin' - 2 freq
gaanin - 3 freq
kinnen - 4 freq
gannan - 1 freq
quinnin - 1 freq
gainan - 1 freq
kenin - 2 freq
kaenin - 2 freq
cownan - 1 freq
ken-no - 1 freq
keneen - 2 freq
cannen - 3 freq
kanani - 1 freq
cannin - 3 freq
coinin - 1 freq
connin' - 1 freq
€œcannon - 1 freq
kanin - 1 freq
kinnon - 12 freq
CANON
Time to execute Levenshtein function - 0.188547 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.333363 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.027752 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.036711 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.000964 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.