A consequence of this research was the creation of It-Bank, a collection of thousands of labelled examples of the pronoun it, which will benefit other coreference resolution researchers.

Another avenue of study will look at the interaction between coreference resolution and machine translation.

In general, jointly optimizing translation and coreference is an exciting and largely unexplored research area, now partly enabled by our portable non-referential detection methodology.

Standard coreference resolution data sets annotate all noun phrases that have an antecedent noun phrase in the text.

The goal of coreference resolution is to determine which noun phrases in a document refer to the same real-world entity.

As part of this task, coreference resolution systems must decide which pronouns refer to preceding noun phrases (called antecedents) and which do not.

In sentence (1), it is an anaphoric pronoun referring to some previous noun phrase, like “the sauce” or “an appointment.” In sentence (2), it is part of the idiomatic expression “make it” meaning “succeed.” A coreference resolution system should find an antecedent for the first it but not the second.

Although coreference evaluations, such as the MUC (1997) tasks, also make this distinction, it is not necessarily used by all researchers.

First of all, research in coreference resolution has shown the benefits of modules for general noun anaphoricity determination (Ng and Cardie, 2002; Denis and Baldridge, 2007).

Bergsma and Lin (2006) determine the likelihood of coreference along the syntactic path connecting a pronoun to a possible antecedent, by looking at the distribution of the path in text.

Notably, the first noun-phrase before the context is the word “software.” There is strong compatibility between the pronoun-parent “install” and the candidate antecedent “software.” In a full coreference resolution system, when the anaphora resolution module has a strong preference to link it to an antecedent (which it should when the pronoun is indeed referential), we can override a weak non-referential probability.

The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing.

To deal with this problem, we present an expressive entity-mention model that performs coreference resolution at an entity level.

The solution can explicitly express relations between an entity and the contained mentions, and automatically learn first-order rules important for coreference decision.

Coreference resolution is the process of linking multiple mentions that refer to the same entity.

Most of previous work adopts the mention-pair model, which recasts coreference resolution to a binary classification problem of determining whether or not two mentions in a document are co-referring (e.g.

An alternative learning model that can overcome this problem performs coreference resolution based on entity-mention pairs (Luo et al., 2004; Yang et al., 2004b).

Coreference relations between nodes of certain category types are captured.

Attributes coref_text.rf and coref_gram.rf contain ids of coreferential nodes of the respective types.

2.1.7 Coreferences

Two types of coreferences are annotated on the tectogrammatical layer:

0 grammatical coreference

0 secondary edges, secondary dependencies, coreferences , long-range relations

The aggregation approach described here can be easily extended to improve relation detection and coreference resolution (two argument mentions referring to the same role of related events are likely to corefer ).

c for each event argument string and the names coreferential with or related to the argument, the frequency of the event type;

c for each event argument string and the names coreferential with or related to the argument, the frequency of the event type and role.

Almost all the current event extraction systems focus on processing single documents and, except for coreference resolution, operate a sentence at a time (Grishman et al., 2005; Ahn, 2006; Hardy et al., 2006).

For each argument we also add other names coreferential with or bearing some ACE relation to the argument.

2 In this paper we don’t consider event mention coreference resolution and so don’t distinguish event mentions and events.