Principles and Implementation of Deductive Parsing
<|reference_start|>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.<|reference_end|>
@article{shieber1994principles,
    title={Principles and Implementation of Deductive Parsing},
    author={Stuart M. Shieber (Harvard University), Yves Schabes (Mitsubishi
  Electric Research Laboratories), and Fernando C. N. Pereira (AT&T Bell
  Laboratories)},
    journal={arXiv preprint arXiv:cmp-lg/9404008},
    year={1994},
    number={CRCT TR-11-94 (Computer Science Department, Harvard University)},
    archivePrefix={arXiv},
    eprint={cmp-lg/9404008},
    primaryClass={cmp-lg cs.CL}
}