Distributed representations, simple recurrent networks, and grammatical structure (1991)
Cached
Download Links
- [wexler.free.fr]
- [sunsite.unc.edu]
- [crl.ucsd.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Machine Learning |
| Citations: | 251 - 14 self |
BibTeX
@INPROCEEDINGS{Elman91distributedrepresentations,,
author = {Jeffrey L. Elman},
title = {Distributed representations, simple recurrent networks, and grammatical structure},
booktitle = {Machine Learning},
year = {1991},
pages = {195--225}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In this paper three problems for a connectionist account of language are considered: 1. What is the nature of linguistic representations? 2. How can complex structural relationships such as constituent structure be represented? 3. How can the apparently open-ended nature of language be accommodated by a fixed-resource system? Using a prediction task, a simple recurrent network (SRN) is trained on multiclausal sentences which contain multiply-embedded relative clauses. Principal component analysis of the hidden unit activation patterns reveals that the network solves the task by developing complex distributed representations which encode the relevant grammatical relations and hierarchical constituent structure. Differences between the SRN state representations and the more traditional pushdown store are discussed in the final section.
