首页> 外文会议>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.
机译:智能个人数字助理(IPDAS),一种流行的现实实验应用程序,具有口语语言的理解能力,可以涵盖用于自然语言理解的潜在数千个重叠域,以及寻找最佳域来处理话语的任务成为一个具有挑战性的问题大规模。在本文中,我们为IPDA中的大规模域分类提出了一套有效和可扩展的神经障碍 - Reranking模型。缺陷阶段侧重于有效地将所有域统治到K-Best候选域列表,并且重新划分阶段具有初始K-Best域的列表,具有其他上下文信息。我们展示了我们对1,500个IPDA域的广泛实验的方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号