Premium
TOWARD AN INTEGRATED GENERATION APPROACH WITH TREE‐ADJOINING GRAMMARS
Author(s) -
Harbusch Karin
Publication year - 1994
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1994.tb00018.x
Subject(s) - computer science , natural language generation , formalism (music) , grammar , natural language processing , tree adjoining grammar , artificial intelligence , natural language , mildly context sensitive grammar formalism , rule based machine translation , generative grammar , context free grammar , programming language , emergent grammar , linguistics , musical , art , philosophy , visual arts
Natural‐language generation has gained importance since AI systems have become more sophisticated and canned text can no longer serve the elaborate communicative tasks in such a system. In this paper, suggestions are presented to apply uniformly the formalism of tree‐adjoining grammar ( TAG ) for all tasks of natural‐language generation. Up to now plan‐based systems have been preferred for most of the processing during generation. Since the individual tasks of natural‐language generation are very different and complex; for example, the determination of the propositional structure of a text is described using the TAG formalism–extended by constraints and feature descriptions ( UCTAC ). Nevertheless, this paper proposes basic ideas for the generalization of applying a grammar formalism to natural‐language generation in order to build an overall integrated system for natural‐language generation. Finally, advantages of such a uniform model are discussed.