Abstract
We present a new framework for textual entailment, which provides a modular integration between knowledge-based exact inference and cost-based approximate matching. Diverse types of knowledge are uniformly represented as entailment rules, which were acquired both manually and automatically. Our proof system operates directly on parse trees, and infers new trees by applying entailment rules, aiming to strictly generate the target hypothesis from the source text. In order to cope with inevitable knowledge gaps, a cost function is used to measure the remaining “distance” from the hypothesis.
| Original language | English |
|---|---|
| Pages (from-to) | 131-136 |
| Number of pages | 6 |
| Journal | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
| State | Published - 2007 |
| Event | 2007 ACL-PASCAL Workshop on Textual Entailment and Paraphrasing, ACL-PASCAL 2007 at the Annual Meeting of the Association for Computational Linguistics, ACL 2007 - Prague, Czech Republic Duration: 28 Jun 2007 → 29 Jun 2007 |
Bibliographical note
Publisher Copyright:© ACL 2007.All right reserved.
Funding
We are grateful to Cleo Condoravdi for making the polarity lexicon developed at PARC available for this research. We also wish to thank Ruslan Mitkov, Richard Evans, and Viktor Pekar from University of Wolverhampton for running the MARS system for us. This work was partially supported by ISF grant 1095/05, the IST Programme of the European Community under the PASCAL Network of Excellence IST-2002-506778, the Israel Internet Association (ISOC-IL) grant 9022 and the ITC-irst/University of Haifa collaboration.
| Funders | Funder number |
|---|---|
| ISOC-IL | 9022 |
| ITC-irst/University of Haifa | |
| Israel Internet Association | |
| Israel Science Foundation | 1095/05, IST-2002-506778 |