Generalization by symbolic abstraction in cascaded recurrent networks

Neurocomputing

Volumn 57, Issue 1-4, 2004, Pages 87-104

  Bodén, Mikael ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Generalization; Language; Recurrent neural network; Systematicity

Indexed keywords

ABSTRACTING; CASCADE CONTROL SYSTEMS; CODES (SYMBOLS);

GENERALIZATION PERFORMANCE;

RECURRENT NEURAL NETWORKS;

ARTICLE; ARTIFICIAL NEURAL NETWORK; COMPUTER LANGUAGE; COMPUTER SIMULATION; INFORMATION PROCESSING; LEARNING; PREDICTION; PRIORITY JOURNAL; STATISTICAL ANALYSIS; STATISTICAL MODEL;

EID: 1542680967     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2004.01.006     Document Type: Article

References (20)

1. Bodén M. Blair A. Learning the dynamics of embedded clauses Appl. Intell. 19 1 2003 51-63
2. Bodén M. Wiles J. Context-free and context-sensitive dynamics in recurrent neural networks Connection Sci. 12 3 2000 197-210
3. Chomsky N. Syntactic Structures 1957 Mouton The Hague
4. Christiansen M. Chater N. Toward a connectionist model of recursion in human linguistic performance Cognitive Sci. 23 1999 157-205
5. Dougherty J. Kohavi R. Sahami M. Supervised and unsupervised discretization of continuous features in: Prieditis A. Russell S. (Eds.), Machine Learning: Proceedings of the 12th International Conference 1995 194-202 Morgan Kaufmann San Francisco, CA
6. Elman J.L. Finding structure in time Cognitive Sci. 14 1990 179-211
7. Elman J.L. Learning and development in neural networks: the importance of starting small Cognition 48 1993 71-99
8. Fodor J.A. Pylyshyn Z.W. Connectionism and cognitive architecture: a critical analysis Cognition 28 1988 3-71
9. Gers F.A. Schmidhuber J. LSTM recurrent networks learn simple context free and context sensitive languages IEEE Trans. Neural Networks 12 6 2001 1333-1340
10. Hadley R.F. Systematicity in connectionist language learning Mind Language 9 3 1994 247-272
11. Hadley R.F. Rotaru-Varga A. Arnold D.V. Cardei V.C. Syntactic systematicity arising from semantic predictions in a hebbian-competitive network Connection Sci. 13 1 2001 73-94
12. Marcus G.F. Language acquisition in the absence of explicit negative evidence: can simple recurrent networks obviate the need for domain-specific learning devices? Cognition 73 1999 293-296
13. Marcus G.F. Vijayan S. Bandi Rao S. Vishton P.M. Rule learning by seven-month-old infants Science 283 1999 77-80
14. Nolfi S. Tani J. Extracting regularities in space and time through a cascade of prediction networks: the case of a mobile robot navigating in a structured environment Connection Sci. 11 2 1999 125-148
15. Phillips S. Constituent similarity and systematicity: the limits of first-order connectionism Connection Sci. 12 1 2000 45-63
16. Pollack J.B. The induction of dynamical recognizers Mach. Learn. 7 1991 227
17. Rodriguez P. Wiles J. Elman J.L. A recurrent neural network that learns to count Connection Sci. 11 1 1999 5-40
18. Rohde D.L.T. Plaut D.C. Language acquisition in the absence of explicit negative evidence: how important is starting small? Cognition 72 1999 67-109
19. Rohde D.L.T. Plaut D.C. Simple recurrent networks can distinguish non-occurring from ungrammatical sentences given appropriate task structure: reply to Marcus Cognition 73 1999 297-300
20. Schmidhuber J. Prelinger D. Discovering predictable classifications Neural Comput. 5 4 1993 625-635