Answers are grounded in this paper and cite their sources.
Algorithmic analysis demonstrates superior document-level relation extraction across benchmark datasets, indicating the power of sememe-enhanced graph reasoning.
Document-level relation extraction is a challenging task in information extraction, as it involves identifying semantic relations between entities that are dispersed throughout a document. Existing graph-based approaches often rely on simplistic methods to construct text graphs, which do not provide enough lexical and semantic information to accurately predict the relations between entity pairs. In this paper, we introduce a document-level relation extraction method called SKAMRR ( S ememe K nowledge-enhanced A bstract M eaning R epresentation and R easoning). First, we generate document-level abstract meaning representation graphs using rules and acquire entity nodes’ features through sufficient information propagation. Next, we construct inference graphs for entity pairs and utilize graph neural networks to obtain their representations for relation classification. Additionally, we propose the global adaptive loss to address the issue of long-tailed data. We conduct extensive experiments on four datasets DocRE, CDR, GDA, and HacRED. Our model achieves competitive results and its performance outperforms previous state-of-the-art methods on four datasets.
No takes yet. Share an insight, caveat, or question.
Zhao et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: