Identifying Co-referential Names Across Large Corpora
Lecture notes in computer sciencePublished 1 January 2006
Levon Lloyd, Andrew Mehler, Steven Skiena
Citations17
SJR quartileQ2
SJR score0.35
SNIP0.55
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 work presents an algorithm for finding all co-reference sets in a large corpus of real news text by involves three steps: morphological similarity detection, contextual similarity analysis, and clustering.
Abstract
A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all such co-reference sets in a large corpus. Our algorithm involves three steps: morphological similarity detection, contextual similarity analysis, and clustering. Finally, we present experimental results on over large corpus of real news text to analyze the performance our techniques.
Keywords
Computer ScienceDecision Sciences
Program electronic library and information systemsAn algorithm for suffix stripping
8,136 Citations1980Martin Porter
An algorithm for suffix stripping is described, which has been implemented as a short, fast program in BCPL, and performs slightly better than a much more elaborate system with which it has been compared.
University of Minnesota Digital Conservancy (University of Minnesota)METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices
1,217 Citations1997George Karypis, Vipin Kumar
The merge/purge problem for large databases
804 Citations1995Mauricio A. Hernández, Salvatore J. Stolfo
This paper details the sorted neighborhood method that is used by some to solve merge/purge and presents experimental results that demonstrates this approach may work well in practice but at great expense, and shows a means of improving the accuracy of the results based upon a multi-pass approach.
Improving machine learning approaches to coreference resolution
709 Citations2001Vincent Ng, Claire Cardie
A noun phrase coreference system that extends the work of Soon et al. (2001) and produces the best results to date on the M UC-6 and MUC-7 coreference resolution data sets --- F-measures of 70.4 and 63.4, respectively.
Entity-based cross-document coreferencing using the Vector Space Model
533 Citations1998Amit Bagga, Breck Baldwin
A cross-document coreference resolution algorithm which uses the Vector Space Model to resolve ambiguities between people having the same name and this algorithm is compared to the scoring algorithm used in the MUC-6 (within document) coreference task.
Learning to match and cluster large high-dimensional data sets for data integration
345 Citations2002William W. Cohen, Jacob Richman
Techniques for clustering and matching identifier names that are both scalable and adaptive, in the sense that they can be trained to obtain better performance in a particular domain are described.
Unsupervised personal name disambiguation
310 Citations2003Gideon Mann, David Yarowsky
This paper presents a set of algorithms for distinguishing personal names with multiple real referents in text, based on little or no supervision, using an unsupervised clustering technique over a rich feature space of biographic facts, which are automatically extracted via a language-independent bootstrapping process.
Cross-Document Coreference on a Large Scale Corpus
122 Citations2004Chung H. Gooi, James Allan
This paper created entity models for different test sets and compared the following disambiguation and clustering techniques to cluster the entity models in order to create coreference chains: Incremental Vector Space, KL-Divergence, Agglomerative Vector Space.
Lecture notes in computer scienceLydia: A System for Large-Scale News Analysis
100 Citations2005Levon Lloyd, Dimitrios Kechagias +1 more
The Lydia project seeks to build a relational model of people, places, and things through natural language processing of news sources and the statistical analysis of entity frequencies and co-locations.
Learning to match and cluster large high-dimensional data sets for data integration
83 Citations2002William W. Cohen, Jacob Richman
Unsupervised Learning of Contextual Role Knowledge for Coreference Resolution
81 Citations2004David L. Bean, Ellen Riloff
A coreference resolver called BABAR is presented that uses contextual role knowledge to evaluate possible antecedents for an anaphor and shows that the contextual roleknowledge improved coreference performance, especially on pronouns.
Journal of the American Society for Information ScienceGetty's Synoname™ and its cousins: A survey of applications of personal name-matching algorithms
78 Citations1992Christine L. Borgman, Susan L. Siegfried
Personal name‐matching techniques may be included in name authority work, information retrieval, or duplicate detection, with some applications matching on name only, and others combining personal names with other data elements in record linkage techniques.
IEEE Transactions on Visualization and Computer GraphicsSpatial Analysis of News Sources
64 Citations2006Alexander Mehler, Y. Bao +3 more
Data from the large-scale newspaper analysis system (Lydia) is used to make entity datamaps, a spatial visualization of the interest in a given named entity, to identify entities which display regional biases.