Overview of the TAC2013 Knowledge Base Population Evaluation: English Slot Filling and Temporal Slot Filling
By Mihai Surdeanu. 2013
111 citations recorded by the source corpus.
Subfields: Natural Language Processing, Evaluation & Benchmarks
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Natural Language Processing
- Mohit Bansal
- Sebastian Riedel
- Graham Neubig
- Luke S. Zettlemoyer
- Christopher D. Manning
- Hannaneh Hajishirzi
- Percy Liang
- Yejin Choi
In Evaluation & Benchmarks
- Mohit Bansal
- Sebastian Riedel
- James Thorne
- Patrick Lewis
- Christopher D. Manning
- Nazneen Rajani
- Hinrich Schütze
- Pontus Stenetorp
Citations in the corpus
- KILT: a Benchmark for Knowledge Intensive Language Tasks (2020, background): “…tasks and resources that define large-scale external knowledge sources—including the TAC-KBP challenges (McNamee and Dang, 2009; Ji et al., 2010; Surdeanu, 2013; Surdeanu and Ji, 2014), ARC (Clark et al., 13https://www.wikidata.org 2018), TriviaQA-web (Joshi et al., 2017), QuasarT (Dhingra et…”
- PAQ: 65 Million Probably-Asked Questions and What You Can Do With Them (2021, background): “Here, the goal is to mine facts from free text into structured or semi-structured forms, typically (subject, relation, object) triples for use in tasks such as slot-filling (Surdeanu, 2013).”
- Differentiable Reasoning over a Virtual Knowledge Base (2020, background): “Existing slot-filling tasks (Levy et al., 2017; Surdeanu, 2013) focus on a single-hop , static corpus setting, whereas our task considers a dynamic setting which requires the system to traverse the corpus.”
- LISA: Explaining Recurrent Neural Network Judgments via Layer-wIse Semantic Accumulation and Example to Pattern Transformation (2018, methodology): “We investigate another dataset from TAC KBP Slot Filling (SF) shared task (Surdeanu, 2013), where we use the relation classification dataset by Adel et al.”
- Leveraging Linguistic Structure For Open Domain Information Extraction (2015, methodology): “We show that our new system performs well on a real world evaluation – the TAC KBP Slot Filling challenge (Surdeanu, 2013).”
- Language Models are Open Knowledge Graphs (2020, methodology): “Stanford OpenIE leverages POS tag and dependency parser, and generates self-contained clauses from long sentences to extract the triplets, which is the best open information extraction system (Angeli et al., 2015) on TAC KBP (Surdeanu, 2013).”
- Stacked Ensembles of Information Extractors for Knowledge-Base Population (2015, methodology): “Knowledge Base Population (KBP) English Slot Filling (ESF) task (Surdeanu, 2013; Surdeanu and Ji, 2014).”
- Stacking With Auxiliary Features (2016, methodology): “In 2015, the ESF task [15, 16] was replaced by the Cold Start Slot Filling (CSSF) task2 which requires filling specific slots of information for a given set of query entities based on a supplied text corpus.”
- Overview of the English Slot Filling Track at the TAC2014 Knowledge Base Population Evaluation (2014, methodology): “The slot filling task at TAC-KBP 2014 follows closely the 2013 definition (Surdeanu, 2013).”