Textual Entailment and Anaphora Resolution

摘要：

Textual entailment has been recently defined as a common solution for modeling language variability in different NLP tasks. Textual Entailment is formally defined as a relationship between a coherent text T and a language expression, the hypothesis H. T is said to entail H (T →H) if the meaning of H can be inferred from the meaning of T. An entailment function e(T,H) thus maps an entailment pair T-H to a true value (i.e., true if the relationship holds, false otherwise). Alternatively, e(T,H) can be also intended as a probabilistic function mapping the pair T-H to a real value between 0 and 1, expressing the confidence with which a human judge or an automatic system estimate the relationship to hold.

关键词： Text Entailment Semantic subsumption Syntactic Subsumption Direct Implication Anaphora Resolution

作者: Partha Pakray Sivaji Bandyopadhyay Alexander Gelbukh

作者单位: Computer Science & Engineering DepartmentJadavpur University, Kolkata, India Center for Computing Research, National Polytechnic Institute Mexico City, Mexico

会议类型: 国际会议

会议名称: 2010 3rd International Conference on Advanced Computer Theory and Engineering(2010年第三届先进计算机理论与工程国际会议 ICACTE 2010)

会议地点: 成都

会议语种:英文

页码: 1-3

在线出版日期: 2010-08-20（万方平台首次上网日期，不代表论文的发表时间）