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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
dounreay (0) - 2 freq
dougray (2) - 1 freq
dounby (3) - 3 freq
donkey (3) - 16 freq
dounfaw (3) - 5 freq
dunkey (3) - 19 freq
journay (3) - 3 freq
dourest (3) - 3 freq
dounload (3) - 1 freq
dourly (3) - 16 freq
daursay (3) - 4 freq
counrty (3) - 1 freq
doorway (3) - 17 freq
unreal (3) - 10 freq
douna (3) - 1 freq
unread (3) - 3 freq
dounsets (3) - 1 freq
dourer (3) - 2 freq
doune (3) - 3 freq
roundelay (3) - 1 freq
downey (3) - 1 freq
doucely (3) - 30 freq
doundrag (3) - 1 freq
mounsey (3) - 1 freq
doonbeat (3) - 1 freq
dounreay (0) - 2 freq
dougray (3) - 1 freq
doune (4) - 3 freq
dunira (4) - 3 freq
dooner (4) - 2 freq
douna (4) - 1 freq
dauner (4) - 57 freq
doner (4) - 2 freq
donkey (4) - 16 freq
dourer (4) - 2 freq
dunkey (4) - 19 freq
dounby (4) - 3 freq
donder (5) - 2 freq
duncer (5) - 6 freq
daunered (5) - 20 freq
dynesy (5) - 1 freq
dour (5) - 126 freq
dunse (5) - 1 freq
durer (5) - 1 freq
dunbae (5) - 2 freq
dunky (5) - 1 freq
downer (5) - 1 freq
dooned (5) - 3 freq
dunloy (5) - 4 freq
doenae (5) - 1 freq
SoundEx code - D560
denner - 273 freq
'denner - 2 freq
dauner - 57 freq
deenner - 1 freq
dinner - 140 freq
doun-here - 1 freq
dennir - 29 freq
daunner - 12 freq
dounreay - 2 freq
daenr - 2 freq
dainner - 3 freq
dainer - 5 freq
dunira - 3 freq
'dinner - 3 freq
daenner - 1 freq
dunner - 6 freq
dennèr - 4 freq
dan'er - 1 freq
demur - 1 freq
danner - 13 freq
dannér - 1 freq
dammer - 1 freq
doon-here - 1 freq
daaner - 1 freq
dooner - 2 freq
donor - 7 freq
diner - 1 freq
denar - 1 freq
daun'er - 1 freq
daener - 2 freq
dinnur - 1 freq
deener - 3 freq
denier - 1 freq
duneira - 7 freq
dener - 2 freq
downer - 1 freq
'denier' - 1 freq
donner - 2 freq
doner - 2 freq
MetaPhone code - TNR
denner - 273 freq
'denner - 2 freq
dauner - 57 freq
deenner - 1 freq
dinner - 140 freq
tanner - 10 freq
dennir - 29 freq
daunner - 12 freq
tenure - 4 freq
dounreay - 2 freq
daenr - 2 freq
tenner - 25 freq
dainner - 3 freq
dainer - 5 freq
dunira - 3 freq
'dinner - 3 freq
toner - 1 freq
daenner - 1 freq
dunner - 6 freq
dennèr - 4 freq
ten'er - 1 freq
dan'er - 1 freq
danner - 13 freq
dannér - 1 freq
tenor - 4 freq
tuner - 1 freq
daaner - 1 freq
tonner - 1 freq
dooner - 2 freq
donor - 7 freq
diner - 1 freq
denar - 1 freq
daun'er - 1 freq
daener - 2 freq
dinnur - 1 freq
deener - 3 freq
denier - 1 freq
duneira - 7 freq
tinner - 1 freq
tenior - 1 freq
dener - 2 freq
downer - 1 freq
'denier' - 1 freq
donner - 2 freq
doner - 2 freq
DOUNREAY
Time to execute Levenshtein function - 0.404142 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.666262 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.029979 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.084782 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.000864 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.