Please use this identifier to cite or link to this item:
Title: Chunks hierarchies and retrieval structures: Comments on Saariluoma and Laine
Authors: Gobet, F
Keywords: Chunk;Template;CHREST;Saariluoma;Computational model;Perception;Memory;Learning;Chess;Power function;Power law;Random positions;Spatial proximity;Correlation heuristic;Laine;Frequency;Heuristic;Learning algorithm;Perceptual expertise
Issue Date: 2001
Publisher: Blackwell Publishing
Citation: Scandinavian Journal of Psychology, 42: 149-155. The definitive version is available at
Abstract: The empirical results of Saariluoma and Laine (in press) are discussed and their computer simulations are compared with CHREST, a computational model of perception, memory and learning in chess. Mathematical functions such as power functions and logarithmic functions account for Saariluoma and Laine's (in press) correlation heuristic and for CHREST very well. However, these functions fit human data well only with game positions, not with random positions. As CHREST, which learns using spatial proximity, accounts for the human data as well as Saariluoma and Laine's (in press) correlation heuristic, their conclusion that frequency-based heuristics match the data better than proximity-based heuristics is questioned. The idea of flat chunk organisation and its relation to retrieval structures is discussed. In the conclusion, emphasis is given to the need for detailed empirical data, including information about chunk structure and types of errors, for discriminating between various learning algorithms.
Appears in Collections:Psychology
Dept of Life Sciences Research Papers

Files in This Item:
File Description SizeFormat 
Saariluoma_Laine_reply.pdf85.73 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.