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 ablow

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

Similar words to kxn in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
kxn (0) - 1 freq
kx (1) - 6 freq
hxn (1) - 1 freq
kpn (1) - 1 freq
kin (1) - 1383 freq
ktn (1) - 1 freq
jxn (1) - 1 freq
kxf (1) - 1 freq
kxx (1) - 1 freq
kyn (1) - 20 freq
xn (1) - 3 freq
kan (1) - 28 freq
lxn (1) - 1 freq
ken (1) - 5071 freq
kxo (1) - 1 freq
ann (2) - 105 freq
mx (2) - 6 freq
bx (2) - 4 freq
kr (2) - 4 freq
exe (2) - 2 freq
xw (2) - 4 freq
own (2) - 168 freq
jx (2) - 4 freq
kahn (2) - 2 freq
xt (2) - 1 freq
kxn (0) - 1 freq
xn (2) - 3 freq
kyn (2) - 20 freq
lxn (2) - 1 freq
ken (2) - 5071 freq
kxo (2) - 1 freq
kxx (2) - 1 freq
kan (2) - 28 freq
kpn (2) - 1 freq
hxn (2) - 1 freq
kxf (2) - 1 freq
kin (2) - 1383 freq
kx (2) - 6 freq
ktn (2) - 1 freq
jxn (2) - 1 freq
xno (3) - 1 freq
kni (3) - 1 freq
akin (3) - 12 freq
ikon (3) - 1 freq
kirn (3) - 33 freq
kiln (3) - 7 freq
yken (3) - 1 freq
xyn (3) - 1 freq
kyne (3) - 11 freq
kain (3) - 2 freq
SoundEx code - K500
ken - 5071 freq
kinna - 281 freq
know - 1205 freq
keen - 205 freq
knee - 126 freq
kin - 1383 freq
knew - 227 freq
kan - 28 freq
kin- - 1 freq
kyn - 20 freq
knaw - 16 freq
kenna - 11 freq
ken-nae - 3 freq
ken- - 11 freq
knowe - 56 freq
kaim - 13 freq
kenny - 46 freq
'ken - 8 freq
kemnay - 4 freq
ken' - 3 freq
kinnae - 10 freq
'know - 2 freq
kine - 101 freq
k-ken - 1 freq
'kin - 7 freq
kynea - 1 freq
kcyna - 1 freq
kcyn - 1 freq
keyn - 5 freq
keyna - 4 freq
kyne - 11 freq
kinn - 4 freq
keno - 1 freq
kim - 10 freq
khayyam - 1 freq
kame - 6 freq
kenya - 6 freq
kane - 31 freq
knee-heh - 2 freq
kin' - 2 freq
kïssin - 1 freq
kanna - 1 freq
kmee - 1 freq
km - 4 freq
kyin - 1 freq
'ken' - 4 freq
k'nie - 1 freq
kinno - 24 freq
kin-' - 1 freq
kum - 8 freq
kam - 24 freq
kunna - 1 freq
kehm - 1 freq
'kum - 1 freq
kaam - 1 freq
kaen - 12 freq
know' - 1 freq
ken-no - 1 freq
-kin - 1 freq
-ken - 1 freq
«kin - 1 freq
'know' - 1 freq
'knowe' - 1 freq
khan - 3 freq
kennawha - 9 freq
kni - 1 freq
kenny' - 1 freq
kno - 16 freq
koam - 1 freq
€œken - 2 freq
kene - 1 freq
know-how - 1 freq
kian - 1 freq
kennae - 1 freq
€˜ken - 2 freq
€˜know - 3 freq
€™know - 6 freq
€˜kin - 1 freq
koen - 2 freq
'kinna - 1 freq
€˜kenny - 1 freq
€œkum - 1 freq
keyin - 1 freq
€œkin - 2 freq
kain - 2 freq
'keen - 2 freq
kannae - 1 freq
kahn - 2 freq
€™kin - 2 freq
€™ken - 1 freq
kÂ’in - 1 freq
‘kin - 1 freq
kxn - 1 freq
kgeyom - 1 freq
“ken - 1 freq
kein - 1 freq
kano - 1 freq
kkano - 1 freq
kyam - 1 freq
kahoona - 1 freq
kom - 2 freq
kjm - 1 freq
knei - 1 freq
keen' - 1 freq
kiyan - 1 freq
kanyou - 1 freq
kmm - 1 freq
‘ken’ - 1 freq
keano - 1 freq
kennie - 1 freq
knee' - 1 freq
knaa - 1 freq
MetaPhone code - KKSN
coaxin - 5 freq
coaxan - 3 freq
quicksaun - 2 freq
quicksan - 1 freq
kxn - 1 freq
KXN
Time to execute Levenshtein function - 0.254777 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.378543 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.030912 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.038190 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.000905 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.