Temporal Relation Extraction with a Graph-Based Deep Biaffine Attention Model
Temporal information extraction plays a critical role in natural language understanding. Previous systems have incorporated advanced neural language models and have successfully enhanced the accuracy of temporal information extraction tasks. However, these systems have two major shortcomings. First, they fail to make use of the two-sided nature of temporal relations in prediction. Second, they involve non-parallelizable pipelines in inference process that bring little performance gain. To this end, we propose a novel temporal information extraction model based on deep biaffine attention to extract temporal relationships between events in unstructured text efficiently and accurately. Our model is performant because we perform relation extraction tasks directly instead of considering event annotation as a prerequisite of relation extraction. Moreover, our architecture uses Multilayer Perceptrons (MLP) with biaffine attention to predict arcs and relation labels separately, improving relation detecting accuracy by exploiting the two-sided nature of temporal relationships. We experimentally demonstrate that our model achieves state-of-the-art performance in temporal relation extraction.
Code (0)
등록된 구현이 없습니다.
Tasks
Natural Language UnderstandingRelationRelation ExtractionTemporal Information ExtractionTemporal Relation ExtractionSimilar Papers 제목 키워드 기반
End-to-end neural relation extraction using deep biaffine attention
We propose a neural network model for joint extraction of named entities and relations between them, without any hand-crafted features. The key contribution of our model is to extend a BiLSTM-CRF-based entity recognition…
General ClassificationRelationRelation ClassificationRelation ExtractionEnd-to-End Argument Mining as Biaffine Dependency Parsing
Non-neural approaches to argument mining (AM) are often pipelined and require heavy feature-engineering. In this paper, we propose a neural end-to-end approach to AM which is based on dependency parsing, in contrast to t…
Argument MiningDependency ParsingFeature EngineeringRelation+1Context-aware Biaffine Localizing Network for Temporal Sentence Grounding
This paper addresses the problem of temporal sentence grounding (TSG), which aims to identify the temporal boundary of a specific segment from an untrimmed video by a sentence query. Previous works either compare pre-def…
SentenceTemporal Sentence GroundingReduction of Parameter Redundancy in Biaffine Classifiers with Symmetric and Circulant Weight Matrices
Currently, the biaffine classifier has been attracting attention as a method to introduce an attention mechanism into the modeling of binary relations. For instance, in the field of dependency parsing, the Deep Biaffine …
Dependency ParsingKnowledge Augmented Entity and Relation Extraction for Legal Documents with Hypergraph Neural Network
With the continuous progress of digitization in Chinese judicial institutions, a substantial amount of electronic legal document information has been accumulated. To unlock its potential value, entity and relation extrac…
Information ExtractionRelation Extraction