Abstract
A general device for handling nondeterminism in stack operations is described. The device, called a Graph-structured Stack, can eliminate duplication of operations throughout the nondeterministic processes. This paper then applies the graph-structured stack to various natural language parsing methods, including ATN, LR parsing, categoriai grammar and principle-based parsing. The relationship between the graph-structured stack and a chart in chart parsing is also discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 249-257 |
| Number of pages | 9 |
| Journal | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
| Volume | 1988-June |
| Publication status | Published - 1988 |
| Externally published | Yes |
| Event | 26th Annual Meeting of the Association for Computational Linguistics, ACL 1988 - Buffalo, United States Duration: 1988 Jun 7 → 1988 Jun 10 |
ASJC Scopus subject areas
- Computer Science Applications
- Linguistics and Language
- Language and Linguistics