DMCA
Principles and implementation of deductive parsing (1995)
Cached
Download Links
- [www.merl.com]
- [www.isi.edu]
- [people.deas.harvard.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [arxiv.org]
- [arxiv.org]
- [www.merl.com]
- [clwww.essex.ac.uk]
- [www.sfs.uni-tuebingen.de]
- [www.sfs.uni-tuebingen.de]
- [www.eecs.harvard.edu]
- [ftp.das.harvard.edu]
- [ftp.das.harvard.edu]
- [dash.harvard.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | JOURNAL OF LOGIC PROGRAMMING |
| Citations: | 190 - 5 self |
BibTeX
@ARTICLE{Shieber95principlesand,
author = {Stuart M. Shieber and Yves Schabes and Fernando C. N. Pereira},
title = {Principles and implementation of deductive parsing},
journal = {JOURNAL OF LOGIC PROGRAMMING},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
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 definiteclause 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.
