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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
skrievar (0) - 3 freq
skrieve (2) - 5 freq
skreivar (2) - 18 freq
skreever (2) - 4 freq
scriever (2) - 60 freq
skrieves (2) - 3 freq
scrievan (2) - 1 freq
skrievit (2) - 1 freq
scrievars (2) - 1 freq
scrievt (3) - 1 freq
skrie (3) - 1 freq
serievin (3) - 2 freq
skreekan (3) - 1 freq
stiever (3) - 1 freq
scrieve (3) - 166 freq
siecar (3) - 1 freq
skreivars (3) - 16 freq
scrieved (3) - 46 freq
skier (3) - 2 freq
riever (3) - 2 freq
scrieven (3) - 2 freq
serieve (3) - 3 freq
siever (3) - 2 freq
skrekan (3) - 3 freq
surveyar (3) - 1 freq
skrievar (0) - 3 freq
skreever (2) - 4 freq
skreivar (2) - 18 freq
skreiver (3) - 3 freq
skrievit (3) - 1 freq
skrieves (3) - 3 freq
skrieve (3) - 5 freq
scriever (3) - 60 freq
surveyar (4) - 1 freq
screivar (4) - 27 freq
skreivars (4) - 16 freq
scrievars (4) - 1 freq
screever (4) - 1 freq
scrievan (4) - 1 freq
skriech (5) - 3 freq
scrievit (5) - 102 freq
scrievers (5) - 25 freq
skreivin (5) - 16 freq
screiver (5) - 8 freq
skreivit (5) - 11 freq
skreived (5) - 2 freq
server (5) - 2 freq
skairer (5) - 1 freq
skirr (5) - 1 freq
skreive (5) - 9 freq
SoundEx code - S616
surprise - 207 freq
scrapyaird - 2 freq
surprised - 152 freq
surpreese - 11 freq
skreivar - 18 freq
skreivars - 16 freq
surprisingly - 8 freq
surpreise - 6 freq
surpreesed - 7 freq
scriever - 60 freq
scarpered - 3 freq
surpreeze - 1 freq
scrievers - 25 freq
surprisinly - 4 freq
scarper - 2 freq
surprises - 11 freq
scraper - 2 freq
surprisin - 17 freq
skreever - 4 freq
screever - 1 freq
serperate - 1 freq
screivers' - 1 freq
sirprise - 5 freq
sirprises - 1 freq
screivers - 33 freq
surprisan - 1 freq
scriever's - 2 freq
surprisinlie - 4 freq
screiver - 8 freq
scarborough - 1 freq
surfer - 1 freq
sirprisin - 2 freq
sirprised - 5 freq
sirprisinly - 1 freq
screivars - 43 freq
screivar - 27 freq
screivar's - 1 freq
surpreisin - 1 freq
surpreised - 5 freq
skreivar's - 1 freq
shairper - 2 freq
sairvers - 1 freq
surprising - 7 freq
sair-braithed - 1 freq
sharp-hertit - 1 freq
sair-affrontit - 1 freq
sherper - 2 freq
surprenant - 1 freq
servers - 1 freq
skreiver - 3 freq
srebrenisa - 1 freq
skrievar - 3 freq
scrievars - 1 freq
sure-fire - 1 freq
sharper - 1 freq
sherbert - 1 freq
server - 2 freq
surveyar - 1 freq
surpreises - 1 freq
surprized - 1 freq
surprísed - 1 freq
surefire - 1 freq
squarebreeks - 1 freq
surprehz - 1 freq
scriever-musicians - 1 freq
scrievership - 10 freq
scrieverly - 3 freq
skerryvore - 3 freq
sreporter - 1 freq
MetaPhone code - SKRFR
skreivar - 18 freq
scriever - 60 freq
skreever - 4 freq
screever - 1 freq
screiver - 8 freq
screivar - 27 freq
skreiver - 3 freq
skrievar - 3 freq
skerryvore - 3 freq
SKRIEVAR
Time to execute Levenshtein function - 0.477085 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.885585 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.030206 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.087765 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.000855 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.