Match-SRNN:空间RNN递归匹配结构建模
Match-SRNN: Modeling the Recursive Matching Structure with Spatial RNN
摘要:
语义匹配是许多自然语言处理应用中的一个基本问题,其目的是确定两个文本之间的匹配程度。最近,深度学习方法已被应用于这个问题,并取得了显着的改善。本文提出将两个文本之间的全局交互作用的生成看作是一个递归过程:即两个文本在每个位置上的交互作用是其前缀之间的交互作用以及当前位置上的词级交互作用的组合。基于这一思想,我们提出了一种新的深度架构,即匹配SRNN,模型的递归匹配结构。首先,构造一个张量来捕获单词级的交互。然后应用空间RNN递归地整合局部相互作用,重要性由四种类型的门确定。最后,基于全局交互计算匹配分数。我们证明,在退化到精确匹配的情况下,匹配SRNN可以近似的最长公共子序列的动态规划过程。因此,对于Match-SRNN有一个清晰的解释。我们的实验上的两个语义匹配任务显示匹配SRNN的有效性,和它的可视化学习匹配结构的能力。
英文摘要:
Semantic matching, which aims to determine the matching degree between two texts, is a fundamental problem for many NLP applications. Recently, deep learning approach has been applied to this problem and significant improvements have been achieved. In this paper, we propose to view the generation of the global interaction between two texts as a recursive process: i.e. the interaction of two texts at each position is a composition of the interactions between their prefixes as well as the word level interaction at the current position. Based on this idea, we propose a novel deep architecture, namely Match-SRNN, to model the recursive matching structure. Firstly, a tensor is constructed to capture the word level interactions. Then a spatial RNN is applied to integrate the local interactions recursively, with importance determined by four types of gates. Finally, the matching score is calculated based on the global interaction. We show that, after degenerated to the exact matching scenario, Match-SRNN can approximate the dynamic programming process of longest common subsequence. Thus, there exists a clear interpretation for Match-SRNN. Our experiments on two semantic matching tasks showed the effectiveness of Match-SRNN, and its ability of visualizing the learned matching structure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。