Abstract
We develop a formal framework in which to study dictionaries satisfying a seemingly desirable property. A dictionary is said to be closed if every word used in that definition is itself defined (elsewhere in the dictionary). We show that any closed dictionary is degenerate: all words have the same meaning. Implications of this result are discussed, as well as potential remedies.
Acknowledgement
The authors wish to thank an editor for helpful comments on both the structure and presentation of the paper.
Notes
1We cannot resist mentioning another quote, this from Richard Garnett in 1835: “[T]he only good English dictionary we possess is Dr. Jamieson's.”
2Thus the basic version of our model is akin to some of the simpler methods of lexical disambiguation in computational linguistics.
3A slightly more standard alternate formulation is that every graph has a unique decoration.
4It has not escaped the authors' attention that one corollary to the theorem is that this paper could have been written more succinctly: Ω.
5Formally, a dictionary is closed if for all entries w i , TC(w i ) ∩ D ⫅ D\A. That is, all words in the transitive closure of w i must be entries in the dictionary.
6Altmann & Kind (Citation1983) speculate that the inverse relationship between levels and their size is due to the hierarchical conceptual nature of human memory.