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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
dissent (0) - 8 freq
dissect (1) - 4 freq
lissen (2) - 10 freq
dissing (2) - 1 freq
bisset (2) - 4 freq
dispert (2) - 2 freq
wisset (2) - 1 freq
disstunt (2) - 1 freq
distant (2) - 53 freq
diacent (2) - 1 freq
misspent (2) - 2 freq
wissett (2) - 1 freq
lisent (2) - 1 freq
discernt (2) - 1 freq
assent (2) - 2 freq
kirsent (2) - 2 freq
dissentit (2) - 1 freq
krissent (2) - 1 freq
disnt (2) - 1 freq
descent (2) - 13 freq
dessert (2) - 4 freq
listent (2) - 10 freq
aisment (2) - 1 freq
dissydent (2) - 1 freq
lissens (2) - 2 freq
dissent (0) - 8 freq
dissect (2) - 4 freq
descent (3) - 13 freq
dissentit (3) - 1 freq
dessert (3) - 4 freq
disnt (3) - 1 freq
dissydent (3) - 1 freq
pissant (3) - 1 freq
dissenter (3) - 1 freq
dassen (3) - 28 freq
assent (3) - 2 freq
dissing (3) - 1 freq
distant (3) - 53 freq
disstunt (3) - 1 freq
dossing (4) - 1 freq
dismount (4) - 1 freq
doesnt (4) - 2 freq
designt (4) - 1 freq
dossin (4) - 3 freq
missen (4) - 3 freq
fassont (4) - 1 freq
dassin (4) - 23 freq
dessirt (4) - 1 freq
assint (4) - 1 freq
discount (4) - 5 freq
SoundEx code - D253
doesn't - 22 freq
doughnut - 7 freq
dacent - 14 freq
decent - 112 freq
descends - 8 freq
descendit - 11 freq
daicent - 60 freq
dysentery - 1 freq
descend - 14 freq
descendin - 11 freq
discontent - 5 freq
dozent - 6 freq
dignity - 29 freq
descentants - 1 freq
dissenters - 2 freq
dismayed - 6 freq
descendants - 12 freq
dazent - 1 freq
deesint - 2 freq
descent - 13 freq
dishauntit - 2 freq
disintegratit - 1 freq
disinterested - 3 freq
dissentérs - 2 freq
dissent - 8 freq
dookin-huts - 1 freq
daesant - 1 freq
disinterestit - 1 freq
discount - 5 freq
dacant - 1 freq
disn't - 4 freq
'decent - 1 freq
descending - 2 freq
doughnuts - 8 freq
doughnuts' - 1 freq
descended - 6 freq
daecent - 8 freq
'decent' - 1 freq
disinterest - 1 freq
discentioun - 1 freq
deuk-and-goose - 1 freq
dissenter - 1 freq
decimated - 1 freq
dizzenth - 1 freq
descendents - 3 freq
deigned - 1 freq
dishaunts - 1 freq
decendant - 1 freq
decendants - 2 freq
disinterrt - 1 freq
dignitie - 2 freq
disintegrated - 2 freq
descendant - 3 freq
decent-lookin - 1 freq
discontentment - 1 freq
dignit - 1 freq
deckhand - 1 freq
discontinuously - 1 freq
disintegraetion - 1 freq
duecento - 1 freq
disjointed - 1 freq
descendent - 4 freq
dissentit - 1 freq
disentanglet - 1 freq
deegnity - 2 freq
decanted - 1 freq
dwqndlbcao - 1 freq
docandrewmurray - 2 freq
diacent - 1 freq
doesn’t - 7 freq
doughendricks - 1 freq
dognduck - 1 freq
disnt - 1 freq
dzintrasullivan - 1 freq
doesnt - 2 freq
MetaPhone code - TSNT
doesn't - 22 freq
dacent - 14 freq
decent - 112 freq
daicent - 60 freq
designed - 33 freq
descend - 14 freq
dozent - 6 freq
dazent - 1 freq
deesint - 2 freq
descent - 13 freq
dissent - 8 freq
daesant - 1 freq
disn't - 4 freq
'decent - 1 freq
daecent - 8 freq
'decent' - 1 freq
duecento - 1 freq
diacent - 1 freq
doesn’t - 7 freq
disnt - 1 freq
doesnt - 2 freq
DISSENT
Time to execute Levenshtein function - 0.187809 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.363097 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.027488 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.037012 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.000841 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.