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 sonsie

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to deceivenie in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
deceivenie (0) - 2 freq
deceiverie (1) - 2 freq
deleiverie (2) - 1 freq
deceiver (3) - 2 freq
deleiverit (3) - 1 freq
deleeverie (3) - 1 freq
deceivit (3) - 1 freq
deceive (3) - 7 freq
deceivin (3) - 1 freq
deleiverin (3) - 1 freq
deceived (3) - 2 freq
deleiverlie (3) - 1 freq
steivenin (4) - 1 freq
receiver (4) - 4 freq
decline (4) - 21 freq
deleiver (4) - 4 freq
decernis (4) - 1 freq
declinin (4) - 1 freq
seiventie (4) - 8 freq
steivelie (4) - 2 freq
receive (4) - 21 freq
deleivert (4) - 6 freq
received (4) - 53 freq
seeventie (4) - 1 freq
receives (4) - 3 freq
deceivenie (0) - 2 freq
deceiverie (2) - 2 freq
deceivin (3) - 1 freq
deleiverie (4) - 1 freq
deceiver (4) - 2 freq
deceive (4) - 7 freq
deceivit (4) - 1 freq
deceived (4) - 2 freq
decline (5) - 21 freq
decidein (5) - 1 freq
deleiverin (5) - 1 freq
receivin (5) - 7 freq
deleeverie (5) - 1 freq
dcein (6) - 1 freq
divine (6) - 29 freq
civuni (6) - 1 freq
decin (6) - 2 freq
recoverie (6) - 1 freq
devine (6) - 3 freq
deivin (6) - 1 freq
eleiven (6) - 15 freq
deleeverin (6) - 1 freq
receivit (6) - 3 freq
destinie (6) - 3 freq
deivan (6) - 1 freq
SoundEx code - D215
despond - 1 freq
disappyntment - 9 freq
disappynted - 1 freq
disappyntit - 20 freq
diazepam - 1 freq
disappointed - 19 freq
dispone - 2 freq
disappintit - 6 freq
disappointit - 5 freq
dispensin - 2 freq
deceivin - 1 freq
doo-chuffin'-lally - 1 freq
disappoint - 4 freq
dissapeyntmint - 1 freq
dissappointed - 1 freq
disappointment - 13 freq
disappintmint - 3 freq
disfunctional - 1 freq
disappointet - 1 freq
disappynt - 5 freq
disappyntmint - 2 freq
disappoynt - 1 freq
disappointin' - 1 freq
dispensary - 1 freq
dispensing - 1 freq
dispenses - 1 freq
disappointed' - 1 freq
disappintment - 1 freq
disappyntin - 5 freq
dispensation' - 1 freq
dispenser - 1 freq
deceivenie - 2 freq
disobeyin - 1 freq
dysfunctions - 1 freq
disapinted - 1 freq
disband - 2 freq
despondent - 1 freq
dispensed - 1 freq
disbanded - 2 freq
disapyntin - 1 freq
dissapyntin - 1 freq
€˜disappyntit - 1 freq
€˜disappointed - 1 freq
€œdispone - 1 freq
dispensible - 1 freq
dougchapmansnp - 1 freq
dysfunctional - 1 freq
disappointing - 3 freq
dissapintin - 1 freq
disapintinÂ’ - 1 freq
disapointit - 1 freq
disappointments - 1 freq
dzpm - 1 freq
dcbmcmot - 1 freq
dissapointing - 1 freq
MetaPhone code - TSFN
deceivin - 1 freq
deceivenie - 2 freq
DECEIVENIE
Time to execute Levenshtein function - 0.246130 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.413864 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.029610 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.040464 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.000898 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.