Context-Free Parsing in Connectionist Networks.
ROCHESTER UNIV NY DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
This paper presents a simple algorithm which converts any context-free grammar without epsilon productions into a connectionist network which parses strings of arbitrary but fixed maximum length in the language defined by that grammar. The network is fast and deterministic. Some modifications of the network are also explored, including parsing near misses, disambiguating and learning new productions dynamically. Author
- Computer Systems