영문내용
(English Abstract) |
This paper presents a text-driven discourse analysis syste, called DPAS. DPAS constructs a discourse structrue by weaving together clauses in the text by finding discourse relations between a clause and the clauses in a context. The basic processng model of DPAS is based on the stack based model of discourse analysis suggested by Grosz and Sidner. We extend the model with dynamic programming method to handle various discourse ambiguitites effectviely and efficiently. We develop the idea of a cpntext space to keep all information of a context. DPAS parses a text by considering all possible discourse relations between a clause and a context. Since different discourse relations may result in different states of a context, DPAS maintains multiple context spaces for an ambiguous text. Since maintaining all interpretations until the whole text is processed requires too much computing resourses, DPAS uses the idea of depth-limited search to limit the search space. If there is more than one discourse relation between an input clause and a context, DPAS constructs context spaces-one context space for each discourse relation. Then, DPAS applies heuristics to choose the most desirable context spaces after it processes some more input clauses. Since the basic idea of DPAS is domain independent, although we used descriptive texts to demonstrate DPAS, we believe the idea of DPAS can be extended to understand other styles of texts. |
