The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Finite State Automata and Simple Recurrent Networks
Open accessAbstract
We explore a network architecture introduced by Elman (1988) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step t−1, together with element t, to predict element t + 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar. When the network has a minimal number of hidden units, patterns on the hidden units come to correspond to the nodes of the grammar, although this correspondence is not necessary for the network to act as a perfect finite-state recognizer. We explore the conditions under which the network can carry information about distant sequential contingencies across intervening elements. Such information is maintained with relative ease if it is relevant at each intermediate step; it tends to be lost when intervening elements do not depend on it. At first glance this may suggest that such networks are not relevant to natural language, in which dependencies may span indefinite distances. However, embeddings in natural language are not completely independent of earlier information. The final simulation shows that long distance sequential contingencies can be encoded by the network even if only subtle statistical properties of embedded strings depend on the early information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
Williams, R. J., & Zipser, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.270 · Cited by 4,369
Implicit learning of artificial grammars
Reber, A. S. (1967) · Journal of Verbal Learning and Verbal Behavior · doi:10.1016/s0022-5371(67)80149-x · Cited by 2,026
NETtalk: a parallel network that learns to read aloud
B, T. J. S. A., & Rosenberg, C. (1988) · The MIT Press eBooks · Cited by 670
An Efficient Gradient-Based Algorithm for On-Line Training of Recurrent Network Trajectories
Williams, R. J., & Peng, J. (1990) · Neural Computation · doi:10.1162/neco.1990.2.4.490 · Cited by 577
The Case for Interactionism in Language Processing
McClelland, J. L. (1987) · doi:10.21236/ada204521 · Cited by 203
Self-citationGraded state machines: The representation of temporal contingencies in simple recurrent networks
Servan-Schreiber, D., Cleeremans, A., & Mcclelland, J. L. (1991) · Machine Learning · doi:10.1007/bf00114843 · Cited by 201
Self-citationLearning Sequential Structure in Simple Recurrent Networks
Servan‐Schreiber, D., Axel Cleeremans, B., & McClelland, J. L. (1988) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 175
Self-citation
Cited by
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Context, cortex, and dopamine: A connectionist approach to behavior and biology in schizophrenia.
Cohen, J. D., & Servan-Schreiber, D. (1992) · Psychological Review · doi:10.1037/0033-295x.99.1.45 · Cited by 1,479
Self-citationThe parallel distributed processing approach to semantic cognition
McClelland, J. L., & Rogers, T. T. (2003) · Nature Reviews Neuroscience · doi:10.1038/nrn1076 · Cited by 795
Self-citationOn the Computational Power of Neural Nets
Siegelmann, H. T., & Sontag, E. D. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1013 · Cited by 692
Gradient calculations for dynamic recurrent neural networks: a survey
Pearlmutter, B. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.410363 · Cited by 582
Metadata
- Authors
- Cleeremans, A., Servan-Schreiber, D., & McClelland, J. L.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1989-09
- Volume
- 1
- Issue
- 3
- Pages
- 372-381
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2121553911
- Cited by
- 458
- References
- 9
- FWCI
- 12.33
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.