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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
scratching (0) - 1 freq
scratchin (1) - 26 freq
scratchin' (1) - 2 freq
scratchings (1) - 2 freq
stretching (2) - 7 freq
scathing (2) - 1 freq
scraitchin (2) - 2 freq
scraichin (2) - 8 freq
scratchan (2) - 4 freq
seratchin (2) - 2 freq
skratchin (2) - 1 freq
scratchit (2) - 1 freq
screeching (2) - 3 freq
scrauchin (2) - 2 freq
catching (2) - 8 freq
scrauchlin (3) - 1 freq
stitching (3) - 1 freq
searching (3) - 2 freq
scraping (3) - 2 freq
scratchy (3) - 47 freq
scrattins (3) - 1 freq
watching (3) - 79 freq
swatchin (3) - 1 freq
crashing (3) - 2 freq
scratchy'd (3) - 1 freq
scratching (0) - 1 freq
scratchin (2) - 26 freq
scratchings (2) - 2 freq
scratchin' (2) - 2 freq
scratchan (3) - 4 freq
screeching (3) - 3 freq
scraitchin (3) - 2 freq
stretching (3) - 7 freq
scrauchin (4) - 2 freq
catching (4) - 8 freq
screetchin (4) - 1 freq
scorching (4) - 1 freq
scratchit (4) - 1 freq
scathing (4) - 1 freq
seratchin (4) - 2 freq
scraichin (4) - 8 freq
skratchin (4) - 1 freq
scratches (5) - 4 freq
scratchy's (5) - 7 freq
screechin' (5) - 1 freq
screichin (5) - 8 freq
skretchin (5) - 1 freq
scutchin (5) - 1 freq
stritchin (5) - 1 freq
switching (5) - 5 freq
SoundEx code - S632
short-cut - 1 freq
skrieds - 1 freq
soarts - 12 freq
seratchin - 2 freq
shairds - 5 freq
skirts - 26 freq
scratcht - 1 freq
scarts - 9 freq
scratchin - 26 freq
shorts - 40 freq
sorts - 70 freq
swuirds - 6 freq
swaird-scaurs - 1 freq
scratch - 51 freq
skirt-suit - 1 freq
shards - 11 freq
scratched - 17 freq
squirts - 1 freq
skarts - 3 freq
scratchy - 47 freq
scratchy's - 7 freq
'scratchy - 4 freq
scratchy'd - 1 freq
skretchin - 1 freq
swords - 36 freq
shortcut - 4 freq
shirts - 19 freq
scraitch - 1 freq
shreds - 7 freq
swordis - 2 freq
scratchcard - 2 freq
scratchcards - 1 freq
screeds - 13 freq
screetched - 1 freq
scraat's - 1 freq
soorts - 2 freq
scratchings - 2 freq
swordsman's - 1 freq
shoartcut - 1 freq
screetchin - 1 freq
soartsae - 1 freq
sortsae - 1 freq
sherds - 2 freq
soor-dook - 1 freq
short-sichtit - 1 freq
scratches - 4 freq
scratchan - 4 freq
shortcomes - 1 freq
swordsman - 3 freq
scortish - 1 freq
scratchit - 1 freq
skratchin - 1 freq
scraitchin - 2 freq
skreids - 6 freq
shortage - 6 freq
scratcher - 13 freq
swoords - 2 freq
scairts - 1 freq
shirt's - 2 freq
skirt's - 1 freq
skywards - 2 freq
schortsum - 1 freq
swordsmen - 1 freq
scart-scart-scartin - 1 freq
skritts - 1 freq
'shoarts' - 1 freq
shoarts - 3 freq
shortsome - 2 freq
shroods - 2 freq
swurds - 2 freq
screids - 5 freq
scraitched - 1 freq
shoreheids - 1 freq
scraitchers - 1 freq
shirtsleeves - 1 freq
short-sichted - 2 freq
skratcher - 1 freq
schort-cums - 1 freq
sour-dook - 1 freq
seawards - 1 freq
shortages - 1 freq
shortcomins - 1 freq
screetch - 1 freq
screed's - 1 freq
skywarts - 1 freq
scratchin' - 2 freq
scourhieds - 1 freq
sarts - 1 freq
shortest - 1 freq
soordook - 1 freq
scratching - 1 freq
sarahduce - 4 freq
shortcake - 1 freq
srteixo - 2 freq
shrouds - 1 freq
‘s-hertogenbosch - 1 freq
scritch - 1 freq
scaredy-cat - 1 freq
MetaPhone code - SKRXNK
screeching - 3 freq
scratching - 1 freq
scorching - 1 freq
SCRATCHING
Time to execute Levenshtein function - 0.252390 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.522583 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.031999 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.040939 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.001013 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.