Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Semantic-head-driven generation
Computational Linguistics
An extended LR parsing algorithm for grammars using feature-based syntactic categories
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Constraint-based Categorial Grammar
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
DISCO: an HPSG-based NLP system and its application for appointment scheduling
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
How to invert a natural language parser into an efficient generator: an algorithm for logic grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Applying explanation-based learning to control and speeding-up natural language generation
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Offline compilation of chains for head-driven generation with constraint-based grammars
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Hi-index | 0.00 |
A method is given that "inverts" a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string LR-compiling techniques are used to allow a recursive-descent generation algorithm to perform "functor merging" much in the same way as an LR parser performs prefix merging. This is an improvement on the semantic-head-driven generator that results in a much smaller search space. The amount of semantic lookahead can be varied, and appropriate tradeoff points between table size and resulting nondeterminism can be found automatically.