Computing relative polarity for textual inference

TECHNICAL PUBLICATION:

Inference in Computational Semantics (ICoS-5)

Depending on the construction, the author or speaker of a sentence may commit himself to the truth or the falsity of a proposition expressed by an infinitival complement or a that-clause. This paper describes a recursive method of computing Semantic relations between main and complement sentences are of great significance in any system of automatic data processing that depends on natural language. In this paper we present a strategy for detecting author commitment to the truth/falsity of complement clauses based on their syntactic type and on the meaning of their embedding predicate. We show that the implications of a predicate at an arbitrary depth of embedding about its complement clause depend on a globally determined notion of relative polarity. We, moreover, observe that different classes of complement-taking verbs have a different effect on the polarity of their complement clauses and that this effect depends recursively on their own embedding. A polarity propagation algorithm is presented as part of a general strategy of canonicalization of linguistically-based representations, with a view to minimizing the demands on the entailment and contradiction detection process.the entailments of six different types of implicative constructions and their interaction with factive and counterfactive predicates.

download PDF (278K)

citation

Nairn, R. ; Condoravdi, C. ; Karttunen, L. Computing relative polarity for textual inference. Inference in Computational Semantics (ICoS-5); 2006 April 20-21; Buxton; UK.