Words with no proper subwords
Dan Graves visited us on a picket line recently, and told us of a word game he’d got from Tash Cowley: what is the longest word you can think of, none of whose proper substrings are words of three or more letters? For these purposes, proper nouns and abbreviations are not considered to be words. Thus, for example, famously doesn’t work because it has two substrings which are words: famous and sly.
Having spent some time on a picket line thinking about it, I rapidly wrote some code in Haskell to check it.
I ran it on the standard spellchecking “ispell” wordlist provided by
Debian (at /etc/dictionaries-common/words); this has
104,334 words, of which 63,737 consist only of lowercase letters without
punctuation. I found the following results:
The longest words found were click for spoilers letters long.
These words were click for spoilers.
There were also words of one fewer letter than that, which were click for spoilers.
Of course, the answer is strongly dependent on which strings are, and which strings are not, considered to be words. Using a bigger wordlist will give more candidates, but also more grounds for ruling candidates out. Thus I re-ran the experiment using two of the Moby word lists:
Using the list of 113,809 words that form the first edition of the Official Scrabble Players Dictionary (of which 113,724 consist only of lowercase letters with no punctuation), the longest words had the same length as with the ispell dictionary: click for spoilers.
Using the big list of 354,984 words (of which 350,630 consist only of lowercase letters with no punctuation), the longest word had the same length again, but there was just one of them (not a word in frequent use on my manor): click for spoilers.
Published 14th May, 2025.
Tags: frivolous, wordplay