What Is Learned From Artificial Grammars? Transfer Tests of Simple Association

Rebecca L Gomez, Roger W. Schvaneveldt

Research output: Contribution to journalArticle

80 Citations (Scopus)

Abstract

Ss were trained on letter pairs or letter strings in an artificial grammar learning paradigm to determine the extent to which implicit learning is driven by simple associative knowledge. Learning on strings resulted in sensitivity to violations of grammaticality and in transfer to a changed letter set. Learning on letter pairs resulted in less sensitivity and no transfer. Discrepancies in performance were later reduced, but not eliminated, by equating the task demands of the conditions during learning. A direct test of associative knowledge showed that training on letter pairs resulted in knowledge of legal bigrams, but this knowledge was only weakly related to violation sensitivity. The experiments demonstrate that knowledge of isolated associations is sufficient to support some learning, but this knowledge cannot explain the more abstract knowledge that results from learning on complete exemplars.

Original languageEnglish (US)
Pages (from-to)396-410
Number of pages15
JournalJournal of Experimental Psychology: Learning, Memory, and Cognition
Volume20
Issue number2
StatePublished - Mar 1994
Externally publishedYes

Fingerprint

grammar
Learning
learning
Transfer (Psychology)
Artificial Grammar
Letters
paradigm
experiment
performance
Associative
Violations
Strings

ASJC Scopus subject areas

  • Experimental and Cognitive Psychology

Cite this

What Is Learned From Artificial Grammars? Transfer Tests of Simple Association. / Gomez, Rebecca L; Schvaneveldt, Roger W.

In: Journal of Experimental Psychology: Learning, Memory, and Cognition, Vol. 20, No. 2, 03.1994, p. 396-410.

Research output: Contribution to journalArticle

@article{927eb4a2d7954172b65100845160846a,
title = "What Is Learned From Artificial Grammars? Transfer Tests of Simple Association",
abstract = "Ss were trained on letter pairs or letter strings in an artificial grammar learning paradigm to determine the extent to which implicit learning is driven by simple associative knowledge. Learning on strings resulted in sensitivity to violations of grammaticality and in transfer to a changed letter set. Learning on letter pairs resulted in less sensitivity and no transfer. Discrepancies in performance were later reduced, but not eliminated, by equating the task demands of the conditions during learning. A direct test of associative knowledge showed that training on letter pairs resulted in knowledge of legal bigrams, but this knowledge was only weakly related to violation sensitivity. The experiments demonstrate that knowledge of isolated associations is sufficient to support some learning, but this knowledge cannot explain the more abstract knowledge that results from learning on complete exemplars.",
author = "Gomez, {Rebecca L} and Schvaneveldt, {Roger W.}",
year = "1994",
month = "3",
language = "English (US)",
volume = "20",
pages = "396--410",
journal = "Journal of Experimental Psychology: Learning Memory and Cognition",
issn = "0278-7393",
publisher = "American Psychological Association Inc.",
number = "2",

}

TY - JOUR

T1 - What Is Learned From Artificial Grammars? Transfer Tests of Simple Association

AU - Gomez, Rebecca L

AU - Schvaneveldt, Roger W.

PY - 1994/3

Y1 - 1994/3

N2 - Ss were trained on letter pairs or letter strings in an artificial grammar learning paradigm to determine the extent to which implicit learning is driven by simple associative knowledge. Learning on strings resulted in sensitivity to violations of grammaticality and in transfer to a changed letter set. Learning on letter pairs resulted in less sensitivity and no transfer. Discrepancies in performance were later reduced, but not eliminated, by equating the task demands of the conditions during learning. A direct test of associative knowledge showed that training on letter pairs resulted in knowledge of legal bigrams, but this knowledge was only weakly related to violation sensitivity. The experiments demonstrate that knowledge of isolated associations is sufficient to support some learning, but this knowledge cannot explain the more abstract knowledge that results from learning on complete exemplars.

AB - Ss were trained on letter pairs or letter strings in an artificial grammar learning paradigm to determine the extent to which implicit learning is driven by simple associative knowledge. Learning on strings resulted in sensitivity to violations of grammaticality and in transfer to a changed letter set. Learning on letter pairs resulted in less sensitivity and no transfer. Discrepancies in performance were later reduced, but not eliminated, by equating the task demands of the conditions during learning. A direct test of associative knowledge showed that training on letter pairs resulted in knowledge of legal bigrams, but this knowledge was only weakly related to violation sensitivity. The experiments demonstrate that knowledge of isolated associations is sufficient to support some learning, but this knowledge cannot explain the more abstract knowledge that results from learning on complete exemplars.

UR - http://www.scopus.com/inward/record.url?scp=4243927598&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4243927598&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:4243927598

VL - 20

SP - 396

EP - 410

JO - Journal of Experimental Psychology: Learning Memory and Cognition

JF - Journal of Experimental Psychology: Learning Memory and Cognition

SN - 0278-7393

IS - 2

ER -