Connectionist Approaches to Language Learning
arise automatically as a result of the recursive structure of the task and the continuous nature of the SRN's state space. Elman also introduces a new graphical technique for study ing network behavior based on principal components analysis. He shows that sentences with multiple levels of embe...
| Other Authors: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer US
1991, 1991
|
| Edition: | 1st ed. 1991 |
| Series: | The Springer International Series in Engineering and Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Learning Automata from Ordered Examples
- SLUG: A Connectionist Architecture for Inferring the Structure of Finite-State Environments
- Graded State Machines: The Representation of Temporal Contingencies in Simple Recurrent Networks
- Distributed Representations, Simple Recurrent Networks, and Grammatical Structure
- The Induction of Dynamical Recognizers