Inferring textual entailment with a probabilistically sound calculus

Stefan Harmeling · Natural Language Engineering · 2009

Abstract We introduce a system for textual entailment that is based on a probabilistic model of entailment. The model is defined using a calculus of transformations on dependency trees, which is characterized by the fact that derivations in that calculus preserve the truth only with a certain probability. The calculus is successfully evaluated on the datasets of the PASCAL Challenge on Recognizing Textual Entailment.

Read the paper · More papers on PaperTik