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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
scraped (0) - 13 freq
scrape (1) - 29 freq
scriped (1) - 1 freq
scraper (1) - 2 freq
scrapes (1) - 10 freq
screwed (2) - 30 freq
scrake (2) - 1 freq
scalped (2) - 3 freq
scape (2) - 1 freq
scrae (2) - 1 freq
scrappet (2) - 1 freq
shaped (2) - 34 freq
scripted (2) - 2 freq
scraaled (2) - 1 freq
caped (2) - 2 freq
scrapit (2) - 10 freq
strayed (2) - 8 freq
scrowed (2) - 2 freq
stoaped (2) - 15 freq
screed (2) - 31 freq
stramped (2) - 8 freq
draped (2) - 16 freq
scrawled (2) - 4 freq
scranned (2) - 4 freq
scraps (2) - 22 freq
scraped (0) - 13 freq
scriped (1) - 1 freq
scrapes (2) - 10 freq
scraper (2) - 2 freq
scrape (2) - 29 freq
scoped (3) - 1 freq
scrimed (3) - 2 freq
scribed (3) - 1 freq
screed (3) - 31 freq
scraps (3) - 22 freq
scowped (3) - 1 freq
scrap (3) - 33 freq
screamed (3) - 38 freq
scrived (3) - 2 freq
escaped (3) - 28 freq
scrappy (3) - 4 freq
scrapin (3) - 19 freq
scared (3) - 44 freq
scrapit (3) - 10 freq
scraipet (3) - 2 freq
scrapan (3) - 2 freq
striped (3) - 7 freq
scalped (3) - 3 freq
screwed (3) - 30 freq
scrowed (3) - 2 freq
SoundEx code - S613
served - 73 freq
sairved - 4 freq
skreivit - 11 freq
screivit - 80 freq
scraped - 13 freq
scripture - 15 freq
servit - 8 freq
servt - 1 freq
scrievit - 102 freq
script - 30 freq
servetus - 2 freq
screived - 39 freq
sereived - 1 freq
'sherbit - 1 freq
sherbet - 6 freq
shirpit - 2 freq
scrieved - 46 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
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
scrived - 2 freq
€œserved - 1 freq
survation - 4 freq
skript - 1 freq
sharped - 1 freq
sherbets - 1 freq
scriptit - 1 freq
MetaPhone code - SKRPT
scraped - 13 freq
script - 30 freq
scrapit - 10 freq
scraipet - 2 freq
scrappet - 1 freq
scriped - 1 freq
skript - 1 freq
SCRAPED
Time to execute Levenshtein function - 0.205610 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.357170 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.027419 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.038896 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.000847 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.