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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
descend (0) - 14 freq
descends (1) - 9 freq
descent (1) - 13 freq
despond (2) - 1 freq
descendin (2) - 11 freq
resend (2) - 1 freq
desmond (2) - 3 freq
descended (2) - 6 freq
depend (2) - 16 freq
denend (2) - 1 freq
descency (2) - 1 freq
ascend (2) - 7 freq
descendit (2) - 11 freq
defend (2) - 23 freq
decent (2) - 116 freq
deseen (2) - 1 freq
deshed (2) - 1 freq
decency (3) - 10 freq
respond (3) - 24 freq
deken (3) - 4 freq
desine (3) - 1 freq
dosena (3) - 1 freq
disband (3) - 2 freq
dowpend (3) - 1 freq
dysted (3) - 1 freq
descend (0) - 14 freq
descent (2) - 13 freq
descends (2) - 9 freq
ascend (3) - 7 freq
descendit (3) - 11 freq
descended (3) - 6 freq
descency (3) - 1 freq
desmond (3) - 3 freq
descendin (3) - 11 freq
despond (3) - 1 freq
discerned (4) - 2 freq
disband (4) - 2 freq
destined (4) - 12 freq
descyded (4) - 1 freq
seecond (4) - 1 freq
discard (4) - 1 freq
secund (4) - 1 freq
designed (4) - 34 freq
second (4) - 390 freq
secind (4) - 1 freq
seicond (4) - 1 freq
discenin (4) - 1 freq
deshed (4) - 1 freq
defend (4) - 23 freq
denend (4) - 1 freq
SoundEx code - D253
doesn't - 22 freq
doughnut - 7 freq
dacent - 14 freq
decent - 116 freq
descends - 9 freq
descendit - 11 freq
daicent - 60 freq
dysentery - 1 freq
descend - 14 freq
descendin - 11 freq
discontent - 5 freq
dozent - 6 freq
dignity - 30 freq
descentants - 1 freq
dissenters - 2 freq
dismayed - 6 freq
descendants - 12 freq
dazent - 1 freq
deesint - 2 freq
descent - 13 freq
descending - 3 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
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 - 116 freq
daicent - 60 freq
designed - 34 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
DESCEND
Time to execute Levenshtein function - 0.521321 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.972390 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.030545 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.091585 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.000886 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.