Rote learning is memorisation (Cohen & Feigenbaum 1982). A rote learning system does not need to do any processing to understand or interpret the information supplied by the environment. The only thing such systems do is memorise or store the incoming information for the later use.
An important study on rote learning was conducted by Samuel (1959;1967). He developed a checkers player program which was able to improve its performance by memorising every board position.
Elsom-Cook indicated that overlay student models and the bug library models are not far from a form of rote learning (Elsom-Cook, 1988).
Authored by Serengul Smith
E-mail to:
serengul1@mdx.ac.uk
School of Computing Science Middlesex University
Revised: September 1998