首页> 外文会议>Annual meeting of the Association for Computational Linguistics >Matching Article Pairs with Graphical Decomposition and Convolutions
【24h】

Matching Article Pairs with Graphical Decomposition and Convolutions

机译:通过图形分解和卷积匹配文章对

获取原文

摘要

Identifying the relationship between two articles, e.g., whether two articles published from different sources describe the same breaking news, is critical to many document understanding tasks. Existing approaches for modeling and matching sentence pairs do not perform well in matching longer documents, which embody more complex interactions between the enclosed entities than a sentence does. To model article pairs, we propose the Concept Interaction Graph to represent an article as a graph of concepts. We then match a pair of articles by comparing the sentences that enclose the same concept vertex through a series of encoding techniques, and aggregate the matching signals through a graph convolutional network. To facilitate the evaluation of long article matching, we have created two datasets, each consisting of about 30K pairs of breaking news articles covering diverse topics in the open domain. Extensive evaluations of the proposed methods on the two datasets demonstrate significant improvements over a wide range of state-of-the-art methods for natural language matching.
机译:识别两篇文章之间的关系,例如,从不同来源发表的两篇文章是否描述同一突发新闻,对于许多文档理解任务至关重要。现有的建模和匹配句子对的方法在匹配较长的文档时效果不佳,而较长的文档比句子更能体现封闭实体之间的交互作用。为了对文章对建模,我们提出了概念交互图,以概念图的形式表示文章。然后,我们通过一系列编码技术比较包含相同概念顶点的句子来匹配一对文章,并通过图卷积网络汇总匹配的信号。为了便于评估长篇文章匹配情况,我们创建了两个数据集,每个数据集由大约3万对重大新闻报道,涵盖了开放领域中的各种主题。在两个数据集上对提议的方法进行了广泛的评估,结果表明,与自然语言匹配的各种最新方法相比,该方法有了显着的改进。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号