GraphERE: Jointly Multiple Event-Event Relation Extraction via Graph-Enhanced Event Embeddings

• URL: http://arxiv.org/abs/2403.12523v1
• Date: Tue, 19 Mar 2024 07:50:32 GMT
• Title: GraphERE: Jointly Multiple Event-Event Relation Extraction via Graph-Enhanced Event Embeddings
• Authors: Haochen Li, Di Geng,
• Abstract summary: 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.
• Score: 1.3154296174423619
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Events describe the state changes of entities. In a document, multiple events are connected by various relations (e.g., Coreference, Temporal, Causal, and Subevent). Therefore, obtaining the connections between events through Event-Event Relation Extraction (ERE) is critical to understand natural language. There are two main problems in the current ERE works: a. Only embeddings of the event triggers are used for event feature representation, ignoring event arguments (e.g., time, place, person, etc.) and their structure within the event. b. The interconnection between relations (e.g., temporal and causal relations usually interact with each other ) is ignored. To solve the above problems, this paper proposes a jointly multiple ERE framework called GraphERE based on Graph-enhanced Event Embeddings. First, we enrich the event embeddings with event argument and structure features by using static AMR graphs and IE graphs; Then, to jointly extract multiple event relations, we use Node Transformer and construct Task-specific Dynamic Event Graphs for each type of relation. Finally, we used a multi-task learning strategy to train the whole framework. Experimental results on the latest MAVEN-ERE dataset validate that GraphERE significantly outperforms existing methods. Further analyses indicate the effectiveness of the graph-enhanced event embeddings and the joint extraction strategy.

Related papers

• Open-Domain Hierarchical Event Schema Induction by Incremental Prompting and Verification [81.17473088621209]
  We treat event schemas as a form of commonsense knowledge that can be derived from large language models (LLMs) We design an incremental prompting and verification method to break down the construction of a complex event graph into three stages. Compared to directly using LLMs to generate a linearized graph, our method can generate large and complex schemas with 7.2% F1 improvement in temporal relations and 31.0% F1 improvement in hierarchical relations.
  arXiv  Detail & Related papers  (2023-07-05T01:00:44Z)
• JSEEGraph: Joint Structured Event Extraction as Graph Parsing [4.254099382808598]
  JSEEGraph is a graph-based event extraction framework. It encodes entities and events in a single semantic graph. It can handle nested event structures, that it is beneficial to solve different IE tasks jointly, and that event argument extraction in particular benefits from entity extraction.
  arXiv  Detail & Related papers  (2023-06-26T12:12:54Z)
• More than Classification: A Unified Framework for Event Temporal Relation Extraction [61.44799147458621]
  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.
  arXiv  Detail & Related papers  (2023-05-28T02:09:08Z)
• 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)
• EventGraph: Event Extraction as Semantic Graph Parsing [5.21480688623047]
  Event extraction involves the detection and extraction of both the event triggers and corresponding event arguments. We propose EventGraph, a joint framework for event extraction, which encodes events as graphs. Our code and models are released as open-source.
  arXiv  Detail & Related papers  (2022-10-16T22:11:46Z)
• Unifying Event Detection and Captioning as Sequence Generation via Pre-Training [53.613265415703815]
  We propose a unified pre-training and fine-tuning framework to enhance the inter-task association between event detection and captioning. Our model outperforms the state-of-the-art methods, and can be further boosted when pre-trained on extra large-scale video-text data.
  arXiv  Detail & Related papers  (2022-07-18T14:18:13Z)
• RAAT: Relation-Augmented Attention Transformer for Relation Modeling in Document-Level Event Extraction [16.87868728956481]
  We propose a new DEE framework which can model the relation dependencies, called Relation-augmented Document-level Event Extraction (ReDEE) To further leverage relation information, we introduce a separate event relation prediction task and adopt multi-task learning method to explicitly enhance event extraction performance.
  arXiv  Detail & Related papers  (2022-06-07T15:11:42Z)
• EA$^2$E: Improving Consistency with Event Awareness for Document-Level Argument Extraction [52.43978926985928]
  We introduce the Event-Aware Argument Extraction (EA$2$E) model with augmented context for training and inference. Experiment results on WIKIEVENTS and ACE2005 datasets demonstrate the effectiveness of EA$2$E.
  arXiv  Detail & Related papers  (2022-05-30T04:33:51Z)
• A Graph Enhanced BERT Model for Event Prediction [35.02248467245135]
  We consider automatically building of event graph using a BERT model. We incorporate an additional structured variable into BERT to learn to predict the event connections in the training process. Results on two event prediction tasks: script event prediction and story ending prediction, show that our approach can outperform state-of-the-art baseline methods.
  arXiv  Detail & Related papers  (2022-05-22T13:37:38Z)
• Learning Temporal Rules from Noisy Timeseries Data [72.93572292157593]
  We focus on uncovering the underlying atomic events and their relations that lead to the composite events within a noisy temporal data setting. We propose a Neural Temporal Logic Programming (Neural TLP) which first learns implicit temporal relations between atomic events and then lifts logic rules for supervision.
  arXiv  Detail & Related papers  (2022-02-11T01:29:02Z)

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.