%0 Conference Proceedings
%T Temporal Relations Annotation and Extrapolation Based on Semi-intervals and Boundig Relations
%A Pimentel, Alejandro
%A Bel Enguix, Gemma
%A Sierra Martínez, Gerardo
%A Montes, Azucena
%Y Scott, Donia
%Y Bel, Nuria
%Y Zong, Chengqing
%S Proceedings of the 28th International Conference on Computational Linguistics
%D 2020
%8 December
%I International Committee on Computational Linguistics
%C Barcelona, Spain (Online)
%F pimentel-etal-2020-temporal
%X The computational treatment of temporal relations is based on the work of Allen, who establishes 13 different types, and Freksa, who designs a cognitive procedure to manage them. Freksa’s notation is not widely used because, although it has cognitive and expressive advantages, it is too complex from the computational perspective. This paper proposes a system for the annotation and management of temporal relations that combines the richness and expressiveness of Freksa’s approach with the simplicity of Allen’s notation. Our method is summarized in the application of bounding relations, thanks to which it is possible to obtain the temporary representation of complete neighborhoods capable of representing vague temporal relations such as those that can be frequently found in a text. Such advantages are obtained without the need to greatly increase the complexity of the labeling process since the markup language is almost the same as TimeML, to which only a second temporary “relType”’ type label relationship is added. Our experiments show that the temporal relationships that present vagueness are in fact much more common than those in which a single relationship can be established precisely. For these reasons, our new labeling system achieves a more agreeable representation of temporal relations.
%R 10.18653/v1/2020.coling-main.294
%U https://aclanthology.org/2020.coling-main.294
%U https://doi.org/10.18653/v1/2020.coling-main.294
%P 3313-3323