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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
knawn (0) - 6 freq
knaws (1) - 4 freq
knaw (1) - 16 freq
knawin (1) - 3 freq
known (1) - 62 freq
nan (2) - 14 freq
snaws (2) - 15 freq
'gawn (2) - 2 freq
stawn (2) - 4 freq
spawn (2) - 5 freq
rawn (2) - 1 freq
'naw' (2) - 3 freq
lawn (2) - 16 freq
hawn (2) - 32 freq
nain (2) - 5 freq
anaw' (2) - 1 freq
knowe (2) - 56 freq
naws (2) - 1 freq
grawn (2) - 4 freq
fawn (2) - 23 freq
naun (2) - 1 freq
naen (2) - 10 freq
snawy (2) - 6 freq
naw (2) - 895 freq
know (2) - 1123 freq
knawn (0) - 6 freq
knawin (1) - 3 freq
known (1) - 62 freq
knowin (2) - 46 freq
knaws (2) - 4 freq
knowan (2) - 2 freq
knaw (2) - 16 freq
knowe (3) - 56 freq
knows (3) - 147 freq
know (3) - 1123 freq
knawed (3) - 1 freq
gnawin (3) - 2 freq
kenan (3) - 3 freq
onknawn (3) - 1 freq
knawnot (3) - 1 freq
unknawn (3) - 1 freq
knew (3) - 218 freq
snawin (3) - 6 freq
know' (3) - 1 freq
kinkin (4) - 3 freq
knowed (4) - 64 freq
knowes (4) - 25 freq
keneen (4) - 2 freq
kindon (4) - 1 freq
kenin (4) - 2 freq
SoundEx code - K550
kennin - 296 freq
known - 62 freq
knowin - 46 freq
know-an - 1 freq
ken-an - 3 freq
kinema - 8 freq
keenin - 10 freq
kennen - 2 freq
'kennin' - 1 freq
kiemon - 1 freq
kenyon - 1 freq
ken'an - 1 freq
kennan - 14 freq
kenan - 3 freq
knowin' - 2 freq
kinnen - 4 freq
kenin - 2 freq
knawin - 3 freq
kaenin - 2 freq
knowan - 2 freq
keneen - 2 freq
ken-me-na - 1 freq
knawn - 6 freq
kanani - 1 freq
kanin - 1 freq
komin - 1 freq
kemonn - 1 freq
kinnon - 12 freq
MetaPhone code - NN
nane - 544 freq
nae'n - 1 freq
neen - 130 freq
nine - 229 freq
known - 62 freq
know-an - 1 freq
none - 57 freq
noon - 28 freq
non - 36 freq
na-na - 1 freq
n'en - 6 freq
nuin - 14 freq
nan - 14 freq
'nane - 5 freq
neon - 7 freq
nanny - 7 freq
neyn - 1 freq
naen - 10 freq
nun - 9 freq
'nine - 2 freq
nein - 4 freq
'nein - 1 freq
niné - 1 freq
nen - 6 freq
nain - 5 freq
'no-no' - 1 freq
hnnin - 1 freq
nannie - 4 freq
nyne - 4 freq
nano- - 1 freq
non- - 1 freq
nana - 11 freq
nina - 1 freq
hynin - 1 freq
noun - 48 freq
'none - 1 freq
€˜nannie - 1 freq
knawn - 6 freq
€œnane - 3 freq
nin - 1 freq
neon- - 1 freq
€œneen - 2 freq
naun - 1 freq
nien - 5 freq
neean - 1 freq
no-one - 3 freq
€™nine - 1 freq
neeenaaw - 1 freq
nean - 1 freq
nani - 1 freq
'naan' - 1 freq
naan - 2 freq
nanna - 1 freq
nyhn - 1 freq
KNAWN
Time to execute Levenshtein function - 0.197242 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.382416 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.034712 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.041021 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.001021 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.