Document-level legal relation extraction based on domain feature and dual self-distillation

Document-level relation extraction (DocRE) aims to infer complex semantic relations among entities in a document. Distant supervision (DS) is able to generate massive auto-labeled data, which can improve DocRE performance. Recent works leverage pseudo labels generated by the pre-denoising model to reduce noise in DS data. However, unreliable pseudo labels bring new noise, e.g., adding false pseudo labels and losing correct DS labels. Therefore, how to select effective pseudo labels to denoise DS data is still a challenge in document-level distant relation extraction. To tackle this issue, we introduce uncertainty estimation technology to determine whether pseudo labels can be trusted. In this work, we propose a Document-level distant Relation Extraction framework with Uncertainty Guided label denoising, UGDRE. Specifically, we propose a novel instance-level uncertainty estimation method, which measures the reliability of the pseudo labels with overlapping relations. By further considering the long-tail problem, we design dynamic uncertainty thresholds for different types of relations to filter high-uncertainty pseudo labels. We conduct experiments on two public datasets. Our framework outperforms strong baselines by 1.91 F1 and 2.28 Ign F1 on the RE-DocRED dataset.

DDI is an important part of drug-related research and pharmacovigilance. Extracting DDI information from scientific literature has become a low-cost and highly reliable way. Currently, existing works are all sentence-level DDI relation extraction. In fact, the entity relationship is often expressed by multiple sentences. Moreover, the sentence-level DDI relation extraction also causes a large amount of redundancy in the whole dataset with increasing in negative instance data. In this study, we propose a document-level DDI relation extraction method based on document-entity embedding. Our method performs special processing on the DDI Extraction 2013 for the first time, in order to calculate document-level relation extraction. For obtaining document-level entity information, we propose a document-entity embedding method to integrate the information of all same drugs in the same article. The experimental results show that the processing of DDI Extraction 2013 dataset is reasonable. In addition, the proposed method has achieved good performance on document-level DDI dataset, and the best F1 score is 62.51%. This is the first time that DDI Extraction 2013 has been processed into a document-level dataset, and document-level DDI relation extraction has been realized.

Dual-Channel and Hierarchical Graph Convolutional Networks for document-level relation extraction

In order to help researchers quickly understand the connection between new threat events and previous threat events, threat intelligence document-level relation extraction plays a very important role in threat intelligence text analysis and processing. Because there is no public document-level threat intelligence dataset, we create APTERC-DOC, an APT intelligence entities, relations and coreference dataset. We treat the relation extraction as a multi-classification task. Treating the coreference relation as a kind of predefined relations, we develop a joint learning framework called TIRECO, a model which can simultaneously complete threat intelligence relation extraction and coreference resolution. In order to solve the problem of document-level text being too long to extract feature, we propose the concept of sentence set, which transforms document-level relation extraction into inter-sentence relation extraction. To incorporate relevant information with maximally removing irrelevant content in sentence set, we further apply a novel pruning strategy (SDP-VP-SET) to the input trees considering that verbs are crucial in determining the relation between entities in sentence set. With retaining the shortest path and nodes that are K hops away from the shortest path, we give the edge connected to the verb nodes a weight of w times. Experimental results show that our model not only performs well in the extraction of inter-sentence relations, it is also effective in intra-sentence relations, and the F1 value has increased by 15.694%.

Relational distance and document-level contrastive pre-training based relation extraction model

Fenia Christopoulou, Makoto Miwa, Sophia Ananiadou. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.

Document-level relation extraction (DocRE) aims to extract relations among entities within a document, which is crucial for applications like knowledge graph construction. Existing methods usually assume that entities and their mentions are identified beforehand, which falls short of real-world applications. To overcome this limitation, we propose TaG, a novel table-to-graph generation model for joint extractionof entities and relations at document-level. To enhance the learning of task dependencies, TaG induces a latent graph among mentions, with different types of edges indicating different task information, which is further broadcast with a relational graph convolutional network. To alleviate the error propagation problem, we adapt the hierarchical agglomerative clustering algorithm to back-propagate task information at decoding stage. Experiments on the benchmark dataset, DocRED, demonstrate that TaG surpasses previous methods by a large margin and achieves state-of-the-art results.

Document-level relation extraction (RE) aims to extract relations among entities within a document, which is more complex than its sentence-level counterpart, especially in biomedical text mining. Chemical-disease relation (CDR) extraction aims to extract complex semantic relationships between chemicals and diseases entities in documents. In order to identify the relations within and across multiple sentences at the same time, existing methods try to build different document-level heterogeneous graph. However, the entity relation representations captured by these models do not make full use of the document information and disregard the noise introduced in the process of integrating various information. In this paper, we propose a novel model DAM-GAN to document-level biomedical RE, which can extract entity-level and mention-level representations of relation instances with R-GCN and Dual-Attention Multi-Instance Learning (DAM) respectively, and eliminate the noise with Generative Adversarial Network (GAN). Entity-level representations of relation instances model the semantic information of all entity pairs from the perspective of the whole document, while the mention-level representations from the perspective of mention pairs related to these entity pairs in different sentences. Therefore, entity- and mention-level representations can be better integrated to represent relation instances. Experimental results demonstrate that our model achieves superior performance on public document-level biomedical RE dataset BioCreative V Chemical Disease Relation(CDR).

