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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
servt (0) - 1 freq
servit (1) - 8 freq
serve (1) - 72 freq
sert (1) - 2 freq
pert (2) - 60 freq
stret (2) - 1 freq
dernt (2) - 1 freq
eert (2) - 1 freq
seit (2) - 1 freq
serves (2) - 26 freq
bert (2) - 106 freq
serss (2) - 1 freq
semit (2) - 1 freq
meevt (2) - 1 freq
sers (2) - 11 freq
nervy (2) - 5 freq
kervit (2) - 9 freq
serbs (2) - 2 freq
werit (2) - 1 freq
ervo (2) - 2 freq
sterve (2) - 14 freq
ferst (2) - 29 freq
hert (2) - 770 freq
kert (2) - 8 freq
verve (2) - 2 freq
servt (0) - 1 freq
servit (1) - 8 freq
sert (2) - 2 freq
serve (2) - 72 freq
servan (3) - 4 freq
servant (3) - 60 freq
carvt (3) - 1 freq
shivt (3) - 1 freq
reservt (3) - 1 freq
sarve (3) - 10 freq
sort (3) - 310 freq
sertit (3) - 1 freq
serift (3) - 2 freq
servin (3) - 36 freq
served (3) - 75 freq
sirit (3) - 1 freq
servint (3) - 1 freq
srv (3) - 1 freq
server (3) - 2 freq
serves (3) - 26 freq
kervit (3) - 9 freq
kerve (4) - 5 freq
survin (4) - 1 freq
sauvit (4) - 1 freq
salvit (4) - 1 freq
SoundEx code - S613
served - 75 freq
sairved - 4 freq
skreivit - 11 freq
screivit - 83 freq
scraped - 14 freq
scripture - 15 freq
servit - 8 freq
servt - 1 freq
scrievit - 104 freq
script - 30 freq
servetus - 2 freq
screived - 39 freq
sereived - 1 freq
'sherbit - 1 freq
sherbet - 7 freq
shirpit - 2 freq
scrieved - 47 freq
shrovetide - 1 freq
shrift - 2 freq
surveyed - 5 freq
scribed - 1 freq
scrubbed - 6 freq
scrapit - 10 freq
scriptures - 11 freq
scriptorium - 5 freq
scripturs - 4 freq
scriptur - 2 freq
scrift - 2 freq
scraipet - 2 freq
scrappet - 1 freq
scrived - 3 freq
sherp-tuithed - 1 freq
scripted - 2 freq
'served - 1 freq
scruifed - 1 freq
sorbet - 2 freq
scrubbit - 1 freq
swerved - 2 freq
scrubbid - 2 freq
shiropidist - 12 freq
scrabbed - 3 freq
scrïptures - 1 freq
serepta - 1 freq
scrïpture - 1 freq
serviette - 1 freq
sharp-edged - 1 freq
scripter - 6 freq
scriptir - 4 freq
scriptirs - 6 freq
sarepta - 1 freq
scripters - 4 freq
scrievitleid - 1 freq
skribbit - 1 freq
screeved - 2 freq
surreptitiously - 2 freq
servitude - 2 freq
screevit - 3 freq
scrievt - 1 freq
scrybit - 1 freq
scriftin - 4 freq
servitors - 1 freq
serift - 2 freq
scriftit - 2 freq
scriffed - 1 freq
servitours - 1 freq
squarebottle' - 1 freq
scriptur-readin - 1 freq
scrubbit-doon - 1 freq
scripteral - 1 freq
shairp-toothed - 1 freq
scripts - 3 freq
squarebottle - 1 freq
skrievit - 1 freq
schirefdomes - 1 freq
skreived - 2 freq
surfeits - 1 freq
scriptvs - 1 freq
scriped - 1 freq
servitor - 2 freq
scrieved-on - 1 freq
surfeit - 1 freq
€œserved - 1 freq
survation - 4 freq
skript - 1 freq
sharped - 1 freq
sherbets - 1 freq
scriptit - 1 freq
MetaPhone code - SRFT
served - 75 freq
sairved - 4 freq
servit - 8 freq
servt - 1 freq
sereived - 1 freq
s'awright - 1 freq
'served - 1 freq
sawright - 3 freq
serviette - 1 freq
serift - 2 freq
surfeit - 1 freq
€œserved - 1 freq
cerved - 1 freq
sÂ’awright - 1 freq
SERVT
Time to execute Levenshtein function - 0.262176 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.375180 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.037202 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.037504 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.000991 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.