Perruchet Pierre, Tyler Michael D, Galland Nadine, Peereman Ronald
Laboratory for the Study of Learning and Development/National Center for Scientific Research (LEAD/CNRS), University of Bourgogne, Dijon, France.
J Exp Psychol Gen. 2004 Dec;133(4):573-83. doi: 10.1037/0096-3445.133.4.573.
Is it possible to learn the relation between 2 nonadjacent events? M. Pena, L. L. Bonatti, M. Nespor, and J. Mehler (2002) claimed this to be possible, but only in conditions suggesting the involvement of algebraic-like computations. The present article reports simulation studies and experimental data showing that the observations on which Pena et al. grounded their reasoning were flawed by deep methodological inadequacies. When the invalid data are set aside, the available evidence fits exactly with the predictions of a theory relying on ubiquitous associative mechanisms. Because nonadjacent dependencies are frequent in natural language, this reappraisal has far-reaching implications for the current debate on the need for rule-based computations in human adaptation to complex structures.
是否有可能了解两个不相邻事件之间的关系?M. 佩纳、L. L. 博纳蒂、M. 内斯波尔和J. 梅勒(2002年)声称这是可能的,但仅在暗示类似代数计算参与的条件下。本文报告了模拟研究和实验数据,表明佩纳等人推理所依据的观察结果存在严重的方法缺陷。当无效数据被搁置一旁时,现有证据与依赖普遍存在的联想机制的理论预测完全吻合。由于非相邻依赖性在自然语言中很常见,这种重新评估对当前关于人类适应复杂结构时基于规则计算必要性的辩论具有深远影响。