Jerry R. Hobbs, Douglas E. Appelt, & David Magerman
It is often assumed that when natural language processing meets the real world, the idea of aiming for complete and correct interpretations has to be abandoned.
An elementary outline of the theorem-proving approach to automatic program synthesis is given, without dwelling on technical details. The method is illustrated by the automatic construction of both recursive and iterative programs operating on natural numbers, lists, and trees.
Fernando C. N. Pereira, Douglas E. Appelt, & Paul Martin
This paper describes the design of a transportable natural language (NL) interface to databases and the constraints that transportability places on each components of such a system.
