Joint Event Extraction along Shortest Dependency Paths using Graph Convolutional Networks

• URL: http://arxiv.org/abs/2003.08615v1
• Date: Thu, 19 Mar 2020 07:48:38 GMT
• Title: Joint Event Extraction along Shortest Dependency Paths using Graph Convolutional Networks
• Authors: Ali Balali, Masoud Asadpour, Ricardo Campos, Adam Jatowt
• Abstract summary: Event extraction may be beneficial to several domains such as knowledge bases, question answering, information retrieval and summarization. The problem of extracting event information from texts is longstanding and usually relies on elaborately designed lexical and syntactic features. We propose a novel joint event extraction framework that aims to extract multiple event triggers and arguments simultaneously.
• Score: 18.983377030545128
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Event extraction (EE) is one of the core information extraction tasks, whose purpose is to automatically identify and extract information about incidents and their actors from texts. This may be beneficial to several domains such as knowledge bases, question answering, information retrieval and summarization tasks, to name a few. The problem of extracting event information from texts is longstanding and usually relies on elaborately designed lexical and syntactic features, which, however, take a large amount of human effort and lack generalization. More recently, deep neural network approaches have been adopted as a means to learn underlying features automatically. However, existing networks do not make full use of syntactic features, which play a fundamental role in capturing very long-range dependencies. Also, most approaches extract each argument of an event separately without considering associations between arguments which ultimately leads to low efficiency, especially in sentences with multiple events. To address the two above-referred problems, we propose a novel joint event extraction framework that aims to extract multiple event triggers and arguments simultaneously by introducing shortest dependency path (SDP) in the dependency graph. We do this by eliminating irrelevant words in the sentence, thus capturing long-range dependencies. Also, an attention-based graph convolutional network is proposed, to carry syntactically related information along the shortest paths between argument candidates that captures and aggregates the latent associations between arguments; a problem that has been overlooked by most of the literature. Our results show a substantial improvement over state-of-the-art methods.

Related papers

• Multi-modal Causal Structure Learning and Root Cause Analysis [67.67578590390907]
  We propose Mulan, a unified multi-modal causal structure learning method for root cause localization. We leverage a log-tailored language model to facilitate log representation learning, converting log sequences into time-series data. We also introduce a novel key performance indicator-aware attention mechanism for assessing modality reliability and co-learning a final causal graph.
  arXiv  Detail & Related papers  (2024-02-04T05:50:38Z)
• Explaining Interactions Between Text Spans [50.70253702800355]
  Reasoning over spans of tokens from different parts of the input is essential for natural language understanding. We introduce SpanEx, a dataset of human span interaction explanations for two NLU tasks: NLI and FC. We then investigate the decision-making processes of multiple fine-tuned large language models in terms of the employed connections between spans.
  arXiv  Detail & Related papers  (2023-10-20T13:52:37Z)
• Walking Down the Memory Maze: Beyond Context Limit through Interactive Reading [63.93888816206071]
  We introduce MemWalker, a method that processes the long context into a tree of summary nodes. Upon receiving a query, the model navigates this tree in search of relevant information, and responds once it gathers sufficient information. We show that, beyond effective reading, MemWalker enhances explainability by highlighting the reasoning steps as it interactively reads the text; pinpointing the relevant text segments related to the query.
  arXiv  Detail & Related papers  (2023-10-08T06:18:14Z)
• Retrieval-Augmented Generative Question Answering for Event Argument Extraction [66.24622127143044]
  We propose a retrieval-augmented generative QA model (R-GQA) for event argument extraction. It retrieves the most similar QA pair and augments it as prompt to the current example's context, then decodes the arguments as answers. Our approach outperforms substantially prior methods across various settings.
  arXiv  Detail & Related papers  (2022-11-14T02:00:32Z)
• Dynamic Global Memory for Document-level Argument Extraction [63.314514124716936]
  We introduce a new global neural generation-based framework for document-level event argument extraction. We use a document memory store to record the contextual event information and leverage it to implicitly and explicitly help with decoding of arguments for later events. Empirical results show that our framework outperforms prior methods substantially.
  arXiv  Detail & Related papers  (2022-09-18T23:45:25Z)
• CUP: Curriculum Learning based Prompt Tuning for Implicit Event Argument Extraction [22.746071199667146]
  Implicit event argument extraction (EAE) aims to identify arguments that could scatter over the document. We propose a Curriculum learning based Prompt tuning (CUP) approach, which resolves implicit EAE by four learning stages. In addition, we integrate a prompt-based encoder-decoder model to elicit related knowledge from pre-trained language models.
  arXiv  Detail & Related papers  (2022-05-01T16:03:54Z)
• Reinforcement Learning-based Dialogue Guided Event Extraction to Exploit Argument Relations [70.35379323231241]
  This paper presents a better approach for event extraction by explicitly utilizing the relationships of event arguments. We employ reinforcement learning and incremental learning to extract multiple arguments via a multi-turned, iterative process. Experimental results show that our approach consistently outperforms seven state-of-the-art event extraction methods.
  arXiv  Detail & Related papers  (2021-06-23T13:24:39Z)
• Event Argument Extraction using Causal Knowledge Structures [9.56216681584111]
  Event Argument extraction refers to the task of extracting structured information from unstructured text for a particular event of interest. Most of the existing works model this task at a sentence level, restricting the context to a local scope. We propose an external knowledge aided approach to infuse document-level event information to aid the extraction of complex event arguments.
  arXiv  Detail & Related papers  (2021-05-02T13:59:07Z)
• On Improving Deep Learning Trace Analysis with System Call Arguments [1.3299507495084417]
  Kernel traces are sequences of low-level events comprising a name and multiple arguments. We introduce a general approach to learning a representation of the event names along with their arguments using both embedding and encoding.
  arXiv  Detail & Related papers  (2021-03-11T19:26:34Z)
• MrGCN: Mirror Graph Convolution Network for Relation Extraction with Long-Term Dependencies [32.27755470353054]
  In relation extraction, dependency trees that contain rich syntactic clues have been widely used to help capture long-term dependencies in text. We propose the Mirror Graph Convolution Network (MrGCN), a GNN model with pooling-unpooling structures tailored to relation extraction. Experiments on two datasets demonstrate the effectiveness of our method, showing significant improvements over previous results.
  arXiv  Detail & Related papers  (2021-01-01T00:52:53Z)
• Document-Level Event Role Filler Extraction using Multi-Granularity Contextualized Encoding [40.13163091122463]
  Event extraction is a difficult task since it requires a view of a larger context to determine which spans of text correspond to event role fillers. We first investigate how end-to-end neural sequence models perform on document-level role filler extraction. We show that our best system performs substantially better than prior work.
  arXiv  Detail & Related papers  (2020-05-13T20:42:17Z)

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.