Sciweavers

106 search results - page 18 / 22
» Data-Driven Coreference Resolution
Sort
View
EMNLP
2009
13 years 5 months ago
A Probabilistic Model for Associative Anaphora Resolution
This paper proposes a probabilistic model for associative anaphora resolution in Japanese. Associative anaphora is a type of bridging anaphora, in which the anaphor and its antece...
Ryohei Sasano, Sadao Kurohashi
FLAIRS
2008
13 years 10 months ago
CANDEL: An Algorithm for Same-Sentence Pronominal Resolution
This paper presents a syntactic path-based learning algorithm (CANDEL from CANDIDATE-ELIMINATION) for the coreference resolution of pronouns that have their antecedents in the sam...
Cristina Nicolae, Gabriel Nicolae
COLING
2008
13 years 9 months ago
Topic Identification for Fine-Grained Opinion Analysis
Within the area of general-purpose finegrained subjectivity analysis, opinion topic identification has, to date, received little attention due to both the difficulty of the task a...
Veselin Stoyanov, Claire Cardie
LREC
2010
140views Education» more  LREC 2010»
13 years 9 months ago
A Typology of Near-Identity Relations for Coreference (NIDENT)
The task of coreference resolution requires people or systems to decide when two referring expressions refer to the `same' entity or event. In real text, this is often a diff...
Marta Recasens, Eduard H. Hovy, Maria Antòn...
CORR
2004
Springer
71views Education» more  CORR 2004»
13 years 7 months ago
A Public Reference Implementation of the RAP Anaphora Resolution Algorithm
This paper describes a standalone, publicly-available implementation of the Resolution of Anaphora Procedure (RAP) given by Lappin and Leass (1994). The RAP algorithm resolves thi...
Long Qiu, Min-Yen Kan, Tat-Seng Chua