Graph-structured Stack and natural language parsing

  • Authors:
  • Masaru Tomita

  • Affiliations:
  • Carnegie-Mellon University, Pittsburgh, PA

  • Venue:
  • ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

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, categorial grammar and principle-based parsing. The relationship between the graph-structured stack and a chart in chart parsing is also discussed.