Paper: Using Restriction To Extend Parsing Algorithms For Complex-Feature-Based Formalisms

ACL ID P85-1018
Title Using Restriction To Extend Parsing Algorithms For Complex-Feature-Based Formalisms
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1985
Authors
  • Stuart M. Shieber (SRI International, Menlo Park CA; Stanford University, Stanford CA)

Such formalisms can be thought of by analogy to context-free grammars as generalizing the notion of nonterminal symbol from a finite domain of atomic elements to a possibly infinite domain of directed graph structures nf a certain sort. Unfortunately, in moving to an infinite nonterminal domain, standard methods of parsing may no longer be applicable to the formalism. Typically, the problem manifests itself,as gross inefficiency or ew, n nonterminat icm of the alg~,rit hms. In this paper, we discuss a solution to the problem of extending parsing algorithms to formalisms with possibly infinite nonterminal domains, a solution based on a general technique we call restriction. As a particular example of such an extension, we present a complete, correct, terminating extension of Earley's algori...