Answering the Connectionist Challenge: A Symbolic Model Of Learning the Past Tenses Of English Verbs (1993)
| Citations: | 39 - 5 self |
BibTeX
@MISC{Ling93answeringthe,
author = {Charles X. Ling and Marin Marinov},
title = {Answering the Connectionist Challenge: A Symbolic Model Of Learning the Past Tenses Of English Verbs},
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 and McClelland, 1986; MacWhinney and Leinbach, 1991). 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 ...
