A Compact Forest for Scalable Inference over Entailment and Paraphrase Rules

A large body of recent research has been investigating the acquisition and application of applied inference knowledge. Such knowledge may be typically captured as entailment rules, applied over syntactic representations. Efficient inference with such knowledge then becomes a fundamental problem. Starting out from a formalism for entailment-rule application we present a novel packed data-structure and a corresponding algorithm for its scalable implementation. We proved the validity of the new algorithm and established its efficiency analytically and empirically.

• Type: Journal
• Year: 2009
• Where: EMNLP
• Authors: Roy Bar-Haim, Jonathan Berant, Ido Dagan
• Keywords: Efficient Inference, EMNLP 2009, Inference Knowledge, Natural Language Processing, Such Knowledge