首页> 外文学位 >Computational Natural Language Inference: Robust and Interpretable Question Answering
【24h】

Computational Natural Language Inference: Robust and Interpretable Question Answering

机译:计算自然语言推论:鲁棒且可解释的问题解答

获取原文
获取原文并翻译 | 示例

摘要

We address the challenging task of computational natural language inference, by which we mean bridging two or more natural language texts while also providing an explanation of how they are connected. In the context of question answering (i.e., finding short answers to natural language questions), this inference connects the question with its answer and we learn to approximate this inference with machine learning. In particular, here we present four approaches to question answering, each of which shows a significant improvement in performance over baseline methods. In our first approach, we make use of the underlying discourse structure inherent in free text (i.e. whether the text contains an explanation, elaboration, contrast, etc.) in order to increase the amount of training data for (and subsequently the performance of) a monolingual alignment model. In our second work, we propose a framework for training customized lexical semantics models such that each one represents a single semantic relation. We use causality as a use case, and demonstrate that our customized model is able to both identify causal relations as well as significantly improve our ability to answer causal questions. We then propose two approaches that seek to answer questions by learning to rank human-readable justifications for the answers, such that the model selects the answer with the best justification. The first uses a graph-structured representation of the background knowledge and performs information aggregation to construct multi-sentence justifications. The second reduces pre-processing costs by limiting itself to a single sentence and using a neural network to learn a latent representation of the background knowledge. For each of these, we show that in addition to significant improvement in correctly answering questions, we also outperform a strong baseline in terms of the quality of the answer justification given.
机译:我们解决了计算性自然语言推论的艰巨任务,这意味着将两个或更多自然语言文本桥接在一起,同时还提供了它们之间如何连接的解释。在问题回答的背景下(即找到自然语言问题的简短答案),该推论将问题与其答案联系起来,并且我们学会了使用机器学习来近似该推论。特别是,在这里,我们提出了四种回答问题的方法,每种方法都显示出与基准方法相比性能的显着提高。在我们的第一种方法中,我们利用自由文本中固有的基础话语结构(即文本是否包含解释,细化,对比等),以增加用于(以及随后执行)训练数据的数量。单语对齐模型。在我们的第二项工作中,我们提出了一个训练定制的词法语义模型的框架,这样每个模型都代表一个语义关系。我们使用因果关系作为用例,并证明我们的定制模型既可以识别因果关系,又可以显着提高我们回答因果问题的能力。然后,我们提出了两种方法,通过学习对答案的人类可读理由进行排名,从而寻求答案,以便模型选择具有最佳理由的答案。第一种使用背景知识的图形结构表示,并执行信息聚合以构造多句辩护。第二种方法通过将自身限制为一个句子并使用神经网络来学习背景知识的潜在表示,从而降低了预处理成本。对于上述每一项,我们都表明,除了在正确回答问题方面的显着改进之外,就给出的回答理由的质量而言,我们还优于强基准。

著录项

  • 作者

    Sharp, Rebecca Reynolds.;

  • 作者单位

    The University of Arizona.;

  • 授予单位 The University of Arizona.;
  • 学科 Linguistics.;Computer science.
  • 学位 Ph.D.
  • 年度 2017
  • 页码 164 p.
  • 总页数 164
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号