[PDF] Top 20 Unsupervised Models for Coreference Resolution

... Relaxed head generation. The basic model fo- cuses on head matching, and is therefore likely to (incorrectly) posit the large airport and the small airport as coreferent, for instance. In fact, head matching is a ... See full document

... Coreference resolution in general is a difficult natu- ral language processing (NLP) task and typically re- quires sophisticated inferentially-based knowledge- intensive models (Kehler, ...erence ... See full document

... Named entities also pose another problem with the Haghighi and Klein (2007) coreference model; since it models only the heads of NPs, it will fail to resolve some references to named entities: (“Ford Motor ... See full document

... and coreference resolution reduce these tasks to a binary classifica- tion task, whereby pairs of mentions are classified as coreferential or not (McCarthy and Lehnert, 1995; Soon et ...each ... See full document

... Coreference resolution is the task of identifying the sets of mentions referring to the same ...to coreference resolution exploit a variety of semantic information, the literature on the ... See full document

... graphical models of identity uncertainty based on conditional random ...pair-wise coreference decisions being made independently of the relationships of each element of a ... See full document

... the resolution process. Second, BABAR per- forms reliable case resolution to identify anaphora that can be easily resolved using the lexical and syntactic heuristics described in Section ... See full document

... supervised coreference system that outperforms both the Stanford and IMS ...totally unsupervised and using pairwise features, the results of our system are on par with those of the Stanford system ... See full document

... to coreference resolution, traditionally factored into classification decisions over pairs of nouns (Soon et ...noun coreference; however the examples are still pairs of pronouns, and the example ... See full document

... (ME) models to train the classifiers. Previous work reveal that features play an important role on coref- erence resolution problem, and many different kinds of features has been exploited. In this paper, ... See full document

... state-of-the-art coreference resolvers use machine learning (Witten, Hall & Frank, 2011), many coreference relations can be resolved using relatively simple rules and recent work has shown that rule ... See full document

... and Coreference resolution module as part of seman- tic ...language models based on conditioned ...language models, NEs in the testing corpus are automatically ... See full document

... an unsupervised approach that partitions noun phrases into coreferent groups through clustering ...anaphora resolution using unsupervised methods to extract useful information, such as gender and ... See full document

... The ACE 2005 event coreference task requires that an event coreference resolver perform corefer- ence on event mentions belonging to one of the ACE event types. More specifically, an event mention is ... See full document

... We evaluate unsupervised, supervised and self- trained models on ACE (Phase 2) (Mitchell et al., 2003). 4 This data set is one of the most widely used CoRe benchmarks and was used by the sys- tems that are ... See full document

... We achieve new state-of-the-art results for singleton detection by only using shallow features and simple classifiers. We also show that search space pruning significantly improves different coreference resolu- ... See full document

... projection-based coreference resolver for German and Rus- ...on coreference relations projected through a parallel corpus from ...glish coreference as provided by the shared task ...multiple ... See full document

... CoNLL’12 shared task, which are denoted as best and median respectively. best employs a struc- tured prediction model with learned combinations of 70 basic features. We also compare with two supervised variants of our ... See full document

... Further, deterministic or strong non-deterministic dependencies cause Gibbs sampling to break down (Poon & Domingos, 2006), making it difficult to leverage many linguistic regularities. For exam- ple, apposition (as ... See full document

... our unsupervised generating proce- dure sometimes yields examples where the cor- rect answer cannot be deduced given the available information, we refer to these as unsolvable ex- ... See full document