a1 Department of Computer Science, Memorial University of Newfoundland, St. John's, NL, A1B 3X5, Canada
a2 Nijmegen Institute for Cognition and Information, Radboud University Nijmegen, 6525HR Nijmegen, The Netherlands
a3 Department of Mathematics, Albert-Ludwigs-Universität Freiburg, 79098 Freiburg, Germany firstname.lastname@example.org http://www.cs.mun.ca/~harold email@example.com http://www.nici.ru.nl/~irisvr/ firstname.lastname@example.org http://home.mathematik.uni-freiburg.de/mueller/home.html
Leech et al. present a connectionist algorithm as a model of (the development) of analogizing, but they do not specify the algorithm's associated computational-level theory, nor its computational complexity. We argue that doing so may be essential for connectionist cognitive models to have full explanatory power and transparency, as well as for assessing their scalability to real-world input domains.