Unsupervised Event Coreference Resolution with Rich Linguistic Features
Published 11 July 2010
Cosmin A. Bejan, Sanda M. Harabagiu
Citations154
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
A new class of nonparametric Bayesian models designed with the purpose of clustering complex linguistic objects can be effectively applied to an open-domain event coreference task.
Abstract
This paper examines how a new class of nonparametric Bayesianmodelscanbeeffectively applied to an open-domain event coreference task. Designed with the purpose of clustering complex linguistic objects, these models consider a potentially infinitenumber of features andcategorical outcomes. The evaluation performed for solving both within- and cross-document event coreference shows significant improvements of themodelswhencompared against twobaselines for this task. 1
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
Proceedings of the IEEEA tutorial on hidden Markov models and selected applications in speech recognition
22,785 Citations1989L. R. Rabiner
IEEE Transactions on Pattern Analysis and Machine IntelligenceStochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
17,980 Citations1984Stuart Geman, Donald Geman
The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
Language<b>WordNet: An electronic lexical database</b> . Ed. by Christiane Fellbaum. Cambridge, MA: MIT Press, 1998. Pp. xxii, 423.
11,687 Citations2000Adam Kilgarriff
The lexical database: nouns in WordNet, George A. Miller modifiers in WordNet, Katherine J. Miller a semantic network of English verbs, and applications of WordNet: building semantic concordances are presented.
The Annals of StatisticsA Bayesian Analysis of Some Nonparametric Problems
4,812 Citations1973Thomas S. Ferguson
Journal of the American Statistical AssociationHierarchical Dirichlet Processes
3,567 Citations2006Yee Whye Teh, Michael I. Jordan +2 more
This work considers problems involving groups of data where each observation within a group is a draw from a mixture model and where it is desirable to share mixture components between groups, and considers a hierarchical model, specifically one in which the base measure for the childDirichlet processes is itself distributed according to a Dirichlet process.
The Berkeley FrameNet Project
2,564 Citations1998Collin F. Baker, Charles J. Fillmore +1 more
This report will present the project's goals and workflow, and information about the computational tools that have been adapted or created in-house for this work.
Computational LinguisticsThe Proposition Bank: An Annotated Corpus of Semantic Roles
2,302 Citations2005Martha Palmer, Daniel Gildea +1 more
An automatic system for semantic role tagging trained on the corpus is described and the effect on its performance of various types of information is discussed, including a comparison of full syntactic parsing with a flat representation and the contribution of the empty trace categories of the treebank.
Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)Topic Detection and Tracking Pilot Study Final Report
951 Citations2018James Allan, Jaime Carbonell +3 more
International Journal of Molecular SciencesTimeML: Robust Specification of Event and Temporal Expressions in Text
717 Citations2003James Pustejovsky, José M. Castaño +6 more
This review focuses on the regulatory role of CEACAM1 in liver and biliary tract architecture in health and disease, and on its metabolic role and function as an immune checkpoint regulator of hepatic inflammation.
Infinite latent feature models and the Indian buffet process
552 Citations2005Zoubin Ghahramani, Thomas L. Griffiths
A probability distribution over equivalence classes of binary matrices with a finite number of rows and an unbounded number of columns is defined, suitable for use as a prior in probabilistic models that represent objects using a potentially infinite array of features.
On coreference resolution performance metrics
535 Citations2005Xiaoqiang Luo
The paper proposes a Constrained Entity-Alignment F-Measure (CEAF) for evaluating coreference resolution and shows that the best alignment is a maximum bipartite matching problem which can be solved by the Kuhn-Munkres algorithm.
The stages of event extraction
511 Citations2006David Ahn
This paper presents a simple, modular approach to event extraction that allows for experiment with a variety of machine learning methods for sub-tasks of varying difficulty, as well as to evaluate the impact on performance these sub-Tasks have on the overall task.
The MIT Press eBooksThe Infinite Hidden Markov Model
481 Citations2002Matthew J. Beal, Zoubin Ghahramani +1 more
The Individuation of Events
433 Citations1969Donald Davidson
Finding Contradictions in Text
230 Citations2008Marie-Catherine de Marneffe, Anna N. Rafferty +1 more
It is demonstrated that a system for contradiction needs to make more fine-grained distinctions than the common systems for entailment, and is argued for the centrality of event coreference and therefore incorporate such a component based on topicality.
Beam sampling for the infinite hidden Markov model
224 Citations2008Jurgen Van Gael, Yunus Saatçi +2 more
This paper introduces a new inference algorithm for the infinite Hidden Markov model called beam sampling, which typically outperforms the Gibbs sampler and is more robust.
Question answering based on semantic structures
214 Citations2004Srini Narayanan, Sanda M. Harabagiu
The ability of the implemented system to perform several forms of probabilistic and temporal inferences to extract answers to complex questions is reported on, indicating enhanced accuracy over current state-of-the-art Q/A systems.
Joint unsupervised coreference resolution with Markov logic
211 Citations2008Hoifung Poon, Pedro Domingos
This paper presents the first unsupervised approach that is competitive with supervised ones, made possible by performing joint inference across mentions, in contrast to the pairwise classification typically used in supervised methods, and by using Markov logic as a representation language.
Unsupervised models for coreference resolution
200 Citations2008Vincent Ng
A cluster-ranking approach to coreference resolution that combines the strengths of mention rankers and entity-mention models is proposed and Experimental results on the ACE data sets demonstrate its superior performance to competing approaches.
Robust textual inference via graph matching
159 Citations2005Aria Haghighi, Andrew Y. Ng +1 more
A learned graph matching approach to approximate entailment using the amount of the sentence's semantic content which is contained in the text, which outperforms Bag-Of-Words and TF-IDF models.
Meeting of the Association for Computational LinguisticsUnsupervised Coreference Resolution in a Nonparametric Bayesian Model
135 Citations2007Aria Haghighi, Dan Klein
An unsupervised, nonparametric Bayesian approach to coreference resolution which models both global entity identity across a corpus as well as the sequential anaphoric structure within each document is presented.
Graph-based event coreference resolution
108 Citations2009Zheng Chen, Heng Ji
This paper models event coreference resolution as a spectral graph clustering problem and evaluates the clustering algorithm on ground truth event mentions using ECM F-Measure and obtains the ECM-F scores of 0.8363 and 0.8312 respectively.
UCL Discovery (University College London)The Infinite Factorial Hidden Markov Model
89 Citations2008Jurgen Van Gael, Yee Whye Teh +1 more
After constructing an inference scheme which combines slice sampling and dynamic programming, it is demonstrated how the infinite factorial hidden Markov model can be used for blind source separation.
Event coreference for information extraction
86 Citations1997Kevin Humphreys, Robert Gaizauskas +1 more
This work proposes a general approach for performing event coreference and for constructing complex event representations, such as those required for information extraction tasks, based on a representation which allows a tight coupling between world or conceptual modelling and discourse modelling.
A Frame-Semantic Approach to Semantic Annotation
78 Citations1997John B. Lowe
The primary aim of this project is to produce frame-semantic descriptions of lexical items and to use partially semantically tagged corpora for semantically annotating corpora, with a view to selecting and structuring appropriate tagsets for semantic annotation.
Cross-document event coreference
74 Citations1999Amit Bagga, Breck Baldwin
Cross document event tracking technology that extends earlier efforts in cross document person coreference takes class of events, like "resignations" and clusters documents that mention resignations into equivalence classes and evaluates events including "elections" and "espionage" events.
A Linguistic Resource for Discovering Event Structures and Resolving Event Coreference
42 Citations2008Cosmin A. Bejan, Sanda M. Harabagiu
A linguistic resource that annotates event structures in texts and proposes and annotates a set of six relations that best capture the concept of event structure, which are: subevent, reason, purpose, enablement, precedence and related.
Nonparametric Bayesian Models for Unsupervised Event Coreference Resolution
13 Citations2009Cosmin A. Bejan, Matthew Titsworth +2 more
A sequence of unsupervised, nonparametric Bayesian models for clustering complex linguistic objects considered a potentially infinite number of features and categorical outcomes for coreference on two corpora are presented.
Deriving Chronological Information from Texts through a Graph-Based Algorithm.
9 Citations2007Cosmin A. Bejan
A method of deriving chronological order of events in natural language texts by constraining temporal boundaries associated to events and projecting them on a timeline is proposed and results obtained show improvement over the previous event extraction systems when evaluated on the same corpus.