2020
DOI: 10.48550/arxiv.2003.05171
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Vector symbolic architectures for context-free grammars

Abstract: Background / introduction. Vector symbolic architectures (VSA) are a viable approach for the hyperdimensional representation of symbolic data, such as documents, syntactic structures, or semantic frames. Methods. We present a rigorous mathematical framework for the representation of phrase structure trees and parse-trees of context-free gram-

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 40 publications
0
3
0
Order By: Relevance
“…There is ample work demonstrating that VSA possesses a rich computational expressiveness, from the functionality of neural networks , [Kleyko et al, 2020a], , [Frady et al, 2018b] to machine learning tasks [Recchia et al, 2015], [Rasanen and Saarinen, 2016], , [Rahimi et al, 2019] and cognitive modeling [Slipchenko and Rachkovskij, 2009], [Rachkovskij et al, 2013], [Eliasmith, 2013], [Rachkovskij and Slipchenko, 2012], [Emruli et al, 2013], [Kleyko et al, 2015]. Further, VSA can express conventional algorithms, for example, finite state automata , [Yerxa et al, 2018] and context-free grammars [beim Graben et al, 2020].…”
Section: Motivationmentioning
confidence: 99%
See 1 more Smart Citation
“…There is ample work demonstrating that VSA possesses a rich computational expressiveness, from the functionality of neural networks , [Kleyko et al, 2020a], , [Frady et al, 2018b] to machine learning tasks [Recchia et al, 2015], [Rasanen and Saarinen, 2016], , [Rahimi et al, 2019] and cognitive modeling [Slipchenko and Rachkovskij, 2009], [Rachkovskij et al, 2013], [Eliasmith, 2013], [Rachkovskij and Slipchenko, 2012], [Emruli et al, 2013], [Kleyko et al, 2015]. Further, VSA can express conventional algorithms, for example, finite state automata , [Yerxa et al, 2018] and context-free grammars [beim Graben et al, 2020].…”
Section: Motivationmentioning
confidence: 99%
“…Note that the primitives for stacks and finite-state automata can be combined to create such computational models as deterministic pushdown automata or stack machines; see, e.g., [Yerxa et al, 2018] for a sketch of a stack machine operating with hypervectors. An alternative representation for pushdown automata and context-free grammars has been recently presented in [beim Graben et al, 2020].…”
Section: ) Binary Treesmentioning
confidence: 99%
“…Transformations of pushdown automata and context-free grammars to HVs have been presented in [beim Graben et al, 2020]. A proposal for implementing Turing machines and cellular automata was given in [Kleyko et al, 2021a].…”
Section: Deterministic Behavior With Hdc/vsamentioning
confidence: 99%