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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
decayed (0) - 1 freq
delayed (1) - 4 freq
declared (2) - 26 freq
decades (2) - 49 freq
debased (2) - 1 freq
decanted (2) - 1 freq
decayit (2) - 2 freq
decreed (2) - 9 freq
debated (2) - 3 freq
decayin (2) - 1 freq
defamed (2) - 1 freq
deaved (2) - 13 freq
decreyed (2) - 1 freq
deceased (2) - 7 freq
decoded (2) - 1 freq
relayed (2) - 1 freq
decay (2) - 11 freq
decade (2) - 30 freq
recawed (2) - 2 freq
decked (2) - 8 freq
decried (2) - 3 freq
decored (2) - 5 freq
decided (2) - 210 freq
deranged (3) - 4 freq
ca'ed (3) - 76 freq
decayed (0) - 1 freq
decade (2) - 30 freq
delayed (2) - 4 freq
decid (3) - 1 freq
decoded (3) - 1 freq
deceased (3) - 7 freq
decked (3) - 8 freq
decored (3) - 5 freq
diced (3) - 4 freq
decided (3) - 210 freq
decreyed (3) - 1 freq
decried (3) - 3 freq
decay (3) - 11 freq
decayit (3) - 2 freq
decades (3) - 49 freq
deaved (3) - 13 freq
decode (3) - 2 freq
decreed (3) - 9 freq
decide (3) - 121 freq
decayin (3) - 1 freq
decait (4) - 2 freq
decaedes (4) - 1 freq
decides (4) - 27 freq
denied (4) - 30 freq
dazed (4) - 4 freq
SoundEx code - D230
dicht - 96 freq
decide - 121 freq
dooked - 12 freq
doocot - 28 freq
dusty - 18 freq
douked - 4 freq
dust - 89 freq
dozed - 8 freq
decade - 30 freq
dist - 18 freq
dowiest - 1 freq
dazed - 4 freq
dogged - 3 freq
doukt - 3 freq
dockside - 9 freq
dookit - 10 freq
dick'd - 1 freq
dished - 10 freq
doused - 2 freq
deeside - 14 freq
dwight - 1 freq
dockhead - 1 freq
dash't - 2 freq
dowsed - 1 freq
docht - 4 freq
dashit - 2 freq
dousit - 1 freq
daoist - 2 freq
doukit - 3 freq
diseyd - 1 freq
deesyde - 1 freq
dukket - 1 freq
deceit - 5 freq
dickhead - 2 freq
duct - 4 freq
dashed - 14 freq
docket - 4 freq
dis't - 4 freq
decked - 8 freq
doacked - 1 freq
dichtt - 1 freq
ducked - 4 freq
dake-the - 1 freq
dost - 39 freq
duckit - 1 freq
deckit - 6 freq
dosed - 2 freq
dighty - 2 freq
doosht - 2 freq
duist - 1 freq
doughty - 3 freq
dish't - 1 freq
deckt - 3 freq
diced - 4 freq
decode - 2 freq
dight - 3 freq
dekkid - 1 freq
deshed - 1 freq
decayed - 1 freq
distie - 1 freq
disyde - 1 freq
dakota - 1 freq
decid - 1 freq
duggid - 1 freq
deeskit - 1 freq
dae-guid - 2 freq
douchty - 3 freq
dockit - 4 freq
duckweed - 1 freq
dossed - 1 freq
decait - 2 freq
dis-the - 1 freq
dochtie - 3 freq
dayset - 5 freq
doosit - 1 freq
daes't - 1 freq
dizzied - 1 freq
dioxide - 2 freq
diskythe - 2 freq
doosed - 1 freq
dog-shite - 1 freq
dasht - 1 freq
doocoot - 1 freq
daisy'd - 1 freq
duguid - 36 freq
docquet - 2 freq
doo-cot - 1 freq
decayit - 2 freq
dukit - 1 freq
dishit - 1 freq
dug-shite - 1 freq
docked - 2 freq
dichit - 1 freq
dogshit - 2 freq
dugged - 1 freq
dtjkiyd - 1 freq
dought - 1 freq
dogscott - 1 freq
‘dogged’ - 1 freq
decht - 1 freq
dzd - 1 freq
dquyda - 1 freq
djkd - 1 freq
dhgate - 1 freq
MetaPhone code - TKYT
decayed - 1 freq
decayit - 2 freq
DECAYED
Time to execute Levenshtein function - 0.281258 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.569099 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.030722 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.040379 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.000870 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.