In text generation, various kinds of choices need to be decided. In conventional frameworks, which we call one-path generation frameworks, choices are made in an order carefully designed in advance. In general, however, since choices depend on one another, it is difficult to make optimal decisions in such frameworks. Our approach to this issue is to introduce the revision process into the overall generation process. In our framework, revision of output texts is realized as dependency-directed backtracking (DDB). As well as Justification-based Truth Maintenance System (JTMS), we maintain dependencies among choices in a dependency network. In this paper,we propose an efficient implementation of DDB for text generation using functional unification grammar (FUG). We use bindings of logical variables in Prolog and destructive argument substitutions to decrease the overhead of handling a dependency network. This paper describes the algorithm in detail and shows the results of preliminary experiments to demonstrate the performance of our implementation.
ASJC Scopus subject areas
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications