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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
desirit (0) - 3 freq
desiret (1) - 1 freq
desprit (1) - 3 freq
despirt (2) - 1 freq
desertit (2) - 7 freq
sepirit (2) - 1 freq
delitit (2) - 3 freq
desire (2) - 50 freq
desire' (2) - 1 freq
decidit (2) - 103 freq
desydit (2) - 1 freq
beirit (2) - 1 freq
designt (2) - 1 freq
desert (2) - 59 freq
desir (2) - 1 freq
deficit (2) - 10 freq
desires (2) - 10 freq
dessirt (2) - 1 freq
desiree (2) - 1 freq
desired (2) - 12 freq
deseruit (2) - 1 freq
weirit (2) - 1 freq
definit (2) - 3 freq
devisit (2) - 4 freq
retirit (2) - 3 freq
desirit (0) - 3 freq
desiret (1) - 1 freq
deseruit (2) - 1 freq
desert (2) - 59 freq
desprit (2) - 3 freq
desired (3) - 12 freq
desiree (3) - 1 freq
dessirt (3) - 1 freq
desist (3) - 1 freq
dysart (3) - 8 freq
deleirit (3) - 1 freq
desires (3) - 10 freq
desprait (3) - 2 freq
deservit (3) - 3 freq
sirit (3) - 1 freq
desire' (3) - 1 freq
desertit (3) - 7 freq
desire (3) - 50 freq
desydit (3) - 1 freq
despirt (3) - 1 freq
desir (3) - 1 freq
deesint (4) - 2 freq
depairt (4) - 12 freq
dessert (4) - 4 freq
despite (4) - 97 freq
SoundEx code - D263
desert - 59 freq
duckworth - 3 freq
deserts - 8 freq
decorative - 2 freq
desertit - 7 freq
dishertent - 2 freq
decreed - 8 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 - TSRT
desert - 59 freq
desirit - 3 freq
dysart - 8 freq
dessert - 4 freq
desired - 12 freq
tasered - 1 freq
deserred - 2 freq
dessirt - 1 freq
desiret - 1 freq
desseruit - 1 freq
deseruit - 1 freq
DESIRIT
Time to execute Levenshtein function - 0.215337 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.668999 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.027717 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.081113 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.000822 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.