...
首页> 外文期刊>Computational linguistics >A Sequential Matching Framework for Multi-Turn Response Selection in Retrieval-Based Chatbots
【24h】

A Sequential Matching Framework for Multi-Turn Response Selection in Retrieval-Based Chatbots

机译:基于检索的聊天机器人中多回合响应选择的顺序匹配框架

获取原文
           

摘要

We study the problem of response selection for multi-turn conversation in retrieval-based chatbots. The task involves matching a response candidate with a conversation context, the challenges for which include how to recognize important parts of the context, and how to model the relationships among utterances in the context. Existing matching methods may lose important information in contexts as we can interpret them with a unified framework in which contexts are transformed to fixed-length vectors without any interaction with responses before matching. This motivates us to propose a new matching framework that can sufficiently carry important information in contexts to matching and model relationships among utterances at the same time. The new framework, which we call a sequential matching framework (SMF), lets each utterance in a context interact with a response candidate at the first step and transforms the pair to a matching vector. The matching vectors are then accumulated following the order of the utterances in the context with a recurrent neural network (RNN) that models relationships among utterances. Context-response matching is then calculated with the hidden states of the RNN. Under SMF, we propose a sequential convolutional network and sequential attention network and conduct experiments on two public data sets to test their performance. Experiment results show that both models can significantly outperform state-of-the-art matching methods. We also show that the models are interpretable with visualizations that provide us insights on how they capture and leverage important information in contexts for matching.
机译:我们研究了基于检索的聊天机器人中多回合对话的响应选择问题。该任务涉及使响应候选者与对话上下文匹配,所面临的挑战包括如何识别上下文的重要部分,以及如何对上下文中话语之间的关系建模。现有的匹配方法可能会丢失上下文中的重要信息,因为我们可以使用统一的框架来解释它们,在该框架中,上下文会转换为固定长度的向量,而匹配前不会与响应发生任何交互。这促使我们提出一个新的匹配框架,该框架可以在上下文中充分携带重要信息,以同时匹配和建模话语之间的关系。我们称之为顺序匹配框架(SMF)的新框架使第一步中的每个话语都与候选响应进行交互,并将该对转换为匹配向量。然后,在上下文中,通过对建模话语之间的关系进行建模的递归神经网络(RNN),按照话语的顺序累积匹配向量。然后使用RNN的隐藏状态计算上下文响应匹配。在SMF下,我们提出了顺序卷积网络和顺序注意网络,并对两个公共数据集进行实验以测试其性能。实验结果表明,这两种模型都可以大大胜过最新的匹配方法。我们还表明,这些模型可通过可视化解释,从而为我们提供了有关如何捕获和利用上下文中的重要信息进行匹配的见解。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号