Please use this identifier to cite or link to this item:
PIRA download icon_1.1View/Download Full Text
Title: PolyUCOMP in TAC 2011 entity linking and slot filling
Authors: Xu, J
Liu, Z
Lu, Q 
Liu, YL
Wang, C
Issue Date: 14-Nov-2011
Source: Proceedings of the Fourth Text Analysis Conference (TAC 2011), November 14-15, 2011, National Institute of Standards and Technology, Gaithersburg, Maryland, USA
Abstract: The PolyUCOMP team participated in two TAC-KBP2011 tasks: Regular Entity Linking and Regular Slot Filling.
For the entity linking task, a three-step entity linking system is developed. Similar to some systems in KBP 2010, a list of possible candidates are first selected. Then the best candidate is identified to decide whether a link exists. In addition, a document clustering algorithm is used to group NIL queries. This system incorporates Wikipedia linking information and other textual and contextual features. Our system produces a high answer coverage and accurate linking result. However, the NIL detection system brings significant loss in the final F-score.
For the slot filling task, we developed a system which combines query expansion and pattern-based reasoning. In expanding person queries, name variants are produced using different rules. For organization acronym queries, an abbreviation extraction technique is employed. Manually collected triggers are used for extracting other slot values. Our system ranked above median among all the participating systems.
Publisher: National Institute of Standards and Technology
Description: The Text Analysis Conference (TAC) is organized by the U.S. National Institute of Standards and Technology (NIST).
Rights: Reproduced with permission of the author.
Appears in Collections:Conference Paper

Files in This Item:
File Description SizeFormat 
Xu_PolyUCOMP_TAC_2011.pdf392.99 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Show full item record

Page views

Last Week
Last month
Citations as of May 28, 2023


Citations as of May 28, 2023

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.