arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.13752cs.CLcs.AIcs.LG
收藏

Double Graph Based Reasoning for Document-level Relation Extraction

Peking University(北京大学);ByteDance AI Lab(字节跳动人工智能实验室)

Shuang Zeng, Runxin Xu, Baobao Chang, Lei Li

英文摘要:

Document-level relation extraction aims to extract relations among entities within a document. Different from sentence-level relation extraction, it requires reasoning over multiple sentences across a document. In this paper, we propose Graph Aggregation-and-Inference Network (GAIN) featuring double graphs. GAIN first constructs a heterogeneous mention-level graph (hMG) to model complex interaction among different mentions across the document. It also constructs an entity-level graph (EG), based on which we propose a novel path reasoning mechanism to infer relations between entities. Experiments on the public dataset, DocRED, show GAIN achieves a significant performance improvement (2.85 on F1) over the previous state-of-the-art. Our code is available at https://github.com/DreamInvoker/GAIN .

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