We present a system for generating parsers based directly on the metaphor of
parsing as deduction. Parsing algorithms can be represented directly as
deduction systems, and a single deduction engine can interpret such deduction
systems so as to implement the corresponding parser. The method generalizes
easily to parsers for augmented phrase structure formalisms, such as
definite-clause grammars and other logic grammar formalisms, and has been used
for rapid prototyping of parsing algorithms for a variety of formalisms
including variants of tree-adjoining grammars, categorial grammars, and
lexicalized context-free grammars.Comment: 69 pages, includes full Prolog cod

Pereira, Fernando C. N.

Schabes, Yves

Shieber, Stuart M.

The Journal of Logic Programming

English

arXiv

We present a system for generating parsers based directly on the  metaphor of parsing as deduction. Parsing algorithms can be represented  directly as deduction systems, and a single deduction engine can interpret  such deduction systems so as to implement the corresponding parser.  The method generalizes easily to parsers for augmented phrase structure  formalisms, such as definite-clause grammars and other logic grammar formalisms,  and has been used for rapid prototyping of parsing algorithms  for a variety of formalisms including variants of tree-adjoining grammars,  categorial grammars, and lexicalized context-free grammars

Stuart M. Shieber

Yves Schabes

Fernando C. N. Pereira

CiteSeerX

Principles and Implementation of Deductive Parsing

AbstractWe present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars and other logic grammar formalisms, and has been used for rapid prototyping of parsing algorithms for a variety of formalisms including variants of tree-adjoining grammars, categorial grammars, and lexicalized context-free grammars

Pereira, Fernando C.N.

Elsevier - Publisher Connector 

Principles and implementation of deductive parsing 

We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars and other logic grammar formalisms, and has been used for rapid prototyping of parsing algorithms for a variety of formalisms including variants of tree-adjoining grammars, categorial grammars, and lexicalized context-free grammars. This paper is available from the Center for Research in Computing Technology, Division of Applied Sciences, Harvard University as Technical Report TR-11-94. This draft is Revision: 1.9.1.1 of Date: 1994/04/26 22:59:29 .  1 Introduction  Parsing can be viewed as a deductive process that seeks to prove claims about the grammatical status of a string from assumptions de..

We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, and has been used for rapid protoyping of parsing algorithms for a variety of formalisms including variants of tree-adjoining grammars, categorial grammars, and lexicalized context-free grammars

Principles And Implementation Of Deductive Parsing

ly, this technique allows for staging the parsing into two phases, the second comprising a more fine-grained version of the first. Any staged processing of this sort can be implemented using this technique.  Finer control of execution order For certain applications, it may be necessary to obtain even finer control over the order in which the antecedent items and side conditions are checked when an inference rule is triggered. Given that the predicates  itemsinchart/2 and holds/1 perform a simple left-to-right checking of the items and side conditions, the implementation of matchingrule/5 above leads to the remaining antecedent items and side conditions being checked in left-to-right order as they appear in the encoded inference rules, and the side conditions being checked after the antecedent items. However, it may be preferable to interleave the checks for antecedents and for side conditions, perhaps in different orders depending on which antecedent triggered the rule. For instance, t..

Stuart Shieber

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.8728

Principles and Implementation of Deductive Parsing

Abstract

Similar works

Full text

Available Versions

CiteSeerX

Elsevier - Publisher Connector

CiteSeerX

Elsevier - Publisher Connector

CiteSeerX

CiteSeerX