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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
srowin (0) - 1 freq
snowin (1) - 4 freq
showin (1) - 76 freq
crowin (1) - 2 freq
slowin (1) - 14 freq
stowin (1) - 6 freq
growin (1) - 240 freq
rowin (1) - 30 freq
crowdin (2) - 1 freq
provin (2) - 3 freq
sewin (2) - 14 freq
grawin (2) - 13 freq
groin (2) - 3 freq
slawin (2) - 2 freq
dronin (2) - 3 freq
frown (2) - 5 freq
showan (2) - 5 freq
hyowin (2) - 2 freq
towin (2) - 1 freq
shonin (2) - 1 freq
growzn (2) - 1 freq
myowin (2) - 1 freq
stowan (2) - 1 freq
scowlin (2) - 2 freq
snowing (2) - 4 freq
srowin (0) - 1 freq
stowin (2) - 6 freq
growin (2) - 240 freq
slowin (2) - 14 freq
rowin (2) - 30 freq
snowin (2) - 4 freq
showin (2) - 76 freq
crowin (2) - 2 freq
growein (3) - 42 freq
swawin (3) - 3 freq
snawin (3) - 6 freq
rowein (3) - 7 freq
crown (3) - 21 freq
rowan (3) - 18 freq
shewin (3) - 19 freq
grouwin (3) - 1 freq
slowan (3) - 1 freq
sprewin (3) - 1 freq
erowan (3) - 1 freq
growan (3) - 24 freq
stown (3) - 7 freq
drown (3) - 2 freq
brewin (3) - 8 freq
sawin (3) - 11 freq
spewin (3) - 19 freq
SoundEx code - S650
sharin - 44 freq
shore-win - 1 freq
scran - 84 freq
soarin - 9 freq
srowin - 1 freq
scream - 67 freq
soor-an - 4 freq
siren - 10 freq
screen - 140 freq
scorn - 18 freq
scaurin - 1 freq
squirm - 5 freq
scorin - 6 freq
sharon - 10 freq
serrin - 5 freq
screwin - 7 freq
scarn - 2 freq
scrawny - 11 freq
shorn - 7 freq
scourin - 11 freq
sour-an - 1 freq
sweerin - 12 freq
sharn - 29 freq
shairn - 17 freq
sweirin - 16 freq
scarrin - 1 freq
scrum - 2 freq
swarm - 2 freq
swearin - 16 freq
sorn - 28 freq
searin - 4 freq
shrine - 12 freq
swairm - 3 freq
shooerin - 2 freq
scryin - 1 freq
sweeren - 1 freq
scooren - 2 freq
scurryin - 7 freq
showerin - 1 freq
shirin - 2 freq
shoorin - 1 freq
squarin - 1 freq
sharny - 7 freq
scarin - 2 freq
showroom - 2 freq
sworn - 13 freq
shairny - 2 freq
swirin - 1 freq
'sron - 1 freq
skewerin - 1 freq
score-in - 2 freq
sware-in - 1 freq
sarne - 1 freq
scorem - 1 freq
sairin - 3 freq
syrian - 2 freq
skrime - 1 freq
scream' - 1 freq
sooran - 1 freq
sharan - 4 freq
scoorin - 2 freq
sorun - 1 freq
shorin - 1 freq
skrene - 1 freq
skyran - 3 freq
swaeran - 1 freq
sheeriin - 1 freq
scurrian - 1 freq
shairin - 2 freq
sharin' - 1 freq
skirrin - 2 freq
scram - 1 freq
'sharon - 1 freq
scouran - 1 freq
serene - 2 freq
sharnie - 1 freq
sharn- - 1 freq
souerane - 1 freq
swurn - 1 freq
scrime - 3 freq
screin - 3 freq
skyrin - 1 freq
scraun - 1 freq
sirin - 1 freq
shiran - 3 freq
serum - 4 freq
shrne - 1 freq
skairin - 1 freq
skorne - 1 freq
shearin - 2 freq
scrim - 1 freq
sarnie - 3 freq
€˜scorin - 2 freq
€™s-erran - 2 freq
sorny - 2 freq
saurin - 1 freq
sauron - 1 freq
skorn - 1 freq
sherrene - 1 freq
sweirn - 1 freq
‘shorn’ - 1 freq
srmn - 1 freq
sharron - 3 freq
sharein - 1 freq
MetaPhone code - SRWN
srowin - 1 freq
SROWIN
Time to execute Levenshtein function - 0.208340 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.378376 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.028151 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.038077 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.000874 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.