Datasets for generic relation extraction*

  • Authors:

  • B. Hachey;C. Grover;R. Tobin

  • Affiliations:

  • Language technology group, macquarie university, nsw 2109, australia email: bhachey@cmcrc.com;Informatics forum, 10 crichton street, edinburgh, eh8 9ab, scotland email: c.grover@ed.ac.uk/ r.tobin@ed.ac.uk;Informatics forum, 10 crichton street, edinburgh, eh8 9ab, scotland email: c.grover@ed.ac.uk/ r.tobin@ed.ac.uk

  • Venue:
  • Natural Language Engineering
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

A vast amount of usable electronic data is in the form of unstructured text. The relation extraction task aims to identify useful information in text (e.g. PersonW works for OrganisationX, GeneY encodes ProteinZ) and recode it in a format such as a relational database or RDF triplestore that can be more effectively used for querying and automated reasoning. A number of resources have been developed for training and evaluating automatic systems for relation extraction in different domains. However, comparative evaluation is impeded by the fact that these corpora use different markup formats and notions of what constitutes a relation. We describe the preparation of corpora for comparative evaluation of relation extraction across domains based on the publicly available ACE 2004, ACE 2005 and BioInfer data sets. We present a common document type using token standoff and including detailed linguistic markup, while maintaining all information in the original annotation. The subsequent reannotation process normalises the two data sets so that they comply with a notion of relation that is intuitive, simple and informed by the semantic web. For the ACE data, we describe an automatic process that automatically converts many relations involving nested, nominal entity mentions to relations involving non-nested, named or pronominal entity mentions. For example, the first entity is mapped from 'one' to 'Amidu Berry' in the membership relation described in 'Amidu Berry, one half of PBS'. Moreover, we describe a comparably reannotated version of the BioInfer corpus that flattens nested relations, maps part-whole to part-part relations and maps n-ary to binary relations. Finally, we summarise experiments that compare approaches to generic relation extraction, a knowledge discovery task that uses minimally supervised techniques to achieve maximally portable extractors. These experiments illustrate the utility of the corpora.1