Predicting Document Coverage for Relation Extraction

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

  • Sneha Singhania - , Max Planck Institute for Informatics (Author)
  • Simon Razniewski - , Max Planck Institute for Informatics (Author)
  • Gerhard Weikum - , Max Planck Institute for Informatics (Author)

Abstract

This paper presents a new task of predicting the coverage of a text document for relation extraction (RE): Does the document contain many relational tuples for a given entity? Coverage predictions are useful in selecting the best documents for knowledge base construction with large input corpora. To study this problem, we present a dataset of 31,366 diverse documents for 520 entities. We analyze the correlation of document coverage with features like length, entity mention frequency, Alexa rank, language complexity, and information retrieval scores. Each of these features has only moderate predictive power. We employ methods combining features with statistical models like TF-IDF and language models like BERT. The model combining features and BERT, HERB, achieves an F1 score of up to 46%. We demonstrate the utility of coverage predictions on two use cases: KB construction and claim refutation.

Details

Original languageEnglish
Pages (from-to)207-223
Number of pages17
JournalTransactions of the Association for Computational Linguistics
Volume10
Publication statusPublished - 18 Mar 2022
Peer-reviewedYes
Externally publishedYes

External IDs

ORCID /0000-0002-5410-218X/work/185318156