A simple reconstruction of GPSG

作者: Stuart M. Sheiber

DOI: 10.3115/991365.991427

关键词:

摘要: Like most linguistic theories, the theory of generalized phrase structure grammar (GPSG) has described language axiomatically, that is, as a set universal and language-specific constraints on well-formedness elements some sort. The coverage detailed analysis English in ambitious recent volume by Gazdar, Klein, Pullum, Sag entitled Generalized Phrase Structure Grammar [2] are impressive, part because complexity axiomatic system developed authors. In this paper. We examine possibility simpler descriptions same can be achieved through slightly different, albeit still axiomatic, method, Rither than characterize well-formed trees directly, we progress two stages procedurally characterizing axioms themselves, which turn trees.

参考文章(4)
Ivan Sag, Ewan Klein, Geoffrey Pullum, Gerald Gazdar, Generalized Phrase Structure Grammar ,(1985)
Stuart M. Shieber, Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms meeting of the association for computational linguistics. pp. 145- 152 ,(1985) , 10.3115/981210.981228
Stuart M. Shieber, The Design of a Computer Language for Linguistic Information meeting of the association for computational linguistics. pp. 362- 366 ,(1984) , 10.3115/980491.980566
Fernando C. N. Pereira, Stuart M. Shieber, The Semantics of Grammar Formalisms Seen as Computer Languages meeting of the association for computational linguistics. pp. 123- 129 ,(1984) , 10.3115/980491.980518