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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
coffin (0) - 67 freq
coffins (1) - 6 freq
coafin (1) - 1 freq
soffin (1) - 1 freq
offin (1) - 20 freq
boffin (1) - 2 freq
coftin (1) - 1 freq
coffen (1) - 2 freq
coaffin (1) - 5 freq
doffin (1) - 2 freq
scoffin (1) - 4 freq
offcn (2) - 1 freq
courin (2) - 1 freq
cowpin (2) - 26 freq
collin (2) - 2 freq
coffeen (2) - 1 freq
bowffin (2) - 1 freq
roofin (2) - 1 freq
boufin (2) - 3 freq
chaffin (2) - 2 freq
coffey (2) - 3 freq
bowfin (2) - 28 freq
coffins' (2) - 2 freq
cofft (2) - 1 freq
coagin (2) - 1 freq
coffin (0) - 67 freq
coffen (1) - 2 freq
coaffin (1) - 5 freq
scoffin (2) - 4 freq
coffins (2) - 6 freq
coffeen (2) - 1 freq
soffin (2) - 1 freq
doffin (2) - 2 freq
offin (2) - 20 freq
boffin (2) - 2 freq
coftin (2) - 1 freq
coafin (2) - 1 freq
baffin (3) - 1 freq
coolfin (3) - 1 freq
effin (3) - 14 freq
culfin (3) - 1 freq
geffin (3) - 1 freq
faffin (3) - 1 freq
foofin (3) - 1 freq
muffin (3) - 16 freq
scuffin (3) - 2 freq
offen (3) - 17 freq
ruffin (3) - 2 freq
huffin (3) - 7 freq
bouffin (3) - 1 freq
SoundEx code - C150
chappin - 69 freq
copyin - 8 freq
coupon - 57 freq
cabin - 20 freq
cuppin - 6 freq
cavin - 1 freq
cheepin - 6 freq
capone - 1 freq
caffeine - 12 freq
cuban - 2 freq
coffin - 67 freq
coafin - 1 freq
chippin - 7 freq
coupin - 7 freq
coaffin - 5 freq
cowpin - 26 freq
coven - 4 freq
chauvin - 4 freq
cauvin - 1 freq
copin - 4 freq
chappan - 5 freq
chuffin' - 5 freq
chawvin - 1 freq
chappen - 2 freq
coffen - 2 freq
coupen - 1 freq
chaapen - 1 freq
chaavin - 2 freq
cobyn - 1 freq
chibbin - 4 freq
chaffin' - 1 freq
chopin - 1 freq
copan - 1 freq
coupan - 1 freq
choppin - 5 freq
cofhn - 3 freq
coffeen - 1 freq
chavin - 4 freq
chaffin - 2 freq
coapyin - 1 freq
coaffin- - 1 freq
chyavin - 1 freq
caibin - 5 freq
cfm - 1 freq
cavan - 1 freq
cappin - 1 freq
coopin - 1 freq
choppin' - 1 freq
chafin - 1 freq
cobain - 1 freq
chappin' - 1 freq
chavvin - 1 freq
caven - 1 freq
cvbmh - 1 freq
capon - 1 freq
cvem - 1 freq
cbm - 2 freq
chavin' - 1 freq
civuni - 1 freq
csxbm - 1 freq
MetaPhone code - KFN
govin - 9 freq
cavin - 1 freq
caffeine - 12 freq
guffin - 1 freq
coffin - 67 freq
coafin - 1 freq
gavin - 42 freq
coaffin - 5 freq
coughin - 14 freq
coven - 4 freq
cauvin - 1 freq
coffen - 2 freq
kevin - 46 freq
govan - 10 freq
quaffin - 2 freq
gvaain - 1 freq
gaffin - 5 freq
goavin - 1 freq
cofhn - 3 freq
coffeen - 1 freq
coaffin- - 1 freq
gowfin - 2 freq
gvaan - 1 freq
gaughan - 8 freq
cavan - 1 freq
guffan - 1 freq
caven - 1 freq
govn - 2 freq
kevin' - 1 freq
COFFIN
Time to execute Levenshtein function - 0.362160 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.790654 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.030497 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.086812 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.