Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics, pages 610619, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics
 

Summary: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics, pages 610619,
Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics
Global Learning of Typed Entailment Rules
Jonathan Berant
Tel Aviv University
Tel Aviv, Israel
jonatha6@post.tau.ac.il
Ido Dagan
Bar-Ilan University
Ramat-Gan, Israel
dagan@cs.biu.ac.il
Jacob Goldberger
Bar-Ilan University
Ramat-Gan, Israel
goldbej@eng.biu.ac.il
Abstract
Extensive knowledge bases of entailment rules
between predicates are crucial for applied se-
mantic inference. In this paper we propose an
algorithm that utilizes transitivity constraints

  

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle
Association for Computational Linguistics (ACL) Anthology
Goldberger, Jacob - School of Engineering, Bar Ilan University

 

Collections: Computer Technologies and Information Sciences