Coreference for NLP applications
Published 1 January 2000Open access
Thomas Morton
Citations82
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents several techniques for performing automatic coreference annotation and performance results for each of them and builds a simple question-answering system which uses the techniques.
Abstract
This paper presents several techniques for performing automatic coreference annotation and performance results for each of them. To demonstrate that they can be applied to real-world data, we have built a simple question-answering system which uses the techniques. A system using coreference is compared to a baseline system with the result that the addition of the coreference annotation improves performance.
Keywords
Computer Science
Building a Large Annotated Corpus of English: The Penn Treebank
7,528 Citations1993Mitchell P. Marcus
Maximum Entropy Model for Part-Of-Speech Tagging
1,276 Citations1996Adwait Ratnaparkhi
A statistical model which trains from a corpus annotated with Part Of Speech tags and assigns them to previously unseen text with state of the art accuracy and discusses the corpus consistency problems discovered during the implementation of these features.
Computational LinguisticsAn algorithm for pronominal anaphora resolution
758 Citations1994Shalom Lappin, Herbert J. Leass
The algorithm applies to the syntactic representations generated by McCord's Slot Grammar parser and relies on salience measures derived from syntactic structure and a simple dynamic model of attentional state and to models of anaphora resolution that invoke a variety of informational factors in ranking antecedent candidates.
A model-theoretic coreference scoring scheme
682 Citations1995Marc Vilain, John D. Burger +3 more
This note describes a scoring scheme for the coreference task in MUC6 that improves on the original approach by grounding the scoring scheme in terms of a model; producing more intuitive recall and precision scores; and not requiring explicit computation of the transitive closure of coreference.
A maximum entropy approach to identifying sentence boundaries
393 Citations1997Jeffrey C. Reynar, Adwait Ratnaparkhi
A trainable model for identifying sentence boundaries in raw text that can be trained easily on any genre of English, and should be trainable on any other Romanalphabet language.
A Statistical Approach to Anaphora Resolution
221 Citations1998Niyu Ge, John Hale +1 more
An algorithm for identifying pronominal anaphora and two experiments based upon this algorithm are presented, which incorporate multiple anaphoras resolution factors into a statistical framework specifically the distance between the pronoun and the proposed antecedent, gender/number/animaticity of the proposal, governing head information and noun phrase repetition.
ScholarlyCommons (University of Pennsylvania)A Simple Introduction to Maximum Entropy Models for Natural Language Processing
170 Citations1997Adwait Ratnaparkhi
The goal of this report is to provide enough detail to re-implement the maximum entropy models described in [Ratnaparkhi,1996, Reynar and Ratnaparkhi,1997, Ratnaparkhi, 1997] and also to provide a simple explanation of the maximum entropy formalism.
ACM SIGART BulletinPronoun resolution
91 Citations1977Jerry R. Hobbs
Four examples, including the classic examples of Winograd and Charniak, are presented that demonstrate pronoun resolution within the semantic approach.
Using coreference chains for text summarization
72 Citations1999Saliha Azzam, Kevin Humphreys +1 more
The use of coreference chains for the production of text summaries is described, using a variety of criteria to select a 'best' chain to represent the main topic of a text.
University of Pennsylvania
66 Citations1995Breck Baldwin, Mike Collins +4 more
An intensive effort with full-time participation from Baldwin and Reynar, and part-time efforts from the other authors was began, and a simplistic coreference resolution system which resolved proper nouns by means of string matching was implemented.
Dynamic Coreference-Based Summarization
66 Citations1998Breck Baldwin, Thomas Morton
A query-sensitive text summarization technology suited for the task of determining whether a document is relevant to <'-" query is developed, built upon the CAMP NLP spt.cm.
Factors in anaphora resolution: they are not the only things that matter
58 Citations1997Ruslan Mitkov
The paper discusses the significance of factors in anaphora resolution and on the basis of a comparative study argues that what matters is not only a good set of reliable factors but also the strategy for their application.
Text REtrieval ConferenceA Sys Called Qanda.
32 Citations1999Eric Breck, John D. Burger +4 more
The question answering system was built to experiment with natural language processing technologies such as shallow parsing, named entity tagging, and coreference chaining because it felt that the small number of terms in the questions coupled with the short length of the answers would make NLP technologies clearly beneficial.
Studies in corpus linguisticsProcessing definite descriptions in corpora
29 Citations2000Renata Vieira, Massimo Poesio
An algorithm which resolves anaphoric definite descriptions and also identifies novel ones is proposed and evaluated by comparing its results with an annotation produced by human subjects.
Using coreference for question answering
24 Citations1999Thomas Morton
An evaluation of a system which retrieves answers to queries based on coreference relationships between entities and events in the query and documents demonstrates that the amount of information that the user must process, to find an answer to their query, is reduced by an order of magnitude.