---

Next: Introduction

---

Abstract:

We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to which it is applicable. In particular, unlike an Earley-deduction generator [19], semantically nonmonotonic grammars can be used, yet unlike top-down methods, left-recursion is also permissible. The enabling design feature of the algorithm is its implicit traversal of the analysis tree for the string being generated in a semantic-head-driven fashion.

---

• Introduction
• Applicability of the Algorithm
• Problems with Existing Generators
  • Problems with Top-Down Generators
  • Problems with Bottom-up Generators
  • Source of the Problems
• The New Algorithm
  • A DCG Implementation
  • An Example
• Important Properties of the Algorithm
• Extensions
  • Completeness and Coherence
  • Quantifier Storage
  • Postponing Lexical Choice
• Further Research
• Acknowledgements
• References
• About this document ...

---

Gertjan van Noord
Thu Nov 24 18:39:44 MET 1994