High Recall Open IE for Relation Discovery

Abstract

Relation Discovery discovers predicates (relation types) from a text corpus relying on the co-occurrence of two named entities in the same sentence. This is a very narrowing constraint: it represents only a small fraction of all relation mentions in practice. In this paper we propose a high recall approach for Open IE, which enables covering up to 16 times more sentences in a large corpus. Comparison against OpenIE systems shows that our proposed approach achieves 28\% improvement over the highest recall OpenIE system and 6\% improvement in precision than the same system.

Tasks

Reproductions