TAC-KBP 2012 Track
Jump to navigation
Jump to search
See: TAC-KBP Track, TAC 2012, TAC-KBP 2012 Task, TAC-KBP 2010 Track, TAC-KBP 2009 Track.
References
2012
- http://www.nist.gov/tac/2012/KBP/index.html
- QUOTE: TAC 2012 focuses on Knowledge Base Population (KBP). The goal of Knowledge Base Population is to promote research in automated systems that discover information about named entities as found in a large corpus and incorporate this information into a knowledge base. TAC 2012 fields tasks in three areas, all aimed at improving the ability to automatically populate knowledge bases from text:
- Entity-Linking: Given a name (of a Person, Organization, or Geopolitical Entity) and a document containing that name, determine the KB node for the named entity, adding a new node for the entity if it is not already in the KB. The reference KB is derived from English Wikipedia, while source documents come from a variety of languages, including English, Chinese, and Spanish.
- Slot-Filling: Given a named entity and a pre-defined set of attributes ("slots") for the entity type, augment a KB node for that entity by extracting all new learnable slot values for the entity as found in a large corpus of documents. The reference KB is derived from English Wikipedia, while source documents come from English and Spanish. A diagnostic task, Slot Filler Validation, will be to determine whether a candidate filler in a document is a correct slot-filler for a given entity.
- Cold Start Knowledge Base Population: Given a KB schema with an empty knowledge base, build the KB from scratch by mining a large text collection.
- QUOTE: TAC 2012 focuses on Knowledge Base Population (KBP). The goal of Knowledge Base Population is to promote research in automated systems that discover information about named entities as found in a large corpus and incorporate this information into a knowledge base. TAC 2012 fields tasks in three areas, all aimed at improving the ability to automatically populate knowledge bases from text:
To promote research in populating probabilistic knowledge bases, systems may augment each assertion they make with a confidence score.