A large-scale exploration of effective global features for a joint entity detection and tracking model
Published 1 January 2005Open access
Hal Daumé, Daniel Marcu
Citations83
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 joint EDT model is developed and the utility of many features are explored, demonstrating their effectiveness on this task.
Abstract
Entity detection and tracking (EDT) is the task of identifying textual mentions of real-world entities in documents, extending the named entity detection and coreference resolution task by considering mentions other than names (pronouns, definite descriptions, etc.). Like NE tagging and coreference resolution, most solutions to the EDT task separate out the mention detection aspect from the coreference aspect. By doing so, these solutions are limited to using only local features for learning. In contrast, by modeling both aspects of the EDT task simultaneously, we are able to learn using highly complex, non-local features. We develop a new joint EDT model and explore the utility of many features, demonstrating their effectiveness on this task. 1
Keywords
Computer Science
ScholarlyCommons (University of Pennsylvania)Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
12,978 Citations2001John Lafferty, Andrew McCallum +1 more
This work presents iterative parameter estimation algorithms for conditional random fields and compares the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data.
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.
Accurate methods for the statistics of surprise and coincidence
2,688 Citations1993Ted Dunning
Max-Margin Markov Networks
1,251 Citations2003Ben Taskar, Carlos Guestrin +1 more
Maximum margin Markov (M3) networks incorporate both kernels, which efficiently deal with high-dimensional features, and the ability to capture correlations in structured data, and a new theoretical bound for generalization in structured domains is provided.
Computational LinguisticsA Machine Learning Approach to Coreference Resolution of Noun Phrases
998 Citations2001Wee Meng Soon, Hwee Tou Ng +1 more
The learning approach to coreference resolution of noun phrases in unrestricted text is presented, indicating that on the general noun phrase coreference task, the learning approach holds promise and achieves accuracy comparable to that of nonlearning approaches.
Machine LearningAn Algorithm that Learns What's in a Name
784 Citations1999Daniel M. Bikel, Richard Schwartz +1 more
IdentiFinderTM, a hidden Markov model that learns to recognize and classify names, dates, times, and numerical quantities, is evaluated and is competitive with approaches based on handcrafted rules on mixed case text and superior on text where case information is not available.
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.
A New Approximate Maximal Margin Classification Algorithm
228 Citations2000Claudio Gentile
Randomized algorithms and NLP
210 Citations2005Deepak Ravichandran, Patrick Pantel +1 more
The power of randomized algorithm is explored to address the challenge of working with very large amounts of data and the running time from quadratic to practically linear in the number of elements to be computed.
A Statistical Model for Multilingual Entity Detection and Tracking
187 Citations2004Radu Florian, H. Hassan +6 more
This paper presents a statistical language-independent framework for identifying and tracking named, nominal and pronominal references to entities within unrestricted text documents, and chaining them into clusters corresponding to each logical entity present in the text.
CORE Scholar (Wright State University)Collective Segmentation and Labeling of Distant Entities in Information Extraction
148 Citations2004Charles Sutton, Andrew McCallum
This work presents a CRF that explicitly represents dependencies between the labels of pairs of similar words in a document, and shows that learning these dependencies leads to a 13.7% reduction in error on the field that had caused the most repetition errors.
Offline strategies for online question answering
125 Citations2003Michael Fleischman, Eduard Hovy +1 more
This work presents an alternative strategy in which patterns are used to extract highly precise relational information offline, creating a data repository that is used to efficiently answer questions.
The MIT Press eBooksLearning as Search Optimization
114 Citations2007Hal Daumé, Daniel Marcu
This chapter contains sections titled: Introduction, Previous Work, Search Optimization, Experiments, Summary and Discussion.
ArXiv.orgLearning as Search Optimization: Approximate Large Margin Methods for Structured Prediction
49 Citations2009Hal Daumé, Daniel Marcu