Download Full Text

Citable link to this page

. . . . . .

Title:	Principles and implementation of deductive parsing
Author:	Shieber, Stuart; Pereira, Fernando C. N.; Schabes, Yves Note: Order does not necessarily reflect citation order of authors.
Citation:	Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2):3-36, July-August 1995. Also available as cmp-lg/9404008.
Full Text & Related Files:	infer.pdf (1.812Mb; PDF)
Abstract:	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.
Published Version:	http://dx.doi.org/10.1016/0743-1066(95)00035-I
Terms of Use:	This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page:	http://nrs.harvard.edu/urn-3:HUL.InstRepos:2031716

Show full Dublin Core record

This item appears in the following Collection(s)

• FAS Scholarly Articles [5171]
  Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University

Contact administrator regarding this item (to report mistakes or request changes)