The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Feature structures and nonmonotonicity
Computational Linguistics - Special issue on inheritance: I
A practical approach to multiple default inheritance for unification-based lexicons
Computational Linguistics - Special issue on inheritance: II
Default representation in constraint-based frameworks
Computational Linguistics
Bidirectional grammars and the design of natural language generation systems
TINLAP '87 Proceedings of the 1987 workshop on Theoretical issues in natural language processing
Revised generalized phrase structure grammar
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A model for transfer control in the METAL MT-System
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Software support for practical grammar development
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A constructive view of GPSG or how to make it work
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Using constraints in a constructive version of GPSG
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
A lexicalist account of Icelandic case marking
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A formalism and environment for the development of a large grammar of English
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Toward the formal verification of a unification system
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Toward the formal verification of a unification system
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Well-formed default unification in non-deterministic multiple inheritance hierarchies
IWCS-8 '09 Proceedings of the Eighth International Conference on Computational Semantics
| Hi-index | 0.00 |
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 [2] 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, Rither 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.