Patrick Sturt.
The time-course of the application of binding constraints in
reference resolution.
Journal of Memory and Language, 48(3):542--562, 2003.
[ .pdf ]
Abstract: We report two experiments which examined
the role of binding theory in on-line sentence processing.
Participants' eye movements were recorded while they read
short texts which included anaphoric references with
reflexive anaphors (himself or herself). In each of the
experiments, two characters were introduced into the
discourse before the anaphor, and only one of these
characters was a grammatical antecedent for the anaphor in
terms of binding theory. Both experiments showed that
Principle A of the binding theory operates at the very
earliest stages of processing; early eyemovement measures
showed evidence of processing diffculty when the gender of
the reflexive anaphor mismatched the stereotypical gender of
the grammatical antecedent. However, the gender of the
ungrammatical antecedent had no effect on early processing,
although it affected processing during later stages in
Experiment 1. An additional experiment showed that the gender
of the ungrammatical antecedent also affected the likelihood
of participants settling on an ungrammatical final
interpretation. The results are interpreted in relation to
the notions of bonding and resolution in reference
processing.
Ryu Iida, Kentaro Inui, Hiroya Takamura, and Yuji Matsumoto.
Incorporating contextual cues in trainable models for coreference
resolution.
In Robert Dale, Kees van Dempter, and Ruslan Mitkov, editors,
Proceedings of the EACL-03 Workshop on the Computational Treatment of
Anaphora, Budapest, 2003.
Abstract: 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 more linguistic features capturing
contextual information that is more sophisticated than what
is offered in Centering Theory, and (ii) a tournament model
for selecting a referent. Our experiments show that this
model significantly outperforms earlier machine learning
approaches, such as Soon et al. (2001).
Robert Dale, Kees van Dempter, and Ruslan Mitkov, editors.
Proceedings of the EACL-03 Workshop on the Computational
Treatment of Anaphora, Budapest, 2003.
Vincent Ng and Claire Cardie.
Improving machine learning approaches to coreference resolution.
In 40th Annual Meeting of the Asssociation for Computational
Linguistics, 2002.
Abstract: 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 coreference resolution data sets -- F-measures of 70.4
and 63.4, respectively. Improvements arise from two sources:
extra-linguistic changes to the learning framework and a
large-scale expansion of the feature set to include more
sophisticated linguistic knowledge.
Wee Meng Soon, Hwee Tou Ng, and Daniel Chung Yong Lim.
A machine learning approach to coreference resolution of noun
phrases.
Computational Linguistics, 27(4):521--544, 2001.
Abstract: 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 resolving not just a
certain type of noun phrase (e.g., pronouns) but rather
general noun phrases. It also does not restrict the entity
types of the noun phrases; that is, coreference is assigned
whether they are of "organization," "person," or other types.
We evaluate our approach on common data sets (namely, the
MUC-6 and MUC-7 coreference corpora) and obtain encouraging
results, indicating that on the general noun phrase
coreference task, the learning approach holds promise and
achieves accuracy comparable to that of nonlearning
approaches. Our system is the first learning-based system
that offers performance comparable to that of
state-of-the-art nonlearning systems on these data sets.
Frank Keller and Ash Asudeh.
Constraints on linguistic coreference: Structural vs. pragmatic
factors.
In Johanna D. Moore and Keith Stenning, editors, Proceedings of
the 23rd. Annual Conference of the Cognitive Science Society, pages
483--488, Mahwah, NJ, 2001. Lawrence Erlbaum Associates.
[ .pdf ]
Abstract: Binding theory is the component of grammar
that regulates the interpretation of noun phrases. Certain
syntactic configurations involving picture noun phrases
(PNPs) are problematic for the standard formulation of
binding theory, which has prompted competing proposals for
revisions of the theory. Some authors have proposed an
account based on structural constraints, while others have
argued that anaphors in PNPs are exempt from binding theory,
but subject to pragmatic restrictions. In this paper, we
present an experimental study that aims to resolve this
dispute. The results show that structural factors govern the
binding possibilities in PNPs, while pragmatic factors play
only a limited role. However, the structural factors
identified differ from the ones standardly assumed.
Renata Vieira and Massimo Poesio.
An empirically based system for processing definite descriptions.
Computational Linguistics, 26(4):539--593, 2000.
[ .pdf ]
Abstract: We present an implemented system for
processing definite descriptions in arbitrary domains. The
design of the system is based on the results of a corpus
analysis previously reported, which highlighted the
prevalence of discourse-new descriptions in newspaper
corpora. The annotated corpus was used to extensively
evaluate the proposed techniques for matching definite
descriptions with their antecedents, discourse segmentation,
recognizing discourse-new descriptions, and suggesting
anchors for bridging descriptions.
Ruslan Mitkov.
Anaphora resolution: the state of the art, 1999.
Working paper (Based on the COLING'98/ACL'98 tutorial on anaphora
resolution).
[ .ps.gz ]
Ruslan Mitkov.
Robust pronoun resolution with limited knowledge.
In Proceedings 17th International Conference on Computational
Linguistics, 36th Annual Meeting of the ACL, Coling-ACL '98, pages 869--865,
Montreal, Canada, 1998.
Ruslan Mitkov.
Robust pronoun resolution with limited knowledge.
In In Proceedings of the 18.th International Conference on
Computational Linguistics (COLING'98)/ACL'98 Conference, pages 869--875,
Montreal, Canada, 1998.
[ .ps.gz ]