Context-free parsing with connectionist networks
AIP conference proceedings1986Vol. 151, pp. 140–145
Citations Over TimeTop 10% of 1986 papers
Abstract
This paper presents a simple algorithm which converts any context‐free grammar into a connectionist network which parses strings (of arbitrary but fixed maximum length) in the language defined by that grammar. The network is fast, O(n), and deterministicd. It consists of binary units which compute a simple function of their input. When the grammar is put in Chomsky normal form, O(n3) units needed to parse inputs of length up to n.
Related Papers
- → Finding Structure in Time(1990)10,674 cited
- → Connectionism and cognitive architecture: A critical analysis(1988)4,024 cited
- → Massively Parallel Parsing: A Strongly Interactive Model of Natural Language Interpretation*(1985)432 cited
- → A connectionist approach to word sense disambiguation(2018)181 cited
- → Learning Internal Representations by Error Propagation(1985)16,191 cited