TAC-KBP 2014 English Slot Filling Task
(Redirected from 2014 KBP-ESF)
Jump to navigation
Jump to search
A TAC-KBP 2014 English Slot Filling Task is an English slot filling task that is a TAC-KBP 2014 task (within a TAC-KBP 2014 track).
- …
- Counter-Example(s):
- See: TAC-KBP.
References
2015
- (Viswanathan et al., 2015) ⇒ Vidhoon Viswanathan, Nazneen Fatema Rajani, Yinon Bentor, and Raymond J. Mooney. (2015). “Stacked Ensembles of Information Extractors for Knowledge-Base Population.” In: Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics (ACL-15).
- QUOTE: We present results on using stacking to ensemble multiple systems for the Knowledge Base Population English Slot Filling (KBP-ESF) task. ... We demonstrate that our stacking approach outperforms the best system from the 2014 KBP-ESF competition as well as alternative ensembling methods employed in the 2014 KBP Slot Filler Validation task and several other ensembling baselines.
2014
- (Surdeanu & Ji, 2014) ⇒ Mihai Surdeanu, and Heng Ji. (2014). “Overview of the English Slot Filling Track at the TAC2014 Knowledge Base Population Evaluation.” In: Proceedings of the Text Analysis Conference (TAC 2014).
- http://surdeanu.info/kbp2014/def.php
- QUOTE: This evaluation follows closely the 2013_SF evaluation, so some of the 2013_documents listed below, i.e., slot descriptions and assessment guidelines, remain highly relevant.
- "Task Description for English Slot Filling at TAC-‐KBP 2014, version 1.1." May 6th, 2014
- QUOTE: The main goal of the Knowledge Base Population (KBP) track at TAC 2014 is to promote research in and to evaluate the ability of automated systems to discover information about named entities and to incorporate this information in a knowledge source. For the evaluation an initial (or reference) knowledge base will be provided along with a source document collection from which systems are to learn. Attributes (a.k.a., “slots”) derived from Wikipedia infoboxes will be used to create the reference knowledge base. This document focuses only on the English Slot Filling (SF) task, which involves mining information about entities from text. Slot Filling can be viewed as more traditional Information Extraction, or alternatively, as a Question Answering (QA) task, where the questions are static but the targets change. For the other tasks part of KBP 2014, please visit the KBP web page: http://www.nist.gov/tac/2014/KBP/.