Overgenerating Referring Expressions Involving Relations and Booleans

We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and negations. The focus of this paper is on generating referring expressions involving positive and negated relations. We describe rule-based overgeneration of referring expressions based on the notion of ‘extension’, and show how to constrain the search space by interleaving logical form generation with realization and expressing preferences by means of costs. Our chart-based framework allows us to develop a search-based solution to the problem of ‘recursive’ relations.