Anaphora and coreference resolution: A review

R Sukthanker, S Poria, E Cambria, R Thirunavukarasu - Information Fusion, 2020 - Elsevier
Coreference resolution aims at resolving repeated references to an object in a document
and forms a core component of natural language processing (NLP) research. When used as …

Computational models of anaphora

M Poesio, J Yu, S Paun, A Aloraini, P Lu… - Annual Review of …, 2023 - annualreviews.org
Interpreting anaphoric references is a fundamental aspect of our language competence that
has long attracted the attention of computational linguists. The appearance of ever-larger …

A survey on semantic processing techniques

R Mao, K He, X Zhang, G Chen, J Ni, Z Yang… - Information …, 2024 - Elsevier
Semantic processing is a fundamental research domain in computational linguistics. In the
era of powerful pre-trained language models and large language models, the advancement …

[BOOK][B] Anaphora resolution

R Mitkov - 2014 - api.taylorfrancis.com
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 …

Global inference for sentence compression: An integer linear programming approach

J Clarke, M Lapata - Journal of Artificial Intelligence Research, 2008 - jair.org
Sentence compression holds promise for many applications ranging from summarization to
subtitle generation. Our work views sentence compression as an optimization problem and …

Centering: A parametric theory and its instantiations

M Poesio, R Stevenson, BD Eugenio… - Computational …, 2004 - direct.mit.edu
Centering theory is the best-known framework for theorizing about local coherence and
salience; however, its claims are articulated in terms of notions which are only partially …

Analysing anaphoric ambiguity in natural language requirements

H Yang, A De Roeck, V Gervasi, A Willis… - Requirements …, 2011 - Springer
Many requirements documents are written in natural language (NL). However, with the
flexibility of NL comes the risk of introducing unwanted ambiguities in the requirements and …

[PDF][PDF] Coreference resolution using competition learning approach

X Yang, G Zhou, J Su, CL Tan - … of the 41st annual meeting of the …, 2003 - aclanthology.org
In this paper we propose a competition learning approach to coreference resolution.
Traditionally, supervised machine learning approaches adopt the singlecandidate model …

Beyond salience: Interpretation of personal and demonstrative pronouns

S Brown-Schmidt, DK Byron, MK Tanenhaus - Journal of Memory and …, 2005 - Elsevier
Three experiments examined the hypothesis that it preferentially refers to the most salient
entity in a discourse, whereas that preferentially refers to a conceptual composite. In …

Discourse constraints for document compression

J Clarke, M Lapata - Computational Linguistics, 2010 - direct.mit.edu
Sentence compression holds promise for many applications ranging from summarization to
subtitle generation. The task is typically performed on isolated sentences without taking the …