Distributed representations, simple recurrent networks, and grammatical structure

  • Elman J
N/ACitations
Citations of this article
212Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper three problems for a connectionist account of language are {considered1.What} is the nature of linguistic {representations?2.How} can complex structural relationships such as constituent be {represented?3.How} can the apparently open-ended nature of language be accommodated by a fixed-resource system?

Cite

CITATION STYLE

APA

Elman, J. L. (1991). Distributed representations, simple recurrent networks, and grammatical structure. Machine Learning, 7(2–3), 195–225. https://doi.org/10.1007/bf00114844

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free