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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
seffer (0) - 1 freq
suffer (1) - 58 freq
siffer (1) - 3 freq
heffer (1) - 2 freq
seeker (2) - 2 freq
seeger (2) - 1 freq
sewer (2) - 4 freq
seller (2) - 11 freq
effeir (2) - 1 freq
hefner (2) - 1 freq
sever (2) - 3 freq
sexier (2) - 1 freq
saifer (2) - 3 freq
seer (2) - 39 freq
suffert (2) - 9 freq
seater (2) - 1 freq
niffer (2) - 7 freq
effert (2) - 1 freq
gaffer (2) - 35 freq
'efter (2) - 5 freq
suffers (2) - 7 freq
seerer (2) - 1 freq
waffer (2) - 1 freq
affer (2) - 2 freq
heefer (2) - 1 freq
seffer (0) - 1 freq
suffer (1) - 58 freq
siffer (1) - 3 freq
suiffer (2) - 1 freq
heffer (2) - 2 freq
deiffer (3) - 2 freq
puffer (3) - 1 freq
sniffer (3) - 3 freq
safter (3) - 10 freq
duffer (3) - 6 freq
surfer (3) - 1 freq
saffen (3) - 1 freq
softer (3) - 4 freq
spaffer (3) - 1 freq
oaffer (3) - 2 freq
differ (3) - 135 freq
suffre (3) - 1 freq
iffer (3) - 1 freq
saufer (3) - 2 freq
offer (3) - 177 freq
affer (3) - 2 freq
buffer (3) - 2 freq
safer (3) - 18 freq
scaffer (3) - 1 freq
saifer (3) - 3 freq
SoundEx code - S160
spier - 42 freq
supper - 173 freq
siberia - 5 freq
shipraw - 1 freq
spur - 5 freq
shiver - 35 freq
s'faur - 1 freq
speir - 214 freq
spray - 42 freq
spare - 100 freq
spear - 28 freq
super - 37 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 - 31 freq
suffer - 58 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
sub-par - 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 - SFR
s'faur - 1 freq
safer - 18 freq
severe - 15 freq
zephyr - 2 freq
suffer - 58 freq
savoury - 1 freq
syver - 4 freq
saviour - 14 freq
savour - 18 freq
saifer - 3 freq
siver - 2 freq
sphere - 14 freq
safari - 2 freq
sever - 3 freq
'safari - 3 freq
siffer - 3 freq
'sphere - 1 freq
sphere' - 1 freq
savory - 1 freq
saufer - 2 freq
seffer - 1 freq
siever - 2 freq
suiffer - 1 freq
suffre - 1 freq
cipher - 1 freq
sauviour - 1 freq
saufier - 1 freq
sover - 1 freq
€˜suffer - 1 freq
siferry - 4 freq
zyvre - 1 freq
xfhywr - 1 freq
SEFFER
Time to execute Levenshtein function - 0.200576 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.398138 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.028390 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.039450 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.000873 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.