How to invert a natural language parser into an efficient generator: An algorithm for logic grammars

The use of a single grammar in natural anguage 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, uch as DCG