Overview of UI-CCG Systems for Event Argument Extraction , Entity Discovery and Linking , and Slot Filler Validation

In this paper, we describe the University of Illinois (UI CCG) submission to the 2013 TAC KBP Event Argument Extraction (EAE), English Entity Discovery and Linking (EDL), and Slot Filler Validation (SFV) tasks. We developed three separate systems. Our Event Argument Recognition system infers world knowledge from event argument overlaps to improve performance of a recognition/labeling pipeline. Our Entity Discovery and Linking system builds on the Illinois Wikifier, augmenting its candidate identification capabilities and using a clustering algorithm for cross-document coreference. Our Slot Filler Validation system follows an entailment formulation that evaluates each candidate answer based on the evidence present in the source document it refers to. 1 Illinois Event Argument Extraction System We adopted a two step approach for event extraction, and used a heuristic rule to induce world knowledge to improve performance. For event extraction, we first detected the triggers and then detected the arguments. For world knowledge induction, we computed statistics over ACE 2005 data to identify argument overlaps between event sub-types. 1.1 EAE System Description The UI CCG Event Argument Extraction system uses a two-stage approach. The first stage identifies event trigger words, and the second identifies event argument mentions. 1.1.1 Description of Training Data We used ACE2005 as our training data, as its event taxonomy is similar to that of the Event Argument Extraction task. We trained classifiers to recognize event triggers and event argument mentions; in the following sections, we describe the features we used. To detect the triggers, we train the classifiers based on the trigger features. To detect the arguments, we train the classifiers based on trigger features, mention features, and pair features. 1http://www.itl.nist.gov/iad/mig//tests/ace/ace05/

[1]  Dan Roth,et al.  The Use of Classifiers in Sequential Inference , 2001, NIPS.

[2]  Chih-Jen Lin,et al.  LIBLINEAR: A Library for Large Linear Classification , 2008, J. Mach. Learn. Res..

[3]  Dan Roth,et al.  Part of Speech Tagging Using a Network of Linear Separators , 1998, ACL.

[4]  Christopher D. Manning,et al.  Incorporating Non-local Information into Information Extraction Systems by Gibbs Sampling , 2005, ACL.

[5]  Dan Roth,et al.  Illinois Cognitive Computation Group UI-CCG TAC 2013 Entity Linking and Slot Filler Validation Systems , 2013, TAC.

[6]  Chen Chen,et al.  Joint Modeling for Chinese Event Extraction with Rich Linguistic Features , 2012, COLING.

[7]  Dan Klein,et al.  Fast Exact Inference with a Factored Model for Natural Language Parsing , 2002, NIPS.

[8]  Dan Roth,et al.  A Discriminative Latent Variable Model for Online Clustering , 2014, ICML.

[9]  Dan Roth,et al.  Relational Inference for Wikification , 2013, EMNLP.

[10]  Evgeniy Gabrilovich,et al.  Feature Generation for Text Categorization Using World Knowledge , 2005, IJCAI.

[11]  Dan Roth,et al.  Robust, Light-weight Approaches to compute Lexical Similarity , 2010 .

[12]  Dan Roth,et al.  Design Challenges and Misconceptions in Named Entity Recognition , 2009, CoNLL.

[13]  Ido Dagan,et al.  Recognizing Textual Entailment: Models and Applications , 2013, Recognizing Textual Entailment: Models and Applications.

[14]  Jeffrey Dean,et al.  Distributed Representations of Words and Phrases and their Compositionality , 2013, NIPS.

[15]  Dan Roth,et al.  The Importance of Syntactic Parsing and Inference in Semantic Role Labeling , 2008, CL.

[16]  Evgeniy Gabrilovich,et al.  Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis , 2007, IJCAI.

[17]  Geoffrey Zweig,et al.  Linguistic Regularities in Continuous Space Word Representations , 2013, NAACL.

[18]  David Ahn,et al.  The stages of event extraction , 2006 .

[19]  Doug Downey,et al.  Local and Global Algorithms for Disambiguation to Wikipedia , 2011, ACL.