首页> 外文会议>AAAI Symposium >Semantics and Complexity of Question Answering Systems: Towards a Moore's Law for Natural Language Engineering
【24h】

Semantics and Complexity of Question Answering Systems: Towards a Moore's Law for Natural Language Engineering

机译:问题回答系统的语义与复杂性:走向摩尔语法的自然语言工程法

获取原文

摘要

In order for a system to answer a question, it needs to be able to extract the answer, usually found as a fact, from relevant text containing it. In this paper we describe a method of classifying facts (information) into categories or levels; where each level signifies a different degree of difficulty of extracting the fact from a piece of text containing it. We proceed to show how this is relevant to evaluating the complexity of a question-answering task.
机译:为了使系统回答一个问题,它需要能够从包含它的相关文本中找到一个事实的答案。在本文中,我们描述了将事实(信息)分类为类别或水平的方法;每个级别都意味着从包含它的文本中提取事实的不同程度的难度。我们继续展示如何与评估问答任务的复杂性有关。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号