Rules versus statistics in implicit learning of biconditional grammars.

Bert Timmermans, Axel Cleeremans

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A significant part of everyday learning occurs incidentally — a process typically described as implicit learning. A central issue in this domain and others, such as language acquisition, is the extent to which performance depends on the acquisition and deployment of abstract rules. Shanks and colleagues [22], [11] have suggested (1) that discrimination between grammatical and ungrammatical instances of a biconditional grammar requires the acquisition and use of abstract rules, and (2) that training conditions — in particular whether instructions orient participants to identify the relevant rules or not — strongly influence the extent to which such rules will be learned. In this paper, we show (1) that a Simple Recurrent Network can in fact, under some conditions, learn a biconditional grammar, (2) that training conditions indeed influence learning in simple auto-associators networks and (3) that such networks can likewise learn about biconditional grammars, albeit to a lesser extent than human participants. These findings suggest that mastering biconditional grammars does not require the acquisition of abstract rules to the extent implied by Shanks and colleagues, and that performance on such material may in fact be based, at least in part, on simple associative learning mechanisms.
Original languageEnglish
Title of host publicationConnectionist Models of Learning, Development and Evolution
Subtitle of host publicationProceedings of the Sixth Neural Computation and Psychology Workshop, Liège, Belgium, 16–18 September 2000
EditorsRobert M French, Jacques P Sougné
PublisherSpringer
Pages185-196
Number of pages12
ISBN (Print)978-1-85233-354-6
DOIs
Publication statusPublished - 2001

Publication series

NamePerspectives in Neural Computing

Fingerprint

grammar
statistics
learning
language acquisition
performance
discrimination
instruction

Cite this

Timmermans, B., & Cleeremans, A. (2001). Rules versus statistics in implicit learning of biconditional grammars. In R. M. French, & J. P. Sougné (Eds.), Connectionist Models of Learning, Development and Evolution: Proceedings of the Sixth Neural Computation and Psychology Workshop, Liège, Belgium, 16–18 September 2000 (pp. 185-196). (Perspectives in Neural Computing). Springer . https://doi.org/10.1007/978-1-4471-0281-6_19

Rules versus statistics in implicit learning of biconditional grammars. / Timmermans, Bert; Cleeremans, Axel.

Connectionist Models of Learning, Development and Evolution: Proceedings of the Sixth Neural Computation and Psychology Workshop, Liège, Belgium, 16–18 September 2000. ed. / Robert M French; Jacques P Sougné. Springer , 2001. p. 185-196 (Perspectives in Neural Computing).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Timmermans, B & Cleeremans, A 2001, Rules versus statistics in implicit learning of biconditional grammars. in RM French & JP Sougné (eds), Connectionist Models of Learning, Development and Evolution: Proceedings of the Sixth Neural Computation and Psychology Workshop, Liège, Belgium, 16–18 September 2000. Perspectives in Neural Computing, Springer , pp. 185-196. https://doi.org/10.1007/978-1-4471-0281-6_19
Timmermans B, Cleeremans A. Rules versus statistics in implicit learning of biconditional grammars. In French RM, Sougné JP, editors, Connectionist Models of Learning, Development and Evolution: Proceedings of the Sixth Neural Computation and Psychology Workshop, Liège, Belgium, 16–18 September 2000. Springer . 2001. p. 185-196. (Perspectives in Neural Computing). https://doi.org/10.1007/978-1-4471-0281-6_19
Timmermans, Bert ; Cleeremans, Axel. / Rules versus statistics in implicit learning of biconditional grammars. Connectionist Models of Learning, Development and Evolution: Proceedings of the Sixth Neural Computation and Psychology Workshop, Liège, Belgium, 16–18 September 2000. editor / Robert M French ; Jacques P Sougné. Springer , 2001. pp. 185-196 (Perspectives in Neural Computing).
@inproceedings{185c41e0d95a4bddb27656a3edc9234f,
title = "Rules versus statistics in implicit learning of biconditional grammars.",
abstract = "A significant part of everyday learning occurs incidentally — a process typically described as implicit learning. A central issue in this domain and others, such as language acquisition, is the extent to which performance depends on the acquisition and deployment of abstract rules. Shanks and colleagues [22], [11] have suggested (1) that discrimination between grammatical and ungrammatical instances of a biconditional grammar requires the acquisition and use of abstract rules, and (2) that training conditions — in particular whether instructions orient participants to identify the relevant rules or not — strongly influence the extent to which such rules will be learned. In this paper, we show (1) that a Simple Recurrent Network can in fact, under some conditions, learn a biconditional grammar, (2) that training conditions indeed influence learning in simple auto-associators networks and (3) that such networks can likewise learn about biconditional grammars, albeit to a lesser extent than human participants. These findings suggest that mastering biconditional grammars does not require the acquisition of abstract rules to the extent implied by Shanks and colleagues, and that performance on such material may in fact be based, at least in part, on simple associative learning mechanisms.",
author = "Bert Timmermans and Axel Cleeremans",
year = "2001",
doi = "10.1007/978-1-4471-0281-6_19",
language = "English",
isbn = "978-1-85233-354-6",
series = "Perspectives in Neural Computing",
publisher = "Springer",
pages = "185--196",
editor = "French, {Robert M} and Sougn{\'e}, {Jacques P}",
booktitle = "Connectionist Models of Learning, Development and Evolution",

}

TY - GEN

T1 - Rules versus statistics in implicit learning of biconditional grammars.

AU - Timmermans, Bert

AU - Cleeremans, Axel

PY - 2001

Y1 - 2001

N2 - A significant part of everyday learning occurs incidentally — a process typically described as implicit learning. A central issue in this domain and others, such as language acquisition, is the extent to which performance depends on the acquisition and deployment of abstract rules. Shanks and colleagues [22], [11] have suggested (1) that discrimination between grammatical and ungrammatical instances of a biconditional grammar requires the acquisition and use of abstract rules, and (2) that training conditions — in particular whether instructions orient participants to identify the relevant rules or not — strongly influence the extent to which such rules will be learned. In this paper, we show (1) that a Simple Recurrent Network can in fact, under some conditions, learn a biconditional grammar, (2) that training conditions indeed influence learning in simple auto-associators networks and (3) that such networks can likewise learn about biconditional grammars, albeit to a lesser extent than human participants. These findings suggest that mastering biconditional grammars does not require the acquisition of abstract rules to the extent implied by Shanks and colleagues, and that performance on such material may in fact be based, at least in part, on simple associative learning mechanisms.

AB - A significant part of everyday learning occurs incidentally — a process typically described as implicit learning. A central issue in this domain and others, such as language acquisition, is the extent to which performance depends on the acquisition and deployment of abstract rules. Shanks and colleagues [22], [11] have suggested (1) that discrimination between grammatical and ungrammatical instances of a biconditional grammar requires the acquisition and use of abstract rules, and (2) that training conditions — in particular whether instructions orient participants to identify the relevant rules or not — strongly influence the extent to which such rules will be learned. In this paper, we show (1) that a Simple Recurrent Network can in fact, under some conditions, learn a biconditional grammar, (2) that training conditions indeed influence learning in simple auto-associators networks and (3) that such networks can likewise learn about biconditional grammars, albeit to a lesser extent than human participants. These findings suggest that mastering biconditional grammars does not require the acquisition of abstract rules to the extent implied by Shanks and colleagues, and that performance on such material may in fact be based, at least in part, on simple associative learning mechanisms.

U2 - 10.1007/978-1-4471-0281-6_19

DO - 10.1007/978-1-4471-0281-6_19

M3 - Conference contribution

SN - 978-1-85233-354-6

T3 - Perspectives in Neural Computing

SP - 185

EP - 196

BT - Connectionist Models of Learning, Development and Evolution

A2 - French, Robert M

A2 - Sougné, Jacques P

PB - Springer

ER -