Транзитивные ограничения

Extensive knowledge bases of entailment rules between predicates are crucial for applied se- mantic inference. In this paper we propose an algorithm that utilizes transitivity constraints to learn a globally-optimal …...

AbstractTyped entailment graphs try to learn the entailment relations between predicates from text and model them as edges between predicate nodes. The construction of entailment graphs usually suffers from severe …...