GWAI '87 Proceedings of the 11th German Workshop on Artificial Intelligence
Computational complexity of current GPSG theory
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A simple reconstruction of GPSG
COLING '86 Proceedings of the 11th coference on Computational linguistics
Using constraints in a constructive version of GPSG
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
HLT '91 Proceedings of the workshop on Speech and Natural Language
Structure-driven generation from separate semantic representations
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A bidirectional model for natural language processing
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Using constraints in a constructive version of GPSG
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Term-rewriting as a basis for a uniform architecture in machine translation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
GPSG parsing, bidirectional charts, and connection graphs
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Towards convenient bi-directional grammar formalisms
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
Using the formalism of generalized phrase structure grammar (GPSG) in an NL system (e.g. for machine translation (MT) is promising since the modular structure of the formalism is very well suited to meet some particular needs of MT. However, it seems impossible to implement GPSG in its 1985 version straightforwardly. This would involve a vast overgeneration of structures as well as processes to filter out everything but the admissible tree(s). We therefore argue for a constructive version of GPSG where information is gathered in subsequent steps to produce syntactic structures. As a result, we consider it necessary to incorporate procedural aspects into the formalism in order to use it as a linguistic basis for NL parsing and generation. The paper discusses the major implications of such a modified view of GPSG.