Automated inversion of logic grammars for generation

Authors:
Tomek Strzalkowski;Ping Peng
Affiliations:
New York University, New York, NY;New York University, New York, NY
Venue:
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Year:
1990

Citing 8
Cited 1

Text generation: using discourse strategies and focus constraints to generate natural language text

Text generation: using discourse strategies and focus constraints to generate natural language text
Negation and control in Prolog

Negation and control in Prolog
Static inference of modes and data dependencies in logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Natural Language Information Processing: A Computer Grammmar of English and Its Applications

Natural Language Information Processing: A Computer Grammmar of English and Its Applications
Using focus to generate complex and simple sentences

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for 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
A uniform architecture for parsing and generation

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Generation as structure driven derivation

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOG programs are derived by an off-line compilation process: a parser and a generator for this language. The centerpiece of the system is the inversion algorithm designed to compute the generator code from the parser's PROLOG code, using the collection of minimal sets of essential arguments (MSEA) for predicates. The system has been implemented to work with Definite Clause Grammars (DCG) and is a part of an English-Japanese machine translation project currently under development at NYU's Courant Institute.