Deep and shallow features learning for short texts matching

Ziliang Wang, Si Li, Guang Chen, Zhiqing Lin
{"title":"Deep and shallow features learning for short texts matching","authors":"Ziliang Wang, Si Li, Guang Chen, Zhiqing Lin","doi":"10.1109/PIC.2017.8359513","DOIUrl":null,"url":null,"abstract":"Short texts matching problem is a special issue in natural language matching. Different from common natural language, short texts have their own characteristices, such as casual expressions and limited lengths, especially in the sentences from social media. Previous works usually use rule-based model and retrieval-based model to match short texts. These models merely focus on word-level similarity between short texts and can not capture deep matching relation of them. To boost the performance of short texts matching, we investigate a basic con-volutional neural network model to learn the sentence-level deep matching relation between short texts. Subsequently, we propose a hybrid model to merge sentence-level deep matching relation with shallow features to generate the final matching score. We evaluate our model on a dataset of short-text conversation based on real-world instances from Sina Weibo. The experimental results show that our model outperforms the previous state-of-art work on this task.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Progress in Informatics and Computing (PIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC.2017.8359513","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Short texts matching problem is a special issue in natural language matching. Different from common natural language, short texts have their own characteristices, such as casual expressions and limited lengths, especially in the sentences from social media. Previous works usually use rule-based model and retrieval-based model to match short texts. These models merely focus on word-level similarity between short texts and can not capture deep matching relation of them. To boost the performance of short texts matching, we investigate a basic con-volutional neural network model to learn the sentence-level deep matching relation between short texts. Subsequently, we propose a hybrid model to merge sentence-level deep matching relation with shallow features to generate the final matching score. We evaluate our model on a dataset of short-text conversation based on real-world instances from Sina Weibo. The experimental results show that our model outperforms the previous state-of-art work on this task.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
短文本匹配的深浅特征学习
短文本匹配问题是自然语言匹配中的一个特殊问题。与常见的自然语言不同,短文本有自己的特点,比如表达随意,长度有限,尤其是在社交媒体的句子中。以前的工作通常使用基于规则的模型和基于检索的模型来匹配短文本。这些模型只关注短文本之间的词级相似度,无法捕捉短文本之间的深层匹配关系。为了提高短文本匹配的性能,我们研究了一种基本的卷积神经网络模型来学习短文本之间的句子级深度匹配关系。随后,我们提出了一种混合模型,将句子级深度匹配关系与浅层特征合并,生成最终的匹配分数。我们在基于新浪微博真实实例的短文本会话数据集上评估了我们的模型。实验结果表明,我们的模型在该任务上的表现优于现有的研究成果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evaluation method and decision support of network education based on association rules ACER: An adaptive context-aware ensemble regression model for airfare price prediction An improved constraint model for team tactical position selection in games Trust your wallet: A new online wallet architecture for Bitcoin An approach based on decision tree for analysis of behavior with combined cycle power plant
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1