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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
duncan (0) - 99 freq
duncin (1) - 23 freq
duncans (1) - 1 freq
dauncan (1) - 1 freq
dancan (1) - 8 freq
aduncan (1) - 42 freq
uncan (1) - 57 freq
dancean (2) - 3 freq
duntin (2) - 24 freq
dancin (2) - 138 freq
dunkin (2) - 2 freq
uncans (2) - 4 freq
bunlan (2) - 1 freq
dungen (2) - 1 freq
dunces (2) - 5 freq
duntn (2) - 1 freq
huntan (2) - 4 freq
dun-in (2) - 1 freq
dunstan (2) - 1 freq
runnan (2) - 25 freq
dauncin (2) - 28 freq
dingan (2) - 2 freq
dunced (2) - 10 freq
unecan (2) - 1 freq
dunc (2) - 4 freq
duncan (0) - 99 freq
aduncan (1) - 42 freq
dancan (1) - 8 freq
dauncan (1) - 1 freq
duncin (1) - 23 freq
dauncin (2) - 28 freq
dancin (2) - 138 freq
dancean (2) - 3 freq
duncans (2) - 1 freq
uncan (2) - 57 freq
dunna (3) - 159 freq
dunch (3) - 27 freq
dunn (3) - 8 freq
mincan (3) - 1 freq
dunlin (3) - 2 freq
dunchin (3) - 5 freq
duncing (3) - 3 freq
dunjin (3) - 1 freq
danceen (3) - 4 freq
dunc (3) - 4 freq
dunnae (3) - 3 freq
dunce (3) - 27 freq
denyan (3) - 2 freq
dansan (3) - 10 freq
duncer (3) - 6 freq
SoundEx code - D525
dauncin - 28 freq
dancin - 138 freq
donsieness - 1 freq
dingin - 59 freq
doun-come - 1 freq
'dancing - 1 freq
dancing - 31 freq
dangin - 1 freq
dungeon - 7 freq
dinkin-up - 1 freq
dungeons - 5 freq
duncan - 99 freq
diansangu - 1 freq
duncin - 23 freq
dungannon - 1 freq
dancean - 3 freq
dennison - 10 freq
danceen - 4 freq
dunjin - 1 freq
dansin - 14 freq
danson - 1 freq
donkey-engine - 1 freq
dancan - 8 freq
dunkin - 2 freq
din-skinnt - 1 freq
denizens - 1 freq
dunnichen - 1 freq
dancin's - 1 freq
dingyin - 1 freq
duncansby - 1 freq
dingan - 2 freq
dunchin - 5 freq
danssin - 2 freq
dansan - 10 freq
dinsome - 3 freq
duncans - 1 freq
dancin' - 4 freq
dauncan - 1 freq
dung-midden - 1 freq
doungang - 1 freq
douncome - 2 freq
dungen - 1 freq
duncan's - 1 freq
demission - 2 freq
doungaun - 2 freq
dimínishin - 1 freq
daunce-mask - 1 freq
demissioun - 1 freq
damagin - 3 freq
dinghiein - 1 freq
damaging - 1 freq
denizen - 1 freq
dancin-cunning - 1 freq
demesne - 1 freq
damascene - 1 freq
densemen - 1 freq
dinsmore - 2 freq
dingiein - 2 freq
dingin-doon - 1 freq
dumgoyne - 1 freq
dooncome - 1 freq
dinging - 1 freq
duncing - 3 freq
duncancltaylor - 5 freq
dancingshoes - 1 freq
donsmadman - 1 freq
duncanhotchkiss - 2 freq
dwangin' - 1 freq
duncanwchisholm - 4 freq
duncanwilliam - 1 freq
damson - 1 freq
dancingabc - 1 freq
dongmakgol - 1 freq
dunnjons - 5 freq
dauncin' - 1 freq
dinsmoor - 1 freq
dmxwmpruo - 1 freq
MetaPhone code - TNKN
duncan - 99 freq
dancan - 8 freq
dunkin - 2 freq
tankin - 2 freq
tinkin - 57 freq
tunkin - 1 freq
dingan - 2 freq
dauncan - 1 freq
tinkeen - 1 freq
doungaun - 2 freq
tinkan - 1 freq
DUNCAN
Time to execute Levenshtein function - 0.177685 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.368060 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.029943 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.040538 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.000890 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.