A second-order Hidden Markov Model for part-of-speech tagging
Published 1 January 1999Open access
Scott M. Thede, Mary P. Harper
Citations141
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
An extension to the hidden Markov model for part-of-speech tagging using second-order approximations for both contextual and lexical probabilities that increases the accuracy of the tagger to state of the art levels is described.
Abstract
This paper describes an extension to the hidden Markov model for part-of-speech tagging using second-order approximations for both contextual and lexical probabilities. This model increases the accuracy of the tagger to state of the art levels. These approximations make use of more contextual information than standard statistical systems. New methods of smoothing the estimated probabilities are also introduced to address the sparse data problem.
Keywords
Computer Science
Proceedings of the IEEEA tutorial on hidden Markov models and selected applications in speech recognition
22,785 Citations1989L. R. Rabiner
Building a Large Annotated Corpus of English: The Penn Treebank
7,528 Citations1993Mitchell P. Marcus
BiometrikaTHE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS
3,227 Citations1953I. J. Good
IEEE Transactions on Acoustics Speech and Signal ProcessingEstimation of probabilities from sparse data for the language model component of a speech recognizer
1,645 Citations1987Slava M. Katz
The model offers, via a nonlinear recursive procedure, a computation and space efficient solution to the problem of estimating probabilities from sparse data, and compares favorably to other proposed methods.
Transformation-based error-driven learning and natural language processing: a case study in part-of-speech tagging
1,531 Citations1995Eric Brill
This paper describes a simple rule-based approach to automated learning of linguistic knowledge that has been shown for a number of tasks to capture information in a clearer and more direct fashion without a compromise in performance.
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.
Computer Speech & LanguageRobust part-of-speech tagging using a hidden Markov model
416 Citations1992Julian Kupiec
A system for part-of-speech tagging is described, based on a hidden Markov model which can be trained using a corpus of untagged text, which results in a model that correctly tags approximately 96% of the text.
Coping with ambiguity and unknown words through probabilistic models
261 Citations1993Ralph Weischedel, Richard Schwartz +3 more
Automatic rule induction for unknown-word guessing
260 Citations1997Andrei Mikheev
Using the proposed technique, unknown-word-guessing rule sets were induced and integrated into a stochastic tagger and a rule-based tagger, which were then applied to texts with unknown words.
arXiv (Cornell University)MBT: A Memory-Based Part of Speech Tagger-Generator
259 Citations1996Walter Daelemans, Jakub Zavrel +2 more
Equations for part-of-speech tagging
169 Citations1993Eugene Charniak, Curtis Hendrickson +2 more
This paper derives from first principles the basic equations for a few of the basic hidden-Markov-model word taggers as well as equations for other models which may be novel (the descriptions in previous papers being too spare to be sure).
Part of speech tagging using a network of linear separators
103 Citations1998Dan Roth, Dmitry Zelenko
An architecture and an on-line learning algorithm are presented that utilizes this mistake-driven algorithm for multi-class prediction-selecting the part of speech of a word and it is shown that the algorithm performs comparably to the best known algorithms for POS.
Improving data driven wordclass tagging by system combination
100 Citations1998Hans van Halteren, Jakub Zavrel +1 more
How the differences in modelling between different data driven systems performing the same NLP task can be exploited to yield a higher accuracy than the best individual system is examined.
A report of recent progress in transformation-based error-driven learning
36 Citations1994Eric Brill
A method for expressing lexical relations in tagging that stochastic taggers are currently unable to express is described and how the tagger can be extended into a k-best tagger, where multiple tags can be assigned to words in some cases of uncertainty.
Proceedings of the 17th international conference on Computational linguistics -Part of speech tagging using a network of linear separators
22 Citations1998Dan Roth, Dmitry Zelenko
Unsupervised learning of word-category guessing rules
19 Citations1996Andrei Mikheev
This paper presents a technique for fully unsupervised statistical acquisition of rules which guess possible parts-of-speech for unknown words, induced from the lexicon and a raw corpus.
Columbia Academic Commons (Columbia University)Using word class for part-of-speech disambiguation
16 Citations1996Evelyne Tzoukermann, Dragomir Radev
It is demonstrated that, besides providing good estimates for disambiguation, word classes solve some of the problems caused by sparse training data.
Predicting part-of-speech information about unknown words using statistical methods
10 Citations1998Scott M. Thede
This paper examines the feasibility of using statistical methods to train a part-of-speech predictor for unknown words, without incorporating hand-crafted linguistic information, to be used with any language for which there is a large tagged training corpus.
Tagging English by path voting constraints
6 Citations1998Gökhan Tür, Kemal Oflazer
A constraint-based tagging approach where individual constraint rules vote on sequences of matching tokens and tags, which makes the outcome of the disambiguation independent of the rule sequence, and hence relieves the rule developer from worrying about potentially conflicting rule sequencing.
Proceedings of the 17th international conference on Computational linguistics -Tagging English by path voting constraints
2 Citations1998Gökhan Tür, Kemal Oflazer