A simple reconstruction of GPSG
| Title: | A simple reconstruction of GPSG |
| Author: | Shieber, Stuart |
| Citation: | Stuart M. Shieber. A simple reconstruction of GPSG. In Proceedings of the 11th International Conference on Computational Linguistics, pages 211-216, Bonn, West Germany, August 25-29 1986. |
| Full Text & Related Files: |
Shieber_SimpleReconstruction.pdf (495.1Kb; PDF) 
|
| Abstract: | Like most linguistic theories, the theory of generalized phrase structure grammar (GPSG) has described language axiomatically, that is, as a set of universal and language-specific constraints on the well-formedness of linguistic elements of some sort. The coverage and detailed analysis of English grammar in the ambitious recent volume by Gazdar, Klein, Pullum, and Sag entitled Generalized Phrase Structure Grammar are impressive, in part because of the complexity of the axiomatic system developed by the authors. In this paper. We examine the possibility that simpler descriptions of the same theory can be achieved through a slightly different, albeit still axiomatic, method. Rather than characterize the well-formed trees directly, we progress in two stages by procedurally characterizing the well-formedness axioms themselves, which in turn characterize the trees. |
| Published Version: | http://dx.doi.org/10.3115/991365.991427 |
| 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:2265287 |
This item appears in the following Collection(s)
-
FAS Scholarly Articles [5128]
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)
