Abstract
Probably the best current algorithm for generating definite descriptions is the Incremental Algorithm due to Dale and Reiter. If we want to use this algorithm in a Concept-to-Speech system, however, we encounter two limitations: (i) the algorithm is insensitive to the linguistic context and thus always produces the same description for an object, (ii) the output is a list of properties which uniquely determine one object from a set of objects: how this list is to be expressed in spoken natural language is not addressed. We propose a modification of the Incremental Algorithm based on the idea that a definite description refers to the most salient element in the current context satisfying the descriptive content. We show that the modified algorithm allows for the context-sensitive generation of both distinguishing and anaphoric descriptions, while retaining the attractive properties of Dale and Reiter's original algorithm.
Original language | English |
---|---|
Publication status | Published - 1998 |
Externally published | Yes |
Event | 5th International Conference on Spoken Language Processing, ICSLP 1998 - Sydney, Australia Duration: 30 Nov 1998 → 4 Dec 1998 Conference number: 5 |
Conference
Conference | 5th International Conference on Spoken Language Processing, ICSLP 1998 |
---|---|
Abbreviated title | ICSLP |
Country/Territory | Australia |
City | Sydney |
Period | 30/11/98 → 4/12/98 |