Encoding Sequential Information in Semantic Space Models: Comparing Holographic Reduced Representation and Random Permutation
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
Circular convolution and random permutation have each been proposed as neurally plausible binding operators capable of encoding sequential information in semantic memory. We perform several controlled comparisons of circular convolution and random permutation as means of encoding paired associates as well as encoding sequential information. Random permutations outperformed convolution with respect to the number of paired associates that can be reliably stored in a single memory trace. Performance was equal on semantic tasks when using a small corpus, but random permutations were ultimately capable of achieving superior performance due to their higher scalability to large corpora. Finally, “noisy” permutations in which units are mapped to other units arbitrarily (no one-to-one mapping) perform nearly as well as true permutations. These findings increase the neurological plausibility of random permutations and highlight their utility in vector space models of semantics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Sparse coding with an overcomplete basis set: A strategy employed by V1?
Olshausen, B. A., & Field, D. J. (1997) · Vision Research · doi:10.1016/s0042-6989(97)00169-7 · Cited by 3,642
Reservoir computing approaches to recurrent neural network training
Lukoševičius, M., & Jaeger, H. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.03.005 · Cited by 2,956
Learning and development in neural networks: the importance of starting small
Elman, J. L. (1993) · Cognition · doi:10.1016/0010-0277(93)90058-4 · Cited by 1,988
Distributed representations, simple recurrent networks, and grammatical structure
Elman, J. L. (1991) · Machine Learning · doi:10.1007/bf00114844 · Cited by 1,354
A Distributed Representation of Temporal Context
Howard, M. W., & Kahana, M. J. (2002) · Journal of Mathematical Psychology · doi:10.1006/jmps.2001.1388 · Cited by 1,174 · cited 2×
“Gabriel Recchia,1 Magnus Sahlgren,2 Pentti Kanerva,3 and Michael N. Jones4 1University of Cambridge, Cambridge CB2 1TN, UK 2Swedish Institute of Computer Science, 164 29 Kista, Sweden 3Redwood Center for Theoretical Neuroscience, University of California, Berkeley, Berkeley, CA 94720, USA 4Indiana University, Blooming…”
BackgroundTopics in semantic representation
Griffiths, T. L., Steyvers, M., & Tenenbaum, J. B. (2007) · Psychological Review · doi:10.1037/0033-295x.114.2.211 · Cited by 1,122 · cited 3×
“More recent SSMs employ sophisticated learning mechanisms borrowed from probabilistic inference [18], holographic encoding [19], minimum description length [20], random indexing [21], and global memory retrieval [22].”
BackgroundMethodHolographic reduced representations
Plate, T. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.377968 · Cited by 657 · cited 1×
“BEAGLE uses the operation of circular convolution to bind together signal vectors into a holographic reduced representation (HRR; [95, 100]) of n-gram chunks that contain each target word.”
MethodStatistical Language Learning: Mechanisms and Constraints
Saffran, J. R. (2003) · Current Directions in Psychological Science · doi:10.1111/1467-8721.01243 · Cited by 624
Symbol Interdependency in Symbolic and Embodied Cognition
Louwerse, M. M. (2011) · Topics in Cognitive Science · doi:10.1111/j.1756-8765.2010.01106.x · Cited by 399 · cited 1×
“SSMs have also been criticized due to their inability to scale to realistic sizes of linguistic data [51, 52].”
BackgroundLearning and applying contextual constraints in sentence comprehension
St. John, M. F., & McClelland, J. L. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90008-n · Cited by 322
Cited by
Distributional Models of Word Meaning
Lenci, A. (2018) · Annual Review of Linguistics · doi:10.1146/annurev-linguistics-030514-125254 · Cited by 447
Classification using hyperdimensional computing: a review
Ge, L., & Parhi, K. K. (2020) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2020.2988388 · Cited by 227
Kleyko, D., Rachkovskij, D., Osipov, E., & Rahimi, A. (2023) · ACM Computing Surveys · doi:10.1145/3558000 · Cited by 141
Hyper-Dimensional Computing Challenges and Opportunities for AI Applications
Hassan, E., Halawani, Y., Mohammad, B., & Saleh, H. (2022) · IEEE Access · doi:10.1109/access.2021.3059762 · Cited by 61
Metadata
- Authors
- Recchia, G., Sahlgren, M., Kanerva, P., & Jones, M. N.
- Venue
- Computational Intelligence and Neuroscience
- Publisher
- Hindawi Limited
- Published
- 2015
- Volume
- 2015
- Pages
- 1-18
- ISSN
- 1687-5265 (ISSN-L)
- 1687-5273
- OpenAlex
- W2008264172
- Cited by
- 64
- References
- 12
- FWCI
- 6.26
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Encoding Sequential Information in Semantic Space Models: Comparing Holographic Reduced Representation and Random Permutation. https://app.cochat.ai/papers/10.1155/2015/986574
- The paper
- Recchia, G., Sahlgren, M., Kanerva, P., & Jones, M. N. (2015). Encoding Sequential Information in Semantic Space Models: Comparing Holographic Reduced Representation and Random Permutation. Computational Intelligence and Neuroscience. https://doi.org/10.1155/2015/986574
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.