[PDF] Top 20 Latent Structures for Coreference Resolution

... Rahman and Ng (2011) consider a series of mod- els with increasing expressiveness, ranging from a mention pair to a cluster-ranking model. However, they do not develop a unified framework for compar- ing approaches, and ... See full document

... The toolkit is implemented in Python. It can pro- cess raw text and data conforming to the format of the CoNLL-2012 shared task on coreference res- olution (Pradhan et al., 2012). The toolkit is or- ganized in ... See full document

... approach. Latent antecedents have recently gained popularity and were used by two systems in the CoNLL 2012 Shared Task, including the win- ning system (Fernandes et ...with latent antecedents that predicts ... See full document

... of coreference resolution for multiple ...anaphoric coreference information, contain var- ious annotation layers such as part-of-speech (POS) tagging, syntax parsing, named entities (NE) and se- ... See full document

... state-of-the-art coreference system for English, we experimented with phrase structure ...for coreference resolution, studying effects on end- to-end performance (as shown in Table ...for ... See full document

... pairwise coreference link ...level structures, in- deed, helps in linking more coreferent event men- tions, which otherwise are difficult with the local classifier trained on lexical and surface ... See full document

... Due to this limitation, the HDP extensions will be able to run only using a restricted, manually selected set of feature types. 7 Therefore, the existence of a novel methodology that is able to consider a much smaller ... See full document

... that maximizes the desired evaluation metric on the training data. Experiments on development data showed that this step results in rather small but consistent improvements in our domain. As noted above, our algorithm is ... See full document

... Finally, some research (Ratinov and Roth, 2012; Bansal and Klein, 2012; Rahman and Ng, 2011a) has tried to integrate world knowledge from web- based statistics or knowledge bases into a corefer- ence system. World ... See full document

... We choose the candidate arcs by simply adapting the sieves method proposed by Lee et al. (2013) to English coreference resolution. Lee et al. propose a list of handcrafted rules that are sequentially ... See full document

... While Ji et al. argue that the second rule usually has high accuracy independently of the particular relation, the accuracy of the other two rules depends on the particular relation. For example, the chairman of a ... See full document

... erence Resolution, Association for Computa- tional Linguistics, chapter Proceedings of the Fifteenth Conference on Computational Natural Language Learning: Shared Task, pages ... See full document

... To extract NPs from the ACE-annotated docu- ments, we train a mention extractor on the train- ing texts (see Section 5.1 of Rahman and Ng (2009) for details), which recalls 83.6% of the NPs in the test set. On the other ... See full document

... in coreference resolution is to capture properties of entity clusters, and use those in the resolution ...ence resolution task, improving average F1 by ... See full document

... Most AL work focuses on instance selection where the unit of selection is one instance repre- sented as a feature vector. In this paper we also attempt document selection, where the unit of se- lection is a document, ... See full document

... Most of the mistakes made by the system are due to not linking co-referring mentions. The constraints improve slightly the recall on a subset of mentions, and here we show other common errors for the sys- tem. For ... See full document

... Coreference is an equivalence relation between two markables, i.e., it is reflexive, symmetric and transitive. The first solution that intuitively comes to mind is binary classification of markable pairs (links). ... See full document

... effective coreference model. Our work advances the state-of-the-art in coreference resolution by bringing learning- based coreference systems to the next level of ...2005 coreference ... See full document

... Although coreference is formally a partitioning problem, the setting is rather different from a typ- ical clustering ...for coreference and should carefully be assessed one by one. The resolution ... See full document

... This paper presents HITS’ coreference reso- lution system that participated in the CoNLL- 2012 shared task on multilingual unrestricted coreference resolution. Our system employs a simple multigraph ... See full document