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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
kennysc (0) - 38 freq
kenny' (2) - 1 freq
kenny (2) - 46 freq
kenny's (2) - 1 freq
lenny (3) - 9 freq
keenest (3) - 1 freq
renny (3) - 1 freq
kenyon (3) - 1 freq
kynness (3) - 1 freq
kenna (3) - 11 freq
genny (3) - 1 freq
kennt (3) - 151 freq
kennin (3) - 297 freq
denys (3) - 1 freq
keenness (3) - 1 freq
kennymacd (3) - 3 freq
tennyson (3) - 1 freq
kenÂ’s (3) - 1 freq
kennet (3) - 1 freq
keings (3) - 9 freq
kennie (3) - 1 freq
kent's (3) - 2 freq
enns (3) - 11 freq
penny- (3) - 3 freq
kennled (3) - 2 freq
kennysc (0) - 38 freq
keenness (4) - 1 freq
kynness (4) - 1 freq
kenny's (4) - 1 freq
kenny (4) - 46 freq
kenny' (4) - 1 freq
kennlin (5) - 5 freq
kentish (5) - 6 freq
kennins (5) - 6 freq
kennedy (5) - 23 freq
senns (5) - 2 freq
kenning (5) - 10 freq
keenks (5) - 2 freq
dennis (5) - 11 freq
kenneth (5) - 16 freq
kens (5) - 532 freq
keengs (5) - 5 freq
kennel (5) - 11 freq
hennis (5) - 1 freq
kennelt (5) - 1 freq
kennit (5) - 1 freq
kennels' (5) - 1 freq
penneys (5) - 1 freq
kennels (5) - 5 freq
ken's (5) - 6 freq
SoundEx code - K520
knees - 180 freq
kens - 532 freq
knows - 168 freq
knowes - 25 freq
knackie - 10 freq
kynoch - 6 freq
kings - 92 freq
king's - 55 freq
king - 827 freq
keing - 140 freq
knox's - 2 freq
knock - 113 freq
knick - 2 freq
'kings - 1 freq
kenzie - 49 freq
'kenzie - 2 freq
knox - 34 freq
kinks - 12 freq
kames - 7 freq
kink - 8 freq
knack - 12 freq
kynes - 11 freq
keeng - 77 freq
kinch - 20 freq
knocks - 14 freq
ken's - 6 freq
kins - 15 freq
kneesey - 1 freq
kaims - 2 freq
kemis - 1 freq
kines - 21 freq
'king - 1 freq
kensho - 1 freq
knoack - 7 freq
käng - 2 freq
knee's - 1 freq
know's - 1 freq
kïng - 26 freq
kings' - 1 freq
kïngs' - 1 freq
kïngs - 3 freq
konk - 1 freq
'kinky - 1 freq
knaws - 4 freq
knas - 1 freq
keeng's - 5 freq
keengs - 5 freq
keeng' - 1 freq
knacky - 3 freq
kums - 5 freq
kïng's - 1 freq
kanga - 36 freq
keings - 9 freq
keing's - 15 freq
knee-high - 3 freq
kimsey - 1 freq
kenny's - 1 freq
'keing - 1 freq
kinnik - 1 freq
knaggie - 5 freq
kyns - 2 freq
kynness - 1 freq
kong - 7 freq
kyng - 3 freq
knuse - 1 freq
kaens - 2 freq
knock's - 1 freq
kinky - 1 freq
kinchie - 5 freq
kynch - 1 freq
kains - 1 freq
knockha - 1 freq
kemes - 1 freq
kingie - 1 freq
knees' - 1 freq
€˜king - 5 freq
kwango - 1 freq
keenness - 1 freq
€œknock - 2 freq
kiang - 1 freq
kneis - 1 freq
kang - 1 freq
kness - 1 freq
knoax - 1 freq
kuniwyg - 1 freq
kennysc - 38 freq
keenks - 2 freq
keencks - 1 freq
kms - 1 freq
kmch - 1 freq
kmze - 1 freq
kanes - 2 freq
knqcg - 1 freq
kmc - 2 freq
knowesÂ’ - 1 freq
kxzwmk - 1 freq
knos - 1 freq
kqms - 1 freq
kenÂ’s - 1 freq
knj - 1 freq
MetaPhone code - KNSK
kennysc - 38 freq
KENNYSC
Time to execute Levenshtein function - 0.400147 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.604450 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.070261 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.092546 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.001165 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.