Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Implicit learning of a recursive rule in an artificial grammar.

Fenna H Poletiek1

  • 1Unit of Experimental Psychology, University of Leiden, Netherlands. poletiek@fsw.leidenuniv.nl

Acta Psychologica
|November 9, 2002
PubMed
Summary

Participants can learn recursive rules in artificial grammar tasks, but rely on recognizing specific sequences rather than abstract rule induction. Learning improves with more self-embedding, and explicit cues aid understanding of infinite repetition.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Recalling sequences from memory can explain the distribution of recursive structures in natural languages.

Cognition·2025
Same author

The semantics-syntax interface: Learning grammatical categories and hierarchical syntactic structure through semantics.

Journal of experimental psychology. Learning, memory, and cognition·2021
Same author

Correction to: Effects of grammar complexity on artificial grammar learning.

Memory & cognition·2019
Same author

Intelligent problem-solvers externalize cognitive operations.

Nature human behaviour·2019
Same author

Under What Conditions Can Recursion Be Learned? Effects of Starting Small in Artificial Grammar Learning of Center-Embedded Structure.

Cognitive science·2018
Same author

What baboons can (not) tell us about natural language grammars.

Cognition·2015

Area of Science:

  • Cognitive Psychology
  • Linguistics
  • Artificial Grammar Learning

Background:

  • Artificial grammar learning (AGL) investigates implicit learning of complex rules.
  • Standard finite state grammars are well-learned, but recursive rules pose challenges.

Purpose of the Study:

  • To investigate the learnability of recursive rules in an artificial grammar task.
  • To determine if learning is based on abstract rule induction or chunk recognition.

Main Methods:

  • Two experiments using an extended finite state grammar with a recursive rule.
  • Participants learned sequences generated by the grammar.
  • Analysis of performance based on embedding levels and cueing.

Main Results:

Related Experiment Videos

  • Recursivity was learnable, but primarily through chunk recognition, not abstract induction.
  • Performance improved with higher levels of self-embedding.
  • Spontaneous induction of infinite repeatability was limited without explicit cues.
  • Participants verbalized knowledge of sequence fragments, not underlying structure.

Conclusions:

  • Artificial grammar learning of recursive rules is possible but relies on pattern recognition.
  • Explicit cues may be necessary to grasp abstract properties like infinite repeatability.
  • Implicit learning of complex structures may not lead to articulable knowledge of underlying rules.