How to realize a concept: Lexical selection and the conceptual network in text generation

Abstract

The task of natural language generation by computer requires a method for the selection of lexical items that refer to concepts. A generation system cannot assume that every concept will have an appropriate lexical entry associated with it. Similarly, a generation system must avoid redundant text and must strive for the most specific descriptions possible. This paper presents an algorithm for lexical selection that takes advantage of a conceptual network in which we represent the relationships between concepts (such as which concepts subsume each other and what differentiates concepts at different levels of generality). When the algorithm chooses a lexical realization for a concept, it first checks to see if the concept to be expressed is associated with a lexical entry. If so, that entry is used. If the concept does not have the appropriate lexical associations, the algorithm generates a phrase with a more general head term and restrictive modifiers. It does this by using the conceptual network to compute a semantically appropriate head term, and then modifying the request for generation by adding restrictions that differentiate the concept associated with the head term from the concept initially requested. Similarly, the conceptual network is used to eliminate redundant modifiers by computing the information contained in a lexical item that is chosen as a head term. Here the algorithm modifies the generation request to avoid restating the extra information. This algorithm is being implemented within Penman, a computerized system for the generation of English text from statements in a first-order predicate calculus language.