A Machine Learning Filter for the Slot Filling Task
AbstractSlot Filling, a subtask of Relation Extraction, represents a key aspect for building structured knowledge bases usable for semantic-based information retrieval. In this work, we present a machine learning filter whose aim is to enhance the precision of relation extractors while minimizing the impact on the recall. Our approach consists in the filtering of relation extractors’ output using a binary classifier. This classifier is based on a wide array of features including syntactic, semantic and statistical features such as the most frequent part-of-speech patterns or the syntactic dependencies between entities. We experimented the classifier on the 18 participating systems in the TAC KBP 2013 English Slot Filling track. The TAC KBP English Slot Filling track is an evaluation campaign that targets the extraction of 41 pre-identified relations (e.g., title, date of birth, countries of residence, etc.) related to specific named entities (persons and organizations). Our results show that the classifier is able to improve the global precision of the best 2013 system by 20.5% and improve the F1-score for 20 relations out of 33 considered. View Full-Text
Share & Cite This Article
Lange Di Cesare, K.; Zouaq, A.; Gagnon, M.; Jean-Louis, L. A Machine Learning Filter for the Slot Filling Task. Information 2018, 9, 133.
Lange Di Cesare K, Zouaq A, Gagnon M, Jean-Louis L. A Machine Learning Filter for the Slot Filling Task. Information. 2018; 9(6):133.Chicago/Turabian Style
Lange Di Cesare, Kevin; Zouaq, Amal; Gagnon, Michel; Jean-Louis, Ludovic. 2018. "A Machine Learning Filter for the Slot Filling Task." Information 9, no. 6: 133.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.