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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
dumb (0) - 38 freq
rumb (1) - 10 freq
tumb (1) - 1 freq
'dumb (1) - 2 freq
damb (1) - 1 freq
dub (1) - 27 freq
dumbo (1) - 2 freq
dumba (1) - 1 freq
numb (1) - 27 freq
duma (1) - 1 freq
dump (1) - 30 freq
dum (1) - 14 freq
doms (2) - 3 freq
hums (2) - 3 freq
summ (2) - 1 freq
mum' (2) - 1 freq
dusk (2) - 7 freq
duly (2) - 14 freq
damp (2) - 83 freq
sum (2) - 416 freq
dup (2) - 5 freq
dwab (2) - 1 freq
demo (2) - 3 freq
dun (2) - 36 freq
dab (2) - 58 freq
dumb (0) - 38 freq
dumba (1) - 1 freq
dumbo (1) - 2 freq
damb (1) - 1 freq
rumb (2) - 10 freq
demob (2) - 3 freq
dum (2) - 14 freq
dump (2) - 30 freq
duma (2) - 1 freq
tumb (2) - 1 freq
'dumb (2) - 2 freq
dub (2) - 27 freq
numb (2) - 27 freq
dmi (3) - 1 freq
dem (3) - 722 freq
jamb (3) - 2 freq
dummy (3) - 27 freq
dumfy (3) - 3 freq
mb (3) - 5 freq
duim (3) - 1 freq
omb (3) - 3 freq
dqb (3) - 1 freq
womb (3) - 8 freq
dam (3) - 28 freq
lamb (3) - 62 freq
SoundEx code - D510
dounby - 3 freq
dump - 30 freq
doonbye - 4 freq
dumb - 38 freq
damp - 83 freq
dounfaw - 5 freq
dounbye - 1 freq
dumpie - 1 freq
dunbae - 2 freq
demob - 3 freq
doonby - 20 freq
'dumb - 2 freq
doonfaa - 3 freq
dump' - 1 freq
dumbo - 2 freq
dumphy - 50 freq
damff - 1 freq
doonfa - 2 freq
danube - 1 freq
dumfy - 3 freq
dumba - 1 freq
damb - 1 freq
€œdumb - 1 freq
dianeeva - 1 freq
dunfy - 1 freq
MetaPhone code - TM
time - 5878 freq
'time - 4 freq
teem - 46 freq
tam - 519 freq
tom - 134 freq
time- - 2 freq
toom - 35 freq
tame - 23 freq
'tam - 14 freq
domme - 1 freq
'tm - 1 freq
tom' - 1 freq
deem - 19 freq
doom - 34 freq
tame' - 3 freq
team - 292 freq
tam' - 1 freq
teeeeeam - 1 freq
teeeamy - 1 freq
tuim - 102 freq
t'm - 3 freq
tyme - 219 freq
tm - 7 freq
time' - 6 freq
team' - 2 freq
'dam - 1 freq
tomb - 31 freq
dumb - 38 freq
't'm - 3 freq
'tom - 1 freq
dummy - 27 freq
dam - 28 freq
dem - 722 freq
demi - 1 freq
tomboy - 1 freq
timé - 1 freq
'dame - 1 freq
dim - 50 freq
dome - 21 freq
demo - 3 freq
tme - 3 freq
dame - 16 freq
tammie - 24 freq
tommy - 100 freq
ttme - 1 freq
t'im - 1 freq
t'im' - 1 freq
tum - 17 freq
tim - 46 freq
htm - 17 freq
'tommy - 2 freq
dum - 14 freq
daem - 1 freq
tim' - 43 freq
'dumb - 2 freq
tome - 4 freq
dem-aa - 1 freq
dem- - 1 freq
dom - 3 freq
'team'' - 1 freq
'dom - 2 freq
tammy - 48 freq
töm - 2 freq
tume - 14 freq
tym - 2 freq
ti'm - 1 freq
teum - 8 freq
domm - 1 freq
dumbo - 2 freq
tummy - 4 freq
toam - 1 freq
doomy - 1 freq
duma - 1 freq
tiym - 6 freq
-dom - 2 freq
tøm - 1 freq
tumb - 1 freq
dima-' - 1 freq
tae'm - 2 freq
deemie - 3 freq
duim - 1 freq
dummie - 1 freq
tombaugh - 1 freq
€˜tam - 6 freq
'teem - 1 freq
€˜doom - 1 freq
diem - 2 freq
€˜dem - 4 freq
dumba - 1 freq
€œtime - 1 freq
damb - 1 freq
toamy - 12 freq
deemy - 1 freq
€œdumb - 1 freq
€œtommy - 1 freq
damo - 10 freq
taim - 1 freq
€™time - 1 freq
wdma - 1 freq
teamie - 1 freq
dm - 12 freq
timmy - 2 freq
tommie - 1 freq
timeÂ’ - 1 freq
dmi - 1 freq
tmi - 1 freq
tomb” - 1 freq
time” - 1 freq
ydm - 1 freq
'taim' - 1 freq
damoa - 7 freq
tomow - 1 freq
taeyma - 1 freq
DUMB
Time to execute Levenshtein function - 0.222474 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.324330 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.027686 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.043601 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.000922 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.