1998
DOI: 10.1006/cogp.1998.0694
|View full text |Cite
|
Sign up to set email alerts
|

Rethinking Eliminative Connectionism

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
180
0

Year Published

1998
1998
2007
2007

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 271 publications
(186 citation statements)
references
References 55 publications
2
180
0
Order By: Relevance
“…In fact, in part due to the perceived lack of constraints in neural network models that learn concepts by gradually building up associations, the rule-based approach experienced a rekindling of interest in the 1990s after its low point in the 1970s and 1980s (Marcus, 1998). Nosofsky and Palmeri (1998;Nosofsky et al, 1994;Palmeri & Nosofsky, 1995) have proposed a quantitative model of human concept learning that learns to classify objects by forming simple logical rules and remembering occasional exceptions to those rules.…”
Section: Rulesmentioning
confidence: 99%
“…In fact, in part due to the perceived lack of constraints in neural network models that learn concepts by gradually building up associations, the rule-based approach experienced a rekindling of interest in the 1990s after its low point in the 1970s and 1980s (Marcus, 1998). Nosofsky and Palmeri (1998;Nosofsky et al, 1994;Palmeri & Nosofsky, 1995) have proposed a quantitative model of human concept learning that learns to classify objects by forming simple logical rules and remembering occasional exceptions to those rules.…”
Section: Rulesmentioning
confidence: 99%
“…Again, while the authors of RI endorse a version of connectionism that denies the existence of symbolmanipulation, not all connectionists take such a position. It is worth distinguishing, then, two kinds of connectionism (Fodor and Pylyshyn, 1988;Pinker and Prince, 1988;Marcus, 1997), 'eliminative connectionism', a school of connectionism that denies the existence of symbol-manipulating primitives and 'implementational connectionism', a school of connectionism that seeks to account for how symbols are instantiated in the brain.…”
Section: Relation To Connectionism and Symbol-manipulationmentioning
confidence: 99%
“…To illustrate this, I conducted a series of simple experiments (Marcus, 1997) designed to test the ability of the SRN to generalize simple abstract relations to novel words (full details are provided in Appendix A). For example, in one simulation, I trained an SRN on sentences drawn from two sentence frames: Sentences constructed from the first frame took the form 'the bee sniffs the X', where X was instantiated by 10 different words like 'rose', 'lily', 'tulip', and 'lilac'.…”
Section: Single Recurrent Network Models Of Syntaxmentioning
confidence: 99%
See 1 more Smart Citation
“…To determine whether generalizations are comparable, I draw heavily on the work of Gary Marcus. Marcus (1998a, 1998b, 2001) defines the scope of generalizations and formally demonstrates that their learnability depends on a model's representational scheme. I begin the discussion by examining the representational characteristics of connectionist models of reading aloud and symbolic representations.…”
mentioning
confidence: 99%