In this paper, we present a learning approach to coreference resolution of noun phrases in
unrestricted text. The approach learns from a small, annotated corpus and the task includes …

We present a noun phrase coreference system that extends the work of Soon et al.(2001)
and, to our knowledge, produces the best results to date on the MUC-6 and MUC-7 …

Teaching computers to solve language problems is one of the major challengesof natural
language processing. There is a large amount of interesting researchdevoted to this field …

Anaphora resolution is a complicated problem in Natural Language Processing and has
attracted the attention of many researchers. The approaches developed-traditional (from …

We present an approach to pronoun resolution based on syntactic paths. Through a simple
bootstrapping procedure, we learn the likelihood of coreference between a pronoun and a …

This thesis describes an implemented technique for resolving anaphoric pronouns referring
to both individual and abstract entities. The model defines rules for evoking high-order …

» ¼T© RSPv@ ½¾ qRv¿ µ@ BT À g ¹ Á S d%) zr% µ 2 e© d©% S¤ dÂt¦ 3©£«) g) S% Ã) zg¢
Ä) g 2 S 4¤ S¬ 3 S)«g©£ g Á zg% Å rr 4£}«Æ S¦ zr) z 4 S g S g vzr S¤ z) td©)) g) S Çt § ÈÄ z£ …

We approach the zero-anaphora resolution problem by decomposing it into intra-sentential
and inter-sentential zeroanaphora resolution. For the former problem, syntactic patterns of …

We propose a method that incorporates various novel contextual cues into a machine
learning for resolving coreference. Distinct characteristics of our model are (i) incorporating …

This paper argues that even though there has been considerable ad-vance in the research
in anaphora resolution over the last 10 years, there are still a number of outstanding issues …