OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Semantic-head-driven generation
Computational Linguistics
Parsing and generation of unification grammars
Parsing and generation of unification grammars
Reversible Grammar in Natural Language Processing
Reversible Grammar in Natural Language Processing
PROLOG and Natural Language Analysis
PROLOG and Natural Language Analysis
Bidirectional grammars and the design of natural language generation systems
TINLAP '87 Proceedings of the 1987 workshop on Theoretical issues in natural language processing
Comparing two grammar-based generation algorithms: a case study
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
A symmetrical approach to parsing and generation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Syntactic-head-driven generation
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
A computational treatment of lexical rules in HPSG as covariation in lexical entries
Computational Linguistics
PGF: A Portable Run-time Format for Type-theoretical Grammars
Journal of Logic, Language and Information
| Hi-index | 0.00 |
A novel approach to HPSG based natural language processing is described that uses an off-line compiler to automatically prime a declarative grammar for generation or parsing, and inputs the primed grammar to an advanced Earley-style processor. This way we provide an elegant solution to the problems with empty heads and efficient bidirectional processing which is illustrated for the special case of HPSG generation. Extensive testing with a large HPSG grammar revealed some important constraints on the form of the grammar.