抄録
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.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 249-257 |
| ページ数 | 9 |
| ジャーナル | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
| 巻 | 1988-June |
| 出版ステータス | Published - 1988 |
| 外部発表 | はい |
| イベント | 26th Annual Meeting of the Association for Computational Linguistics, ACL 1988 - Buffalo, United States 継続期間: 1988 6月 7 → 1988 6月 10 |
ASJC Scopus subject areas
- コンピュータ サイエンスの応用
- 言語学および言語
- 言語および言語学