NLIP reading group: Global learning of typed entailment rules

Add to your list(s) Download to your calendar using vCal

• Marek Rei (University of Cambridge)
• Thursday 17 November 2011, 12:15-13:00
• GS15, Computer Laboratory.

If you have a question about this talk, please contact Jimme Jardine.

Marek will be talking about the following:

Global learning of typed entailment rules Jonathan Berant, Ido Dagan, Jacob Goldberger Winner of best student paper at ACL 2011 . PDF : http://www.aclweb.org/anthology/P/P11/P11-1062.pdf

Abstract: Extensive knowledge bases of entailment rules between predicates are crucial for applied semantic inference. In this paper we propose an algorithm that utilizes transitivity constraints to learn a globally-optimal set of entailment rules for typed predicates. We model the task as a graph learning problem and suggest methods that scale the algorithm to larger graphs. We apply the algorithm over a large data set of extracted predicate instances, from which a resource of typed entailment rules has been recently released (Schoenmackers et al., 2010). Our results show that using global transitivity information substantially improves performance over this resource and several baselines, and that our scaling methods allow us to increase the scope of global learning of entailment-rule graphs.

This talk is part of the Natural Language Processing Reading Group series.

This talk is included in these lists:

• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Chris Davis' list
• GS15, Computer Laboratory
• Guy Emerson's list
• Natural Language Processing Reading Group

Note that ex-directory lists are not shown.