信息检索中文本匹配的深度层次注意网络

Meina Song, Qing Liu, E. Haihong
{"title":"信息检索中文本匹配的深度层次注意网络","authors":"Meina Song, Qing Liu, E. Haihong","doi":"10.1109/ICISCAE.2018.8666926","DOIUrl":null,"url":null,"abstract":"Text Matching is the task of examining two pieces of texts, such as query and documents, and determining whether they have the same meaning. Text Matching is very important in many NLP tasks, such as document retrieval, question answering, automatic conversation, machine translation, etc. In recent years, there existed some representation-based and interaction-based neural networks which have achieved some improvements. However powerful attention mechanism is rarely used in these models. Inspired by the success of attention in machine translation and document classification, in this paper, we propose a Deep Hierarchical Attention Networks for Text Matching, namely Deep-HAN-Matching. Specifically, Deep-HAN-Matching extracts meaningful matching patterns and rich contextual features hierarchically from words to total document at the query term level using the recurrent neural network and attention mechanism, and finally rank the matching score produced by the fully connected neural network. Experimental results on WikiQA, a popular benchmark dataset for answer sentence selection in question answering, show that our model can significantly outperform traditional retrieval baseline models and some recent deep neural network based matching models.","PeriodicalId":129861,"journal":{"name":"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Deep Hierarchical Attention Networks for Text Matching in Information Retrieval\",\"authors\":\"Meina Song, Qing Liu, E. Haihong\",\"doi\":\"10.1109/ICISCAE.2018.8666926\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Text Matching is the task of examining two pieces of texts, such as query and documents, and determining whether they have the same meaning. Text Matching is very important in many NLP tasks, such as document retrieval, question answering, automatic conversation, machine translation, etc. In recent years, there existed some representation-based and interaction-based neural networks which have achieved some improvements. However powerful attention mechanism is rarely used in these models. Inspired by the success of attention in machine translation and document classification, in this paper, we propose a Deep Hierarchical Attention Networks for Text Matching, namely Deep-HAN-Matching. Specifically, Deep-HAN-Matching extracts meaningful matching patterns and rich contextual features hierarchically from words to total document at the query term level using the recurrent neural network and attention mechanism, and finally rank the matching score produced by the fully connected neural network. Experimental results on WikiQA, a popular benchmark dataset for answer sentence selection in question answering, show that our model can significantly outperform traditional retrieval baseline models and some recent deep neural network based matching models.\",\"PeriodicalId\":129861,\"journal\":{\"name\":\"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISCAE.2018.8666926\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISCAE.2018.8666926","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

文本匹配是检查两个文本片段(例如查询和文档)并确定它们是否具有相同的含义的任务。文本匹配在许多NLP任务中非常重要,如文档检索、问答、自动对话、机器翻译等。近年来出现了一些基于表示和基于交互的神经网络,并取得了一定的进步。然而,这些模型很少使用强大的注意机制。受注意在机器翻译和文档分类中成功应用的启发,本文提出了一种用于文本匹配的深度层次注意网络,即Deep- han -Matching。具体来说,Deep-HAN-Matching利用递归神经网络和注意机制,在查询词级从单词到总文档中分层提取有意义的匹配模式和丰富的上下文特征,最后对全连接神经网络产生的匹配分数进行排序。实验结果表明,我们的模型可以显著优于传统的检索基线模型和一些基于深度神经网络的匹配模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Deep Hierarchical Attention Networks for Text Matching in Information Retrieval
Text Matching is the task of examining two pieces of texts, such as query and documents, and determining whether they have the same meaning. Text Matching is very important in many NLP tasks, such as document retrieval, question answering, automatic conversation, machine translation, etc. In recent years, there existed some representation-based and interaction-based neural networks which have achieved some improvements. However powerful attention mechanism is rarely used in these models. Inspired by the success of attention in machine translation and document classification, in this paper, we propose a Deep Hierarchical Attention Networks for Text Matching, namely Deep-HAN-Matching. Specifically, Deep-HAN-Matching extracts meaningful matching patterns and rich contextual features hierarchically from words to total document at the query term level using the recurrent neural network and attention mechanism, and finally rank the matching score produced by the fully connected neural network. Experimental results on WikiQA, a popular benchmark dataset for answer sentence selection in question answering, show that our model can significantly outperform traditional retrieval baseline models and some recent deep neural network based matching models.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信