Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Grammar bidirectionality through controlled backward deduction
Logic and logic grammars for language processing
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Computational Linguistics
A semantic-head-driven generation algorithm for unification-based formalisms
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
CRITTER: a translation system for agricultural market reports
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Inheritance and constraint-based grammar formalisms
Computational Linguistics - Special issue on inheritance: I
Proceedings of the 11th international conference on World Wide Web
Off-line optimization for Earley-style HPSG processing
EACL '95 Proceedings of the seventh 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
Head corner parsing for discontinuous constituency
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Comparing two grammar-based generation algorithms: a case study
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Universal guides and finiteness and symmetry of grammar processing algorithms
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A simple transformation for offline-parsable grammars and its termination properties
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Syntactic-head-driven generation
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Towards computer-aided linguistic engineering
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Representing conceptual and linguistic knowledge for multi-lingual generation in a technical domain
INLG '94 Proceedings of the Seventh International Workshop on Natural Language Generation
Hi-index | 0.00 |
Lexical Grammars are a class of unification grammars which share a fixed rule component, for which there exists a simple left-recursion elimination transformation. The parsing and generation programs are seen as two dual non-left-recursive versions of the original grammar, and are implemented through a standard top-down Prolog interpreter. Formal criteria for termination are given as conditions on lexical entries: during parsing as well as during generation the processing of a lexical entry consumes some amount of a guide; the guide used for parsing is a list of words remaining to be analyzed, while the guide for generation is a list of the semantics of constituents waiting to be generated.