Skip to main content
Log in

The Complexity of Artificial Grammars

  • Published:
Nonlinear Dynamics, Psychology, and Life Sciences

Abstract

In experimental psychology, artificial grammars, generated by directed graphs, are used to test the ability of subjects to implicitly learn the structure of complex rules. We introduce the necessary notation and mathematics to view an artificial grammar as the sequence space of a dynamical system. The complexity of the artificial grammar is equated with the topological entropy of the dynamical system and is computed by finding the largest eigenvalue of an associated transition matrix. We develop the necessary mathematics and include relevant examples (one from the implicit learning literature) to show that topological entropy is easy to compute, well defined, and intuitive and, thereby, provides a quantitative measure of complexity that can be used to compare data across different implicit learning experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  • Adler, R., Konheim, A., & McAndrew, M. (1965). Topological entropy. Transactions of the American Mathematical Society, 114, 309-319.

    Google Scholar 

  • Blahut, R. E. (1988). Principles and practice of information theory. Reading, MA: Addison-Wesley.

    Google Scholar 

  • Cohen, A., Ivry, R. I., & Keele, S. W. (1990). Attention and structure in sequence learning. Journal of Experimental Psychology: Learning, Memmory, and Cognition, 16, 17-30.

    Google Scholar 

  • Gantmacher, F. R. (1974). The theory of matrices, Volume II. New York, NY: Chelsea Publishing, Co.

    Google Scholar 

  • Higham, P. A. (1997). Dissociations of Grammaticality and Specific Similarity Effects in Artificial Grammar Learning. Journal of Experimental Psychology: Learning, Memory, and Cognition, 23, 1029-1045.

    Google Scholar 

  • Mathews, R. C., Buss, R. R., Stanley, W. B., Blanchard-Fields, F., Cho, J. R., & Druhan, B. (1989). Role of implicit and explicit processes in learning from examples: a synergistic effect. Journal of Experimental Psychology: Learning, Memory, and Cognition, 15, 1083-1100.

    Google Scholar 

  • Reber, A. (1989). Implicit learning and tacit knowledge. Journal of Experimental Psychology: General, 118, 219-235.

    Google Scholar 

  • Reber, A. & Allen, R. (1978). Analogic and abstraction strategies in synthetic grammar learning: A functionalist interpretation. Cognition, 6, 193-221.

    Google Scholar 

  • Reed, J. M. & Johnson, P. J. (1994). Assessing implicit learning with indirect tests: Determining what is learned about sequence structure. Journal of Experimental Psychology: Learning, Memory, and Cognition, 20, 585-594.

    Google Scholar 

  • Reed, J. M. & Johnson, P. J. (1998). Implicit Learning: Methodological Issues and Evidence of Unique Characteristics. In Stadler, M. A. & Frensch, P. A. (Eds.), Handbook of Implicit Learning Thousand Oaks, CA: Sage Publications, Inc. 261-294.

    Google Scholar 

  • Robinson, C. (1995). Dynamical systems: Stability, symbolic dynamics, and chaos. Ann Arbor, MI: CRC Press.

    Google Scholar 

  • Shannon, C. E. (1948). The mathematical theory of Communications. Bell Systems Technical Journal, 27, 379-423.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bollt, E.M., Jones, M.A. The Complexity of Artificial Grammars. Nonlinear Dynamics Psychol Life Sci 4, 153–168 (2000). https://doi.org/10.1023/A:1009524428448

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009524428448

Navigation