The DOI matches its Crossref record; 86 of the 86 references it cites were found in a registry or an index.
Rethinking Eliminative Connectionism
Open accessAbstract
Humans routinely generalize universal relationships to unfamiliar instances. If we are told "if glork then frum," and "glork," we can infer "frum"; any name that serves as the subject of a sentence can appear as the object of a sentence. These universals are pervasive in language and reasoning. One account of how they are generalized holds that humans possess mechanisms that manipulate symbols and variables; an alternative account holds that symbol-manipulation can be eliminated from scientific theories in favor of descriptions couched in terms of networks of interconnected nodes. Can these "eliminative" connectionist models offer a genuine alternative? This article shows that eliminative connectionist models cannot account for how we extend universals to arbitrary items. The argument runs as follows. First, if these models, as currently conceived, were to extend universals to arbitrary instances, they would have to generalize outside the space of training examples. Next, it is shown that the class of eliminative connectionist models that is currently popular cannot learn to extend universals outside the training space. This limitation might be avoided through the use of an architecture that implements symbol manipulation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
Anderson, J. R. (2013) · doi:10.4324/9781315799438 · Cited by 6,761
The Psychology of Learning and Motivation: Advances in Research and Theory
(2010) · Psychology of Learning and Motivation · doi:10.1016/c2009-0-62209-1 · Cited by 5,994
(1983) · Cited by 5,041
Fodor, J. A. (1975) · Medical Entomology and Zoology · Cited by 4,588
Madden, E. H., Goodman, N., & Melsen, A. G. V. (1955) · Philosophy and Phenomenological Research · doi:10.2307/2103789 · Cited by 4,377
(1991) · Choice Reviews Online · doi:10.5860/choice.28-5376 · Cited by 4,207
Cited by
Foundations of Language: Brain, Meaning, Grammar, Evolution
Jackendoff, R. (2002) · doi:10.1093/acprof:oso/9780198270126.001.0001 · Cited by 3,244
Building machines that learn and think like people
Lake, B. M., Ullman, T. D., Tenenbaum, J. B., & Gershman, S. J. (2017) · Behavioral and Brain Sciences · doi:10.1017/s0140525x16001837 · Cited by 2,550
Shortcut learning in deep neural networks
Geirhos, R., Jacobsen, J.-H., Michaelis, C., Zemel, R., Brendel, W., Bethge, M., & Wichmann, F. A. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-00257-z · Cited by 2,224
Neuroscience-Inspired Artificial Intelligence
Hassabis, D., Kumaran, D., Summerfield, C., & Botvinick, M. (2017) · Neuron · doi:10.1016/j.neuron.2017.06.011 · Cited by 1,557
Chang, F., Dell, G. S., & Bock, K. (2006) · Psychological Review · doi:10.1037/0033-295x.113.2.234 · Cited by 984
Metadata
- Authors
- Marcus, G. F.
- Venue
- Cognitive Psychology
- Publisher
- Elsevier BV
- Published
- 1998-12
- Volume
- 37
- Issue
- 3
- Pages
- 243-282
- ISSN
- 0010-0285 (ISSN-L)
- OpenAlex
- W1966678693
- Cited by
- 348
- References
- 86
- FWCI
- 25.49
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Rethinking Eliminative Connectionism. https://app.cochat.ai/papers/10.1006/cogp.1998.0694
- The paper
- Marcus, G. F. (1998). Rethinking Eliminative Connectionism. Cognitive Psychology. https://doi.org/10.1006/cogp.1998.0694
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.