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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
known (0) - 62 freq
knawn (1) - 6 freq
know' (1) - 1 freq
knowin (1) - 46 freq
knowan (1) - 2 freq
know (1) - 1123 freq
knows (1) - 147 freq
knowe (1) - 56 freq
knew (2) - 218 freq
knock (2) - 111 freq
knowte (2) - 1 freq
knowing (2) - 5 freq
stown (2) - 7 freq
snow (2) - 66 freq
snowin (2) - 4 freq
knaws (2) - 4 freq
anon (2) - 6 freq
nowp (2) - 1 freq
nosn (2) - 1 freq
noun (2) - 48 freq
pown (2) - 3 freq
snowk (2) - 6 freq
kowk (2) - 1 freq
'now (2) - 3 freq
'know (2) - 2 freq
known (0) - 62 freq
knowan (1) - 2 freq
knawn (1) - 6 freq
knowin (1) - 46 freq
knawin (2) - 3 freq
knows (2) - 147 freq
knowe (2) - 56 freq
know' (2) - 1 freq
know (2) - 1123 freq
unknown (3) - 8 freq
knowin' (3) - 2 freq
renown (3) - 1 freq
know-an (3) - 1 freq
knowed (3) - 64 freq
aknow (3) - 1 freq
knowes (3) - 25 freq
knowing (3) - 5 freq
knowte (3) - 1 freq
knew (3) - 218 freq
knaw (3) - 16 freq
ranown (3) - 1 freq
knaws (3) - 4 freq
snowin (3) - 4 freq
town (4) - 51 freq
snawin (4) - 6 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
KNOWN
know - 1123 freq
knaw - 16 freq
knew - 218 freq
known - 62 freq
unknown - 8 freq
Time to execute Levenshtein function - 0.186155 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.338173 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.029163 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.041303 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.001084 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.