Relation extraction aims to classify the relationships between two entities into pre-defined categories.While previous research has mainly focused on sentence-level relation extraction, recent studies have expanded the scope to document-level relation extraction.Traditional relation extraction methods heavily rely on human-annotated training data, which is timeconsuming and labor-intensive.To mitigate the need for manual annotation, recent weaklysupervised approaches have been developed for sentence-level relation extraction while limited work has been done on document-level relation extraction.Weakly-supervised documentlevel relation extraction faces significant challenges due to an imbalanced number "no relation" instances and the failure of directly probing pretrained large language models for document relation extraction.To address these challenges, we propose PromptRE, a novel weaklysupervised document-level relation extraction method that combines prompting-based techniques with data programming.Furthermore, PromptRE incorporates the label distribution and entity types as prior knowledge to improve the performance.By leveraging the strengths of both prompting and data programming, PromptRE achieves improved performance in relation classification and effectively handles the "no relation" problem.Experimental results on ReDocRED, a benchmark dataset for document-level relation extraction, demonstrate the superiority of PromptRE over baseline approaches.

This paper aims to study how to use remote monitoring for relation extraction, so as to identify the relationship between entities and provide logical facts. In recent years, document-level relation extraction (DocRE) has attracted much attention. Distant supervision (DS) has been playing an important role in sentence-level relation extraction (RE). Compared with traditional relation extraction methods, DS requires less data. However, the performance of document-level DS is limited by the noise in the long distant text. Previous DS works represent intra-sentential and inter-sentential representations in the same way, and neglect the difference between noise in them. This paper proposes an architecture called RDRS, which represents inter-sentence and intra-sentence relations in different ways, and uses a sentence-level relation model to represent document-level relations. The RDRS contains various modules, in which pairs of entities are separated according to the distribution of their mentions. In addition, this paper also improves the performance of inter-sentence representation by associating intra-sentence representation with inter-sentence representation. The experiments are carried out on Document-level Relation Extraction Dataset (DocRED). Experiments on DocRED show that the method has a significant improvement over the baseline. This model is better than previous models that represent inter-sentence and intra-sentence relations in the same way.

Document-level relation extraction with two-stage dynamic graph attention networks

Document-level relation extraction with entity mentions deep attention

Multi-granularity sequential neural network for document-level biomedical relation extraction

In document-level relation extraction (DocRE), graph structure is generally used to encode relation information in the input document to classify the relation category between each entity pair, and has greatly advanced the DocRE task over the past several years. However, the learned graph representation universally models relation information between all entity pairs regardless of whether there are relationships between these entity pairs. Thus, those entity pairs without relationships disperse the attention of the encoder-classifier DocRE for ones with relationships, which may further hind the improvement of DocRE. To alleviate this issue, we propose a novel encoder-classifier-reconstructor model for DocRE. The reconstructor manages to reconstruct the ground-truth path dependencies from the graph representation, to ensure that the proposed DocRE model pays more attention to encode entity pairs with relationships in the training. Furthermore, the reconstructor is regarded as a relationship indicator to assist relation classification in the inference, which can further improve the performance of DocRE model. Experimental results on a large-scale DocRE dataset show that the proposed model can significantly improve the accuracy of relation extraction on a strong heterogeneous graph-based baseline. The code is publicly available at https://github.com/xwjim/DocRE-Rec.

• We propose DOcument-level Relation Extraction optiMizing the long taIl (DOREMI), an iterative system tailored for long-tail relations to enhance the distantly supervised dataset through disagreement-driven annotations which, to our knowledge, is the first DocRE model featuring a human-in-the-loop strategy for denoising. • We demonstrate that measuring the disagreement between multiple models is a good proxy to identify Hard-To-Classify examples and yields substantial performance improvements with negligible human effort. • We release two Denoised Distantly Supervised Datasets (DDSs), one based on DocRED and one on Re-DocRED, which can be used to train any DocRE model. These DDSs greatly improve the prediction of long-tail relations and complement existing denoising approaches, as confirmed by our experimental evaluation. Document-Level Relation Extraction (DocRE) presents significant challenges due to its reliance on cross-sentence context and the long-tail distribution of relation types, where many relations have scarce training examples. In this work, we introduce DO cument-level R elation E xtraction opti M izing the long ta I l (DOREMI), an iterative framework that enhances underrepresented relations through minimal yet targeted manual annotations. Unlike previous approaches that rely on large-scale noisy data or heuristic denoising, DOREMI actively selects the most informative examples to improve training efficiency and robustness. DOREMI can be applied to any existing DocRE model and is effective at mitigating long-tail biases, offering a scalable solution to improve generalization on rare relations.