Principles and Implementation of Deductive Parsing
| dc.creator | Shieber, Stuart M. | |
| dc.creator | Schabes, Yves | |
| dc.creator | Pereira, Fernando C. N. | |
| dc.date | 1994-04-26 | |
| dc.date.accessioned | 2026-07-07T09:08:14Z | |
| dc.date.available | 2026-07-07T09:08:14Z | |
| dc.description | 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. | |
| dc.description | 69 pages, includes full Prolog code | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9404008 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9404008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/150648 | |
| dc.subject | Computation and Language | |
| dc.title | Principles and Implementation of Deductive Parsing | |
| dc.type | text |