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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
decoratet (0) - 2 freq
decorated (1) - 13 freq
decoratit (1) - 7 freq
decorate (1) - 5 freq
decoratin (2) - 6 freq
decorator (2) - 1 freq
decorative (3) - 2 freq
desolate (3) - 3 freq
declaret (3) - 1 freq
decore (3) - 1 freq
coatet (3) - 3 freq
decimated (3) - 1 freq
decorement (3) - 1 freq
decoratin' (3) - 4 freq
deportit (3) - 1 freq
decora (3) - 1 freq
separatet (3) - 1 freq
dehydratet (3) - 1 freq
decored (3) - 5 freq
decoration (3) - 4 freq
debated (4) - 3 freq
denigrate (4) - 2 freq
retorted (4) - 5 freq
decait (4) - 2 freq
declaart (4) - 1 freq
decoratet (0) - 2 freq
decoratit (1) - 7 freq
decorate (2) - 5 freq
decorated (2) - 13 freq
decorator (3) - 1 freq
decoratin (3) - 6 freq
deportit (4) - 1 freq
decoration (4) - 4 freq
decorative (4) - 2 freq
laceratit (5) - 1 freq
declaret (5) - 1 freq
departit (5) - 5 freq
decreets (5) - 2 freq
curatit (5) - 1 freq
desertit (5) - 7 freq
decreeit (5) - 1 freq
recreatit (5) - 1 freq
decairt (5) - 1 freq
escortit (5) - 2 freq
decored (5) - 5 freq
decorement (5) - 1 freq
decimated (5) - 1 freq
coatet (5) - 3 freq
decore (5) - 1 freq
decoratin' (5) - 4 freq
SoundEx code - D263
desert - 60 freq
duckworth - 3 freq
deserts - 8 freq
decorative - 2 freq
desertit - 7 freq
dishertent - 2 freq
decreed - 9 freq
decried - 3 freq
dysarts - 1 freq
desirit - 3 freq
dysart - 8 freq
dessert - 4 freq
discreet - 5 freq
dysart's - 1 freq
discarded - 2 freq
desired - 12 freq
disorder - 7 freq
decorated - 13 freq
descartes - 3 freq
discardin - 4 freq
decoratit - 7 freq
discretion - 7 freq
desertin - 2 freq
decreeit - 1 freq
deserted - 5 freq
decoratet - 2 freq
deserters - 2 freq
decorations - 12 freq
disorders - 1 freq
docherty - 10 freq
decoratin - 6 freq
decoratin' - 4 freq
discardit - 3 freq
dishworth's - 1 freq
disordert - 2 freq
decored - 5 freq
decoration - 4 freq
decorate - 5 freq
dug-eared - 1 freq
discards - 1 freq
discrete - 3 freq
disorder's - 1 freq
discord - 5 freq
doosrytanjoch - 1 freq
desertion - 2 freq
dockyaird - 1 freq
decreets - 2 freq
descartes' - 1 freq
dishworth - 1 freq
diacritics - 5 freq
diacritic - 3 freq
degradin - 3 freq
dischort - 1 freq
deserred - 2 freq
dessirt - 1 freq
discreetly - 2 freq
decairt - 1 freq
discaird - 1 freq
discairdit - 1 freq
dishertit - 1 freq
decreyed - 1 freq
dockyerds - 2 freq
decorator - 1 freq
degrade - 1 freq
degradation - 1 freq
discard - 1 freq
desiret - 1 freq
discreetlie - 1 freq
desseruit - 1 freq
deseruit - 1 freq
disheartenin - 1 freq
€œdiscreditable - 1 freq
dtyxrdnqkw - 1 freq
dgordonhack - 1 freq
discord nou - 1 freq
dgartsfest - 4 freq
MetaPhone code - TKRTT
decorated - 13 freq
decoratit - 7 freq
decoratet - 2 freq
DECORATET
Time to execute Levenshtein function - 0.237071 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.401768 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.027770 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.038234 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.000947 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.