We present statistical analyses of the large-scale structure of three types of semantic networks: word associations, WordNet, and Roget's thesaurus. We show that they have a small-world structure, characterized by sparse connectivity, short average path-lengths between words, and strong local clustering. In addition, the distributions of the number of connections follow power laws that indicate a scale-free pattern of connectivity, with most nodes having relatively few connections joined together through a small number of hubs with many connections. These regularities have also been found in certain other complex natural networks, such as the world wide web, but they are not consistent with many conventional models of semantic organization, based on inheritance hierarchies, arbitrarily structured networks, or high-dimensional vector spaces. We propose that these structures reflect the mechanisms by which semantic networks grow. We describe a simple model for semantic growth, in which each new word or concept is connected to an existing network by differentiating the connectivity pattern of an existing node. This model generates appropriate small-world statistics and power-law connectivity distributions, and also suggests one possible mechanistic basis for the effects of learning history variables (age-ofacquisition, usage frequency) on behavioral performance in semantic processing tasks.

Two connectionist frameworks, GRAIN (McClelland, 1993) and BSB (Anderson, 1991), and the diffusion model (Ratcliff, 1978) were evaluated using data from a signal detection task. Subjects were asked to choose one of two possible responses to a stimulus and were provided feedback about whether the choice was correct. The dependent variables included response probabilities, reaction times for correct and error responses, and reaction time distributions, and the independent variables were stimulus value, stimulus probability, and lag from an abrupt switch in stimulus probability. The diffusion model accounted for all aspects of the asymptotic data, including error reaction times, which had previously been a problem. The connectionist models accounted for many aspects of the data adequately, but each failed to a greater or lesser degree in important ways except for one model very similar to the diffusion model. The connectionist learning mechanisms were unable to account for initial learning or abrupt changes in stimulus probability. The results provide an advance in the development of the diffusion model and show that the long tradition of reaction time research and theory is a fertile domain for development and testing of connectionist assumptions about how decisions are generated over time.

Many theorists assume that the cognitive system is composed of a collection of encapsulated processing components or modules, each dedicated to performing a particular cognitive function. On this view, selective impairments of cognitive tasks following brain damage, as evidenced by double dissociations, are naturally interpreted in terms of the loss of particular processing components. By contrast, the current investigation examines in detail a double dissociation between concrete and abstract word reading after damage to a connectionist network that pronounces words via meaning and yet has no separable components (Plaut & Shallice, 1993). The functional specialization in the network that gives rise to the double dissociation is not transparently related to the network's structure, as modular theories assume. Furthermore, a consideration of the distribution of effects across quantitatively equivalent individual lesions in the network raises specific concerns about the interpretation of...

We present a theoretical framework for understanding the roles of the hippocampus and neocortex in learning and memory. This framework incorporates a theme found in many theories of hippocampal function, that the hippocampus is responsible for developing conjunctive representations binding together stimulus elements into a unitary rep- resentation that can later be recalled from partial input cues. This idea appears problematic, however, because it is contradicted by the fact that hippocampally lesioned rats can learn nonlinear discrimination problems that require conjunctive representations. Our framework accommodates this finding by establishing a principled division of labor between the cortex and hippocampus, where the cortex is responsible for slow learning that integrates over multiple experiences to extract generalities, while the hippocampus performs rapid learning of the arbitrary contents of individual experiences. This framework shows that nonlinear discrimination problems are not good tests of hippocampal function, and suggests that tasks involving rapid, incidental conjunctive learning are better. We implement this framework in a computational neural network model, and show that it can account for a wide range of data in animal learning, thus validating our theoretical ideas, and providing a number of insights and predictions about these learning phenomena.

this article, in conjunction with those developed previously (Plaut et al., 1996; Seidenberg & McClelland, 1989), illustrate how connectionist computational principles---distributed representation, structure-sensitive learning, and interactivity---can provide insight into central empirical phenomena in normal and impaired lexical processing. Moreover, they make it clear that distinctions in the function of the lexical system---as manifest in the behaviour of experimental subjects--- need not re#ect corresponding distinctions in the structure of the system. Thus, networks exhibit word-frequency effects and word/nonword discrimination without word representations, and spelling --sound consistency effects without separate mechanisms for regular and exception items. In this way, gaining insight into the structure and function of the cognitive system by observing its normal and impaired behaviour ---the central goal of cognitive psychology and neuropsycho logy---may depend critically on developing theories and explicit simulations in the context of a speci#c computational framework that relates structure to function

The development of reading skill and bases of developmental dyslexia were explored using connectionist models. Four issues were examined: the acquisition of phonological knowledge prior to reading, how this knowledge facilitates learning to read, phonological and non phonological bases of dyslexia, and effects of literacy on phonological representation. Compared with simple feedforward networks, representing phonological knowledge in an attractor network yielded improved learning and generalization. Phonological and surface forms of developmental dyslexia, which are usually attributed to impairments in distinct lexical and nonlexical processing “routes,” were derived from different types of damage to the network. The results provide a computationally explicit account of many aspects of reading acquisition using connectionist principles.

An interactive 2-step theory of lexical retrieval was applied to the picture-naming error patterns of aphasic and nonaphasic speakers. The theory uses spreading activation in a lexical network to accomplish the mapping between the conceptual representation of an object and the phonological form of the word naming the object. A model developed from the theory was parameterized to fit normal error patterns. It was then "lesioned " by globally altering its connection weight, decay rates, or both to provide fits to the error patterns of 21 fluent aphasic patients. These fits were then used to derive predictions about the influence of syntactic categories on patient errors, the effect of phonology on semantic errors, error patterns after recovery, and patient performance on a single-word repetition task. The predictions were confirmed. It is argued that simple quantitative alterations to a normal processing model can explain much of the variety among patient patterns in naming. Difficulty in word retrieval is the most pervasive symptom of language breakdown in aphasia. As with other symptoms of brain damage, word retrieval is subject to graceful degradation (Marr, 1982; Rumelhart & McClelland, 1986): Unsuccessful attempts at retrieval generally resemble the target, either in

A computational model of human memory for serial order is described (OSCillator-based Associative Recall [OSCAR]). In the model, successive list items become associated to successive states of a dynamic learning-context signal. Retrieval involves reinstatement of the learning context, successive states of which cue successive recalls. The model provides an integrated account of both item memory and order memory and allows the hierarchical representation of temporal order information. The model accounts for a wide range of serial order memory data, including differential item and order memory, transposition gradients, item similarity effects, the effects of item lag and separation in judgments of relative and absolute recency, probed serial recall data, distinctiveness effects, grouping effects at various temporal resolutions, longer term memory for serial order, list length effects, and the effects of vocabulary size on serial recall. The serial ordering of behavior is central to much, perhaps most, of human cognition (e.g., Lashley, 1951). Studies of memory for serial order have provided rich data on the psychological repre-sentation of serial order information and therefore offer a signifi-cant challenge to any model of serially ordered behavior. In this

We present a new distributed connectionist model of the perception of spoken words. The model employs a representatio n of speech that combines lexical information with abstract phonological information, with lexical access modelled as a direct mapping onto this single distributed representatio n. We �rst examine the integration of partial cues to phonological identity, showing that the model provides a sound basis for simulating phonetic and lexical decision data from Marslen-Wilson and Warren (1994). We then investigate the time course of lexical access, and argue that the process of competition between word candidates during lexical access can be interpreted in terms of interference between distributed lexical representatio ns. The relation between our model and other models of spoken word recognition is discussed.

Humans routinely generalize universal relationships to unfamiliar instances. If we are told ‘‘if glork then frum,’ ’ and ‘‘glork,’ ’ we can infer ‘‘frum’’; any name that serves as the subject of a sentence can appear as the object of a sentence. These universals are pervasive in language and reasoning. One account of how they are generalized holds that humans possess mechanisms that manipulate symbols and variables; an alternative account holds that symbol-manipulation can be eliminated from scientific theories in favor of descriptions couched in terms of networks of interconnected nodes. Can these ‘‘eliminative’ ’ connectionist models offer a genuine alternative? This article shows that eliminative connectionist models cannot account for how we extend universals to arbitrary items. The argument runs as follows. First, if these models, as currently conceived, were to extend universals to arbitrary instances, they would have to generalize outside the space of training examples. Next, it is shown that the class of eliminative connectionist models that is currently popular cannot learn to extend universals outside the training space. This limitation might be avoided through the use of an architecture that implements symbol manipulation.