Analyzing the RULEX model of category learning

Recent approaches to human category learning have often (re)invoked the notion of systematic search for good rules. The RULEX model of category learning is emblematic of this renewed interest in rule-based categorization, and is able to account for crucial findings previously thought to provide evidence in favor of prototype or exemplar models. However, a major difficulty in comparing RULEX to other models is that RULEX is framed in terms of a stochastic search process, with no analytic expressions available for its predictions. The result is that RULEX predictions can only be found through time consuming simulations, making model-fitting very difficult, and all but prohibiting more detailed investigations of the model. To remedy this problem, this paper describes an algorithmic method of calculating RULEX predictions that does not rely on numerical simulation, and yields some insight into the behavior of the model itself.