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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
dougburnett (0) - 2 freq
colinburnett (4) - 28 freq
burnett (4) - 14 freq
burnet (5) - 2 freq
dourest (5) - 3 freq
doubleness (5) - 2 freq
sunburnt (5) - 3 freq
doughnuts (5) - 8 freq
deanbrett (5) - 7 freq
dunnett (5) - 6 freq
dourness (5) - 4 freq
doughnut (5) - 7 freq
caroleburnett (5) - 1 freq
outburst (5) - 2 freq
dounturn (5) - 1 freq
barnett (5) - 1 freq
cornet (6) - 4 freq
dunnet (6) - 1 freq
grett (6) - 34 freq
bunnet' (6) - 2 freq
osbourne (6) - 1 freq
dunfounert (6) - 1 freq
daurnt (6) - 1 freq
cornert (6) - 1 freq
couriet (6) - 1 freq
dougburnett (0) - 2 freq
burnett (6) - 14 freq
deanbrett (7) - 7 freq
barnett (7) - 1 freq
colinburnett (7) - 28 freq
degerent (8) - 1 freq
caroleburnett (8) - 1 freq
gubernt (8) - 1 freq
dunnett (8) - 6 freq
doughnut (8) - 7 freq
burnet (8) - 2 freq
sunburnt (8) - 3 freq
doughnuts (8) - 8 freq
gubernment (9) - 1 freq
baabennett (9) - 1 freq
burnit (9) - 1 freq
barnet (9) - 3 freq
grantt (9) - 1 freq
barrett (9) - 1 freq
gruntet (9) - 4 freq
garnet (9) - 1 freq
governent (9) - 1 freq
brunette (9) - 3 freq
dumbfoonert (9) - 1 freq
burnfit (9) - 10 freq
SoundEx code - D216
disappear - 44 freq
disappeared - 54 freq
disappearin - 31 freq
disappears - 18 freq
discovery - 21 freq
desperate - 91 freq
despair - 58 freq
despairinly - 1 freq
disappeart - 43 freq
dayspring - 1 freq
discovers - 2 freq
disappearance - 7 freq
discovert - 19 freq
discover - 31 freq
disperse - 3 freq
desperation - 20 freq
dispert - 2 freq
dispraise - 3 freq
discovered - 40 freq
disparagin - 2 freq
disproportionately - 1 freq
diasporas - 1 freq
disappear't - 1 freq
despaired - 2 freq
deceiver - 2 freq
disappearit - 3 freq
dispersit - 1 freq
discuvert - 1 freq
dessapeert - 1 freq
deesapeert - 1 freq
disapeeren - 1 freq
decipher - 4 freq
despert - 4 freq
desperately - 29 freq
desperados - 3 freq
dispersed - 4 freq
deceiverie - 2 freq
despirt - 1 freq
desperate-leukin - 1 freq
disbarrin - 1 freq
disparate - 2 freq
disappeird - 3 freq
disappruve - 1 freq
desperadoes - 1 freq
despertly - 1 freq
discoverin - 3 freq
discoverland - 1 freq
diaspora - 28 freq
desprait - 2 freq
'desprait - 1 freq
discoveries - 4 freq
'discovered - 1 freq
discovry - 1 freq
disapproval - 2 freq
dispure - 1 freq
discoveran - 1 freq
disparaged - 4 freq
dispersal - 1 freq
disportin - 1 freq
diskivert - 3 freq
doggy-friend - 1 freq
desprit - 3 freq
discoverin' - 1 freq
discuivert - 1 freq
disparity - 2 freq
dispair - 1 freq
disappeard - 1 freq
despare - 2 freq
dispare - 1 freq
diskivvert - 1 freq
dispern - 1 freq
€˜disperse - 1 freq
discoverie - 1 freq
disperses - 1 freq
dashboard - 3 freq
disapprovin - 2 freq
discovering - 1 freq
dykefur - 1 freq
dizappear - 1 freq
disparately - 1 freq
disproportionate - 1 freq
dissappear - 1 freq
dissapearin - 1 freq
diskiveran - 1 freq
dkgfrhy - 1 freq
disapproving - 1 freq
dougburnett - 2 freq
dissappeared - 1 freq
diskivered - 1 freq
dcfrqtoea - 1 freq
dajvr - 1 freq
discoverkelpies - 5 freq
ducksaberlady - 1 freq
MetaPhone code - TKBRNT
dougburnett - 2 freq
DOUGBURNETT
Time to execute Levenshtein function - 0.207583 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.458376 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.033230 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.038523 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.000809 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.