The connection machine
Sparse Distributed Memory
Unbounded dependency: tying strings to rings
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Distributed memory: a basis for chart parsing
COLING '86 Proceedings of the 11th coference on Computational linguistics
A modified sparse distributed memory model for extracting clean patterns from noisy inputs
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
| Hi-index | 0.00 |
This paper reports on an implementation of Kanerva's Sparse Distributed Memory for the Connection Machine. In order to accomplish a modular and adaptive software library we applied a plain object-oriented programming style to the Common Lisp extension ltsp. Some variations of the original model, the selected coordinate design, the hyperplane design, and a new general design, as well as the folded SDM due to Kanerva are realized. It has been necessary to elaborate a uniform presentation of the theoretical foundations the different designs are based on. We demonstrate the simulator's functionality with some simple applications. Runtime comparisons are given. We encourage the use of our simulation tool when outlining research topics of special interest to SDM.