Semantic categories in the world's languages often reflect a historical process of chaining: A name for one referent is extended to a conceptually related referent, and from there on to other referents, producing a chain of exemplars that all bear the same name. The beginning and end points of such a chain might in principle be rather dissimilar. There is also evidence supporting a contrasting picture: Languages tend to support efficient, informative communication, often through semantic categories in which all exemplars (...) are similar. Here, we explore this tension through computational analyses of existing cross-language naming and sorting data from the domain of household containers. We find formal evidence for historical semantic chaining, and evidence that systems of categories in this domain nonetheless support near-optimally efficient communication. Our results demonstrate that semantic chaining is compatible with efficient communication, and they suggest that chaining may be constrained by the functional need for efficient communication. (shrink)
Thomas & Karmiloff- Smith show that the assumption of residual normality does not hold in connectionist simulations, and argue that RN has been inappropriately applied to childhood disorders. We agree. However, we suggest that the RN hypothesis may never have been fully viable, either empirically or computationally.
What would Glenberg 's attractive ideas look like when computationally fleshed out? I suggest that the most helpful next step in formalizing them is neither a connectionist nor a symbolic implementation, but rather an implementation- general analysis of the task in terms of the informational content required.