论文标题
使用图卷积网络沿最短依赖性路径提取联合事件
Joint Event Extraction along Shortest Dependency Paths using Graph Convolutional Networks
论文作者
论文摘要
事件提取(EE)是核心信息提取任务之一,其目的是从文本中自动识别和提取有关事件及其参与者的信息。这可能对几个领域,例如知识基础,问题答案,信息检索和摘要任务,仅举几例。从文本中提取事件信息的问题是长期存在的,通常依赖于精心设计的词汇和句法特征,但是,这会付出大量的人类努力和缺乏概括。最近,采用了深层神经网络方法作为一种自动学习基础功能的手段。但是,现有网络并未充分利用句法特征,句法特征在捕获非常长的依赖性方面发挥了基本作用。同样,大多数方法分别提取事件的每个参数,而无需考虑最终导致低效率的参数之间的关联,尤其是在有多个事件的句子中。为了解决上述两个问题,我们提出了一个新颖的联合事件提取框架,旨在通过在依赖关系图中引入最短依赖关系路径(SDP)同时提取多个事件触发器和参数。我们通过消除句子中无关的单词来做到这一点,从而捕获长期依赖性。同样,提出了一个基于注意力图的卷积网络,以沿句法候选者之间的最短路径携带与句法相关的信息,这些信息捕获和汇总了参数之间的潜在关联;大多数文献都忽略了这个问题。我们的结果表明,对最先进的方法有了很大的改善。
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.