Context-free parsing with connectionist networks
- 1 January 1986
- proceedings article
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 151 (1) , 140-145
- https://doi.org/10.1063/1.36271
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(n 3) units needed to parse inputs of length up to n.Keywords
This publication has 0 references indexed in Scilit: