Show simple item record

dc.contributor.authorShieber, Stuart
dc.date.accessioned2008-11-18T19:50:43Z
dc.date.issued1986
dc.identifier.citationStuart 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.en
dc.identifier.urihttp://nrs.harvard.edu/urn-3:HUL.InstRepos:2265287
dc.description.abstractLike 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.en
dc.description.sponsorshipEngineering and Applied Sciencesen
dc.language.isoen_USen
dc.publisherAssociation for Computational Linguisticsen
dc.relation.isversionofhttp://dx.doi.org/10.3115/991365.991427en
dash.licenseLAA
dc.titleA simple reconstruction of GPSGen
dc.typeConference Paper
dc.description.versionVersion of Record
dc.relation.journalProceedings of the 11th International Conference on Computational Linguisticsen
dash.depositing.authorShieber, Stuart
dc.identifier.doi10.3115/991365.991427*
dash.identifier.orcid0000-0002-7733-8195*
dash.contributor.affiliatedGoodridge, Andrew


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record