Abstract
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed edges, and use a global transitivity constraint on the graph to learn the optimal set of edges, by formulating the optimization problem as an Integer Linear Program. We motivate this graph with an application that provides a hierarchical summary for a set of propositions that focus on a target concept, and show that our global algorithm improves performance by more than 10% over baseline algorithms.
| Original language | English |
|---|---|
| Title of host publication | ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Conference Proceedings |
| Editors | Jan Hajic, Sandra Carberry, Stephen Clark |
| Publisher | Association for Computational Linguistics (ACL) |
| Pages | 1220-1229 |
| Number of pages | 10 |
| ISBN (Electronic) | 1932432663, 9781932432664 |
| State | Published - 2010 |
| Event | 48th Annual Meeting of the Association for Computational Linguistics, ACL 2010 - Uppsala, Sweden Duration: 11 Jul 2010 → 16 Jul 2010 |
Publication series
| Name | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
|---|---|
| Volume | 2010-July |
| ISSN (Print) | 0736-587X |
Conference
| Conference | 48th Annual Meeting of the Association for Computational Linguistics, ACL 2010 |
|---|---|
| Country/Territory | Sweden |
| City | Uppsala |
| Period | 11/07/10 → 16/07/10 |
Bibliographical note
Publisher Copyright:© 2010 Association for Computational Linguistics.