title: Answering the connectionist challenge: a symbolic model of learning the past tenses of English verbs.
abstract: Supporters of eliminative connectionism have argued for a pattern association-based explanation of language learning and language processing. They deny that explicit rules and symbolic representations play any role in language processing and cognition in general. Their argument is based to a large extent on two artificial neural network (ANN) models that are claimed to be able to learn the past tenses of English verbs (Rumelhart & McClelland, 1986, Parallel distributed processing, Vol. 2, Cambridge, MA: MIT Press; MacWhinney & Leinbach, 1991, Cognition, 40, 121-157). In this article we critically review Rumelhart and McClelland's as well as MacWhinney and Leinbach's ANN models and conclude that they do not succeed in the assigned task of learning the past tenses of English verbs. In order to answer their challenge to the symbolic processing approach, we present our symbolic pattern associator (SPA)-a general-purpose pattern associator that can learn to associate arbitrary discrete patterns. We carried out several experiments with the SPA using the same set of verbs that was used in MacWhinney and Leinbach's simulation with more realistic training and testing procedures. The SPA outperformed the connectionist models by a wide margin in the accuracy of learning, and successful inductive generalizations to unseen verbs. Our SPA has very natural and psychologically realistic explanations to many psychological effects such as U-shaped learning curve, and is much closer to human subjects in predicting past tense of the pseudo-verbs. In contrast to ANNs, whose internal representations are entirely opaque, the SPA can represent the acquired knowledge in the form of production rules that allow for further higher-level processing and integration, resulting in linguistically realistic associative templates for irregular verbs and production rules for regular verbs. In the light of these findings, we conclude that eliminative connectionists' vision of cognition as simple pattern association and pattern recognition without symbolic representation is inadequate. Pattern association as such does not imply rule-less or cue-based models of language acquisition or of human learning in general.
authors.affiliation: Department of Computer Science, University of Western Ontario, London, Canada.
authors.forename: C X
authors.initials: CX
authors.lastname: Ling
authors.forename: M
authors.initials: M
authors.lastname: Marinov
mesh_terms: D003071:Cognition; D005260:Female; D006801:Humans; D007802:Language; D007858:Learning; D008297:Male; D008962:Models, Theoretical; D010700:Phonetics