Document-level relation extraction has attracted much attention in recent years. It is usually formulated as a classification problem that predicts relations for all entity pairs in the document. However, previous works indiscriminately represent intra- and inter-sentential relations in the same way, confounding the different patterns for predicting them. Besides, they create a document graph and use paths between entities on the graph as clues for logical reasoning. However, not all entity pairs can be connected with a path and have the correct logical reasoning paths in their graph. Thus many cases of logical reasoning cannot be covered. This paper proposes an effective architecture, SIRE, to represent intra- and inter-sentential relations in different ways. We design a new and straightforward form of logical reasoning module that can cover more logical reasoning chains. Experiments on the public datasets show SIRE outperforms the previous state-of-the-art methods. Further analysis shows that our predictions are reliable and explainable. Our code is available at https://github.com/DreamInvoker/SIRE.
翻译:近些年来,文件级关系提取引起了许多注意,它通常是一个分类问题,预测文件中所有实体对对的关系。然而,以前的工作不加区分地以同样的方式代表了文件内和文件间的关系,混淆了预测这些关系的不同模式。此外,它们创建了一个文件图表,并使用图表上各实体之间的路径作为逻辑推理的线索。然而,并非所有实体对子都能够与路径连接,并在图表中找到正确的逻辑推理路径。因此,许多逻辑推理案例都无法覆盖。本文件建议建立一个有效的结构,SIRE,以不同的方式代表文件内和文件间的关系。我们设计了一种可以覆盖更多逻辑推理链的逻辑推理模块。对公共数据集的实验显示SIRE的实验显示SIRE优于先前的状态方法。进一步的分析显示,我们的预测是可靠和可以解释的。我们的代码可以在 https://github.com/DreamInvoker/SIRE上查阅。