【24h】

Weakly Supervised Learning of Presupposition Relations between Verbs

机译:动词之间预设关系的弱监督学习

获取原文

摘要

Presupposition relations between verbs are not very well covered in existing lexical semantic resources. We propose a weakly supervised algorithm for learning presupposition relations between verbs that distinguishes five semantic relations: presupposition, entailment, temporal inclusion, antonymy and othero relation. We start with a number of seed verb pairs selected manually for each semantic relation and classify unseen verb pairs. Our algorithm achieves an overall accuracy of 36% for type-based classification.
机译:动词之间的预设关系在现有词汇语义资源中并未得到很好的覆盖。我们提出了一种弱监督算法,用于学习动词之间的预设关系,该算法区分了五个语义关系:预设,蕴涵,时间包含,反义和其他/无关联。我们从为每个语义关系手动选择的许多种子动词对开始,并对看不见的动词对进行分类。对于基于类型的分类,我们的算法实现了36%的整体准确性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号