首页> 外文会议>Conference on the North American Chapter of the Association for Computational Linguistics: Human Language Technologies >A Scalable Neural Shortlisting-Reranking Approach for Large-Scale Domain Classification in Natural Language Understanding
【24h】

A Scalable Neural Shortlisting-Reranking Approach for Large-Scale Domain Classification in Natural Language Understanding

机译:自然语言理解中大规模领域分类的可扩展神经短名单重排序方法

获取原文

摘要

Intelligent personal digital assistants (IPDAs), a popular real-life application with spoken language understanding capabilities, can cover potentially thousands of overlapping domains for natural language understanding, and the task of finding the best domain to handle an utterance becomes a challenging problem on a large scale. In this paper, we propose a set of efficient and scalable neural shortlisting-reranking models for large-scale domain classification in IPDAs. The shortlisting stage focuses on efficiently trimming all domains down to a list of k-best candidate domains, and the reranking stage performs a list-wise reranking of the initial k-best domains with additional contextual information. We show the effectiveness of our approach with extensive experiments on 1,500 IPDA domains.
机译:智能个人数字助理(IPDA)是一种具有口语理解功能的流行的现实生活应用程序,可以覆盖成千上万个自然语言理解领域重叠的领域,而寻找最佳语言来处理话语的任务成为一个难题。规模大。在本文中,我们为IPDA中的大规模域分类提出了一套有效且可扩展的神经短名单重排序模型。入围阶段着重于有效地将所有域缩减为k个最佳候选域的列表,而重排阶段则对带有附加上下文信息的初始k个最佳域进行列表式重排。我们在1,500个IPDA域上进行了广泛的实验,证明了我们方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号