基于依存句法和图注意力网络的句子匹配

Sentence Matching Based on Dependency Syntax and Graph Attention Network

句子匹配是自然语言处理的一项基本任务,可应用于自然语言推理、释义识别等多个场景。目前,主流的模型大多采用注意力机制来实现两个句子之间单词或短语的对齐。然而,这些模型通常忽略了句子的内在结构,没有考虑文本单元之间的依存关系。针对此问题,提出了一种基于依存句法和图注意力网络的匹配模型。设计两种建模方式将句子对建模为语义图。使用图注意力网络对构建的图进行编码以进行句子匹配。实验结果表明,提出的模型可以较好地学习图结构,在自然语言推理数据集SNLI和释义识别数据集Quora上分别达到了88.7%和88.9%的准确率。

Sentence matching is a basic task in natural language processing,which can be applied to natural language inference,paraphrase recognition and other scenarios.At present,most of the mainstream models use attention mechanism to realize the alignment of words or phrases between two sentences.However,these models usually ignore the internal structure of sentences and do not consider the dependency between text units.To solve this problem,this paper proposes a matching model based on dependency syntax and graph attention network.Two methods are designed to model sentence pairs as semantic graph.Graph attention network is used to encode the constructed graph for sentence matching.Experimental results show that the proposed model can learn graph structure well,and the accuracy of the model on the natural language inference dataset SNLI and the paraphrase recognition dataset Quora is 88.7%and 88.9%respectively.