More than Classification: A Unified Framework for Event Temporal Relation Extraction

• URL: http://arxiv.org/abs/2305.17607v1
• Date: Sun, 28 May 2023 02:09:08 GMT
• Title: More than Classification: A Unified Framework for Event Temporal Relation Extraction
• Authors: Quzhe Huang, Yutong Hu, Shengqi Zhu, Yansong Feng, Chang Liu, Dongyan Zhao
• Abstract summary: Event temporal relation extraction(ETRE) is usually formulated as a multi-label classification task. We observe that all relations can be interpreted using the start and end time points of events. We propose a unified event temporal relation extraction framework, which transforms temporal relations into logical expressions of time points.
• Score: 61.44799147458621
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Event temporal relation extraction~(ETRE) is usually formulated as a multi-label classification task, where each type of relation is simply treated as a one-hot label. This formulation ignores the meaning of relations and wipes out their intrinsic dependency. After examining the relation definitions in various ETRE tasks, we observe that all relations can be interpreted using the start and end time points of events. For example, relation \textit{Includes} could be interpreted as event 1 starting no later than event 2 and ending no earlier than event 2. In this paper, we propose a unified event temporal relation extraction framework, which transforms temporal relations into logical expressions of time points and completes the ETRE by predicting the relations between certain time point pairs. Experiments on TB-Dense and MATRES show significant improvements over a strong baseline and outperform the state-of-the-art model by 0.3\% on both datasets. By representing all relations in a unified framework, we can leverage the relations with sufficient data to assist the learning of other relations, thus achieving stable improvement in low-data scenarios. When the relation definitions are changed, our method can quickly adapt to the new ones by simply modifying the logic expressions that map time points to new event relations. The code is released at \url{https://github.com/AndrewZhe/A-Unified-Framework-for-ETRE}.

Related papers

• Only One Relation Possible? Modeling the Ambiguity in Event Temporal Relation Extraction [30.319025749352246]
  Event Temporal Relation Extraction (ETRE) aims to identify the temporal relationship between two events. We propose a multi-label classification solution for ETRE (METRE) to infer the possibility of each temporal relation independently. Our method can effectively utilize the textitVague instances to improve the recognition for specific temporal relations.
  arXiv  Detail & Related papers  (2024-08-14T07:57:51Z)
• GraphERE: Jointly Multiple Event-Event Relation Extraction via Graph-Enhanced Event Embeddings [1.3154296174423619]
  Event-Event Relation Extraction is critical to understand natural language. This paper proposes a jointly multiple ERE framework called GraphERE based on Graph-enhanced Event Embeddings.
  arXiv  Detail & Related papers  (2024-03-19T07:50:32Z)
• ProtoEM: A Prototype-Enhanced Matching Framework for Event Relation Extraction [69.74158631862652]
  Event Relation Extraction (ERE) aims to extract multiple kinds of relations among events in texts. Existing methods singly categorize event relations as different classes, which are inadequately capturing the intrinsic semantics of these relations. We propose a Prototype-Enhanced Matching (ProtoEM) framework for the joint extraction of multiple kinds of event relations.
  arXiv  Detail & Related papers  (2023-09-22T14:26:06Z)
• MAVEN-ERE: A Unified Large-scale Dataset for Event Coreference, Temporal, Causal, and Subevent Relation Extraction [78.61546292830081]
  We construct a large-scale human-annotated ERE dataset MAVEN-ERE with improved annotation schemes. It contains 103,193 event coreference chains, 1,216,217 temporal relations, 57,992 causal relations, and 15,841 subevent relations. Experiments show that ERE on MAVEN-ERE is quite challenging, and considering relation interactions with joint learning can improve performances.
  arXiv  Detail & Related papers  (2022-11-14T13:34:49Z)
• SERC: Syntactic and Semantic Sequence based Event Relation Classification [2.922007656878633]
  We propose a model that incorporates both temporal and causal features to perform causal relation classification. We use the syntactic structure of the text for identifying temporal and causal relations between two events from the text. We propose an LSTM based model for temporal and causal relation classification that captures the interrelations between the three encoded features.
  arXiv  Detail & Related papers  (2021-11-03T14:58:52Z)
• Learning Relation Prototype from Unlabeled Texts for Long-tail Relation Extraction [84.64435075778988]
  We propose a general approach to learn relation prototypes from unlabeled texts. We learn relation prototypes as an implicit factor between entities. We conduct experiments on two publicly available datasets: New York Times and Google Distant Supervision.
  arXiv  Detail & Related papers  (2020-11-27T06:21:12Z)
• Learning to Decouple Relations: Few-Shot Relation Classification with Entity-Guided Attention and Confusion-Aware Training [49.9995628166064]
  We propose CTEG, a model equipped with two mechanisms to learn to decouple easily-confused relations. On the one hand, an EGA mechanism is introduced to guide the attention to filter out information causing confusion. On the other hand, a Confusion-Aware Training (CAT) method is proposed to explicitly learn to distinguish relations.
  arXiv  Detail & Related papers  (2020-10-21T11:07:53Z)
• Predicting Event Time by Classifying Sub-Level Temporal Relations Induced from a Unified Representation of Time Anchors [10.67457147373144]
  We propose an effective method to decompose complex temporal relations into sub-level relations. Our approach outperforms the state-of-the-art decision tree model.
  arXiv  Detail & Related papers  (2020-08-14T16:30:07Z)
• Relation of the Relations: A New Paradigm of the Relation Extraction Problem [52.21210549224131]
  We propose a new paradigm of Relation Extraction (RE) that considers as a whole the predictions of all relations in the same context. We develop a data-driven approach that does not require hand-crafted rules but learns by itself the relation of relations (RoR) using Graph Neural Networks and a relation matrix transformer. Experiments show that our model outperforms the state-of-the-art approaches by +1.12% on the ACE05 dataset and +2.55% on SemEval 2018 Task 7.2.
  arXiv  Detail & Related papers  (2020-06-05T22:25:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.