Generating with discourse grammar

In this paper, we show how typed uniication based formalisms extended with arbitrary relations can be used to generate discourse. We start by presenting the speciic framework being used (discourse grammar), and we argue that it provides a natural setting for a computational analysis of intersentential phenomena such as ellipsis, anaphora and focus. We then show that it is possible for a discourse grammar to be neither monotonic nor declarative and further, that a discourse grammar is not guaranteed to terminate even when the set of solutions to be found is nite. Finally, we argue that despite these non properties, a generator can be developed which both preserves the intended meaning of the grammar and terminates.