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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
sherrickin (0) - 2 freq
sherrackin (1) - 1 freq
sherrick (2) - 2 freq
shirrikin (2) - 1 freq
shirrackin (2) - 1 freq
shrinkin (3) - 17 freq
sheeriin (3) - 1 freq
herriein (3) - 1 freq
shriekin (3) - 2 freq
strickin (3) - 1 freq
servicin (3) - 1 freq
derriakin (3) - 74 freq
shackin (4) - 1 freq
steikin (4) - 1 freq
smoorikin (4) - 7 freq
cherishin (4) - 1 freq
cherrypickin' (4) - 1 freq
sheepskin (4) - 12 freq
herryin (4) - 2 freq
seratchin (4) - 2 freq
seirchin (4) - 1 freq
stickin (4) - 107 freq
kerriein (4) - 1 freq
€œderriakin (4) - 2 freq
theikin (4) - 2 freq
sherrickin (0) - 2 freq
sherrackin (1) - 1 freq
shirrackin (2) - 1 freq
shirrikin (3) - 1 freq
sherrick (3) - 2 freq
strickin (5) - 1 freq
shrucken (5) - 1 freq
shriekin (5) - 2 freq
shrinkin (5) - 17 freq
shrinkan (6) - 4 freq
shoackin (6) - 3 freq
shicken (6) - 2 freq
swarrachin (6) - 1 freq
stricken (6) - 6 freq
correckin (6) - 1 freq
streckin (6) - 1 freq
shockin (6) - 19 freq
sherlock (6) - 7 freq
servicin (6) - 1 freq
shackin (6) - 1 freq
derriakin (6) - 74 freq
sheeriin (6) - 1 freq
herriein (6) - 1 freq
straikin (7) - 7 freq
sherrif (7) - 2 freq
SoundEx code - S625
searchin - 26 freq
skreechin - 1 freq
shruggin - 5 freq
sergeant - 24 freq
'sergeant - 2 freq
skraichin - 16 freq
skreichin - 11 freq
shore-some - 1 freq
scraichin - 8 freq
sairgint - 7 freq
screechin - 11 freq
skreighin - 4 freq
scorchin - 5 freq
sairchin - 3 freq
seyrchen - 1 freq
skreichan - 1 freq
sair-sounin - 1 freq
scrauchin - 2 freq
skrekan - 3 freq
sherrickin - 2 freq
sergeants - 2 freq
shirrikin - 1 freq
surgeons - 4 freq
shirrackin - 1 freq
sairgeant - 1 freq
screichin - 8 freq
sairgent - 2 freq
seriechin - 1 freq
skraikin - 3 freq
skrekkan - 2 freq
shruggan - 1 freq
scarsome - 1 freq
shargin - 1 freq
sarkeen - 1 freq
skreekan - 1 freq
surging - 1 freq
searching - 2 freq
screchin - 1 freq
shark-infested - 1 freq
scairseness - 1 freq
sursum - 1 freq
swarrachin - 1 freq
sairgants - 1 freq
seriousness - 3 freq
sherrackin - 1 freq
sarkin - 2 freq
'skreichins' - 1 freq
search-ingin - 1 freq
serjeants - 1 freq
surgeon's - 3 freq
skreichmakkers - 15 freq
skreichmakker - 3 freq
skreichmakkers' - 1 freq
skarcement - 1 freq
sirkent - 1 freq
serrsin - 1 freq
shriekin - 2 freq
scraikan - 1 freq
screeching - 3 freq
sourgentine - 1 freq
surgeon - 10 freq
surgin - 2 freq
surgin' - 1 freq
schwarzenegger - 2 freq
seirchin - 1 freq
surasundari - 1 freq
skriechin - 1 freq
skurging - 1 freq
shriekin' - 1 freq
scorching - 1 freq
screechin' - 1 freq
saracen - 1 freq
surgeonsattheedgeoflife - 1 freq
shrucken - 1 freq
sarahcmcooper - 1 freq
seregionyfa - 3 freq
MetaPhone code - XRKN
shruggin - 5 freq
sherrickin - 2 freq
shirrikin - 1 freq
shirrackin - 1 freq
shruggan - 1 freq
sherrackin - 1 freq
shriekin - 2 freq
shriekin' - 1 freq
shrucken - 1 freq
SHERRICKIN
Time to execute Levenshtein function - 0.278396 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.364554 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.028627 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.039833 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.000894 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.