首页> 外文会议>First international workshop on language cognition and computational models >Addressing the Winograd Schema Challenge as a Sequence Ranking Task
【24h】

Addressing the Winograd Schema Challenge as a Sequence Ranking Task

机译:解决Winograd模式挑战作为序列排序任务

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

摘要

The Winograd Schema Challenge targets pronominal anaphora resolution problems which require the application of cognitive inference in combination with world knowledge. These problems are easy to solve for humans but most difficult to solve for machines. Computational models that previously addressed this task rely on syntactic preprocessing and incorporation of external knowledge by manually crafted features. We address the Winograd Schema Challenge from a new perspective as a sequence ranking task, and design a Siamese neural sequence ranking model which performs significantly better than a random baseline, even when solely trained on sequences of words. We evaluate against a baseline and a state-of-the-art system on two data sets and show that anonymization of noun phrase candidates strongly helps our model to generalize.
机译:Winograd Schema Challenge旨在解决代词照应解析问题,这些问题需要结合世界知识来应用认知推理。这些问题对于人类来说很容易解决,但对于机器来说则最难解决。先前解决此任务的计算模型依赖于语法预处理以及通过手工制作的功能将外部知识纳入其中。我们从一个新的角度解决Winograd Schema挑战,将其作为序列排序任务,并设计一个连体神经序列排序模型,即使仅对单词序列进行训练,其效果也要比随机基线更好。我们针对两个数据集的基准和最新系统进行了评估,结果表明,名词短语候选者的匿名化极大地帮助了我们的模型推广。

著录项

  • 来源
  • 会议地点 Santa Fe(US)
  • 作者

    Juri Opitz; Anette Frank;

  • 作者单位

    Research Training Group AIPHES, Leibniz ScienceCampus 'Empirical Linguistics and Computational Language Modeling' Department for Computational Linguistics 69120 Heidelberg;

    Research Training Group AIPHES, Leibniz ScienceCampus 'Empirical Linguistics and Computational Language Modeling' Department for Computational Linguistics 69120 Heidelberg;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号