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 sonsie

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to sppry in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
sppry (0) - 1 freq
spry (1) - 3 freq
stpry (1) - 1 freq
sapr (2) - 1 freq
sperm (2) - 5 freq
sparl (2) - 1 freq
spur (2) - 5 freq
spurs (2) - 17 freq
sper (2) - 1 freq
spewy (2) - 1 freq
sport (2) - 153 freq
sarry (2) - 2 freq
sorry (2) - 483 freq
soory (2) - 2 freq
ppy (2) - 1 freq
spey (2) - 4 freq
soary (2) - 3 freq
spar (2) - 14 freq
sapsy (2) - 1 freq
spurn (2) - 2 freq
sporf (2) - 1 freq
spire (2) - 5 freq
sprp (2) - 1 freq
suppy (2) - 1 freq
seery (2) - 2 freq
sppry (0) - 1 freq
spry (2) - 3 freq
stpry (2) - 1 freq
supply (3) - 44 freq
spare (3) - 98 freq
suppy (3) - 1 freq
spire (3) - 5 freq
sappy (3) - 19 freq
spar (3) - 14 freq
sipper (3) - 6 freq
supper (3) - 171 freq
sapr (3) - 1 freq
spray (3) - 41 freq
spur (3) - 5 freq
sper (3) - 1 freq
spree (4) - 12 freq
sappho (4) - 8 freq
spier (4) - 42 freq
speer (4) - 21 freq
sopped (4) - 1 freq
suppen (4) - 1 freq
popery (4) - 2 freq
sapple (4) - 1 freq
appar (4) - 2 freq
spidery (4) - 1 freq
SoundEx code - S160
spier - 42 freq
supper - 171 freq
siberia - 4 freq
shipraw - 1 freq
spur - 5 freq
shiver - 32 freq
s'faur - 1 freq
speir - 212 freq
spray - 41 freq
spare - 98 freq
spear - 27 freq
super - 36 freq
safer - 18 freq
'speir - 1 freq
skipper - 51 freq
shaver - 2 freq
swipper - 8 freq
'spare' - 2 freq
sipper - 6 freq
severe - 15 freq
spar - 14 freq
sparrae - 3 freq
sober - 26 freq
suffer - 57 freq
savoury - 1 freq
speer - 21 freq
syver - 4 freq
sabre - 2 freq
saviour - 14 freq
savour - 18 freq
saifer - 3 freq
spair - 1 freq
spry - 3 freq
scaffer - 1 freq
sper - 1 freq
siver - 2 freq
sparra - 11 freq
sphere - 14 freq
sweeper - 3 freq
safari - 2 freq
sever - 3 freq
'safari - 3 freq
'sober - 1 freq
spree - 12 freq
siffer - 3 freq
'sphere - 1 freq
sphere' - 1 freq
savory - 1 freq
saufer - 2 freq
seffer - 1 freq
scabra - 1 freq
spire - 5 freq
sober' - 1 freq
sapphira - 1 freq
skyipper - 2 freq
sapphire - 1 freq
siever - 2 freq
suiffer - 1 freq
suffre - 1 freq
spoor - 2 freq
€˜spray - 1 freq
swaver - 1 freq
sauviour - 1 freq
sparrow - 5 freq
soapbar - 1 freq
€œsparra - 1 freq
soepboer - 1 freq
€˜spier - 1 freq
saufier - 1 freq
sover - 1 freq
speir' - 1 freq
€˜suffer - 1 freq
shopper - 3 freq
€œspare - 1 freq
€œspeir - 1 freq
sapr - 1 freq
soubry - 1 freq
siferry - 4 freq
sppry - 1 freq
MetaPhone code - SPR
spier - 42 freq
supper - 171 freq
spur - 5 freq
speir - 212 freq
spray - 41 freq
spare - 98 freq
spear - 27 freq
super - 36 freq
'speir - 1 freq
'spare' - 2 freq
sipper - 6 freq
spar - 14 freq
sparrae - 3 freq
speer - 21 freq
spair - 1 freq
spry - 3 freq
sper - 1 freq
sparra - 11 freq
spree - 12 freq
spire - 5 freq
záparo - 1 freq
sapphira - 1 freq
sapphire - 1 freq
spoor - 2 freq
€˜spray - 1 freq
sparrow - 5 freq
€œsparra - 1 freq
€˜spier - 1 freq
speir' - 1 freq
€œspare - 1 freq
€œspeir - 1 freq
sapr - 1 freq
sppry - 1 freq
SPPRY
Time to execute Levenshtein function - 0.186436 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.365662 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.030905 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.036806 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.000788 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.