Paper: How To Invert A Natural Language Parser Into An Efficient Generator: An Algorithm For Logic Grammars

ACL ID C90-2060
Title How To Invert A Natural Language Parser Into An Efficient Generator: An Algorithm For Logic Grammars
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1990
Authors

The use of a single grammar in natural language pars- ing and generation is most desirable for variety of rea- sons including efficiency, perspicuity, integrity, robust- hess, and a certain,amount of elegance. In this paper we present an algorithm for automated inversion of a PROLOG-coded unification parser into an efficient unification generator, using the collections of minimal sets of essential arguments (MSEA) for predicates. The algorithm is also applicable to more abstract sys- tems for writing logic grammars, such as DCG.