The Community for Technology Leaders
Temporal Representation and Reasoning, International Syposium on (1996)
Key west, Florida
May 19, 1996 to May 20, 1996
ISBN: 0-8186-7528-4
pp: 217
R. Guillen , Dept. of Comput. Sci., New Mexico State Univ., Las Cruces, NM, USA
D. Farwell , Dept. of Comput. Sci., New Mexico State Univ., Las Cruces, NM, USA
J. Wiebe , Dept. of Comput. Sci., New Mexico State Univ., Las Cruces, NM, USA
ABSTRACT
Handling temporal information has been a main concern of areas such as natural language processing, planning and knowledge representation. In scheduling dialogues in a machine translation (MT) system whose goal is setting up a meeting, temporal reference is central, and the relations between temporal expressions contain much of the ellipsis and anaphora to be resolved. As a consequence, filling in missing information contributes to the understanding of the text. In this paper, we first identify the various binary relations present in this kind of dialogue, characterize them, and, finally, present a mechanism for processing with temporal relations that is based on using the constraints found during the analysis.
INDEX TERMS
language translation; temporal relations; dialogue scheduling; natural language processing; planning; knowledge representation; machine translation system; meeting setting up; temporal reference; temporal expressions; ellipsis; anaphora resolution; missing information; text understanding; binary relations; constraints
CITATION

D. Farwell, J. Wiebe and R. Guillen, "Handling temporal relations in scheduling dialogues for an MT system," Temporal Representation and Reasoning, International Syposium on(TIME), Key west, Florida, 1996, pp. 217.
doi:10.1109/TIME.1996.555703
97 ms
(Ver 3.3 (11022016))