A Machine learning Filter for Relation Extraction

  title={A Machine learning Filter for Relation Extraction},
  author={Kevin Lange Di Cesare and Michel Gagnon and Amal Zouaq and Ludovic Jean-Louis},
  journal={Proceedings of the 25th International Conference Companion on World Wide Web},
The TAC KBP English slot filling track is an evaluation campaign that targets the extraction of 41 pre-identified relations related to specific named entities. In this work, we present a machine learning filter whose aim is to enhance the precision of relation extractors while minimizing the impact on recall. Our approach aims at filtering relation extractors' output using a binary classifier based on a wide array of features including syntactic, lexical and statistical features. We… 

Tables from this paper

Employing Semantic Context for Sparse Information Extraction Assessment

This work uses a large semantic network consisting of millions of concepts, entities, and attributes to explicitly model the context of any semantic relationship and shows that this approach can significantly improve the F-score in the assessment of sparse extractions while maintaining the efficiency.



Effective Slot Filling Based on Shallow Distant Supervision Methods

Spoken Language Systems at Saarland University (LSV) participated this year with 5 runs at the TAC KBP English slot filling track and the submitted main run of the LSV RelationFactory system achieved the top-ranked F1-score.

Distant supervision for relation extraction without labeled data

This work investigates an alternative paradigm that does not require labeled corpora, avoiding the domain dependence of ACE-style algorithms, and allowing the use of corpora of any size.

Generating Typed Dependency Parses from Phrase Structure Parses

A system for extracting typed dependency parses of English sentences from phrase structure parses that captures inherent relations occurring in corpus texts that can be critical in real-world applications is described.

The WEKA data mining software: an update

This paper provides an introduction to the WEKA workbench, reviews the history of the project, and, in light of the recent 3.6 stable release, briefly discusses what has been added since the last stable version (Weka 3.4) released in 2003.

Fast Algorithms for Mining Association Rules

Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.

Et al

A large population-based survey of veterans and nondeployed controls found evidence of a deployment-related Gulf War syndrome by factor analysis in Air Force veterans and controls.

Overview of the TAC2013 Knowledge Base Population Evaluation: English Slot Filling and Temporal Slot Filling

The main changes this year include the requirement for a stricter textual justification of the extracted relations for SF, and a simplification of the TSF task, where the relation to be temporally grounded is given as input.

: and al

    and al

    • Distant Supervision for Relation Extraction without Labeled Data. ACL
    • 2009