Abstract

This paper presents a couple of extensions to a basic Markov Model tagger (called TreeTagger) which improve its accuracy when trained on small corpora. The basic tagger was originally developed for English [Schmid, 1994]. The extensions together reduced error rates on a German test corpus by more than a third.

Citations

4071	C4.5: Programs for machine learning - Quinlan - 1993
1654	B.: Building a large annotated corpus of english: The Penn treebank - Marcus, Marcinkiewicz, et al. - 1993
574	Estimation of probabilities from sparse data for the language model component of a speech recognizer - Katz - 1987
433	A simple rule-based part of speech tagger - Brill - 1992
412	Probabilistic part-of-speech tagging using decision trees - Schmid - 1994
325	A Practical Part-of-Speech Tagger - Cutting, Kupiec, et al. - 1991
292	Learning Efficient Classification Procedures and their Application to Chess End Games - Quinlan - 1983
286	Interpolated estimation of Markov source parameters from sparse data - Jelinek, Mercer - 1980
212	Tagging English text with probabilistic model - Merialdo - 1994
119	A comparison of the enhanced Good-Turing and deleted estimation methods for estimating probabilities of English bigrams. Computer Speech and Language - Church, Gale - 1991
1	DMOR: Benutzeranleitung. Technical report, Institut fur maschinelle Sprachverarbeitung, Universitat Stuttgart - Schiller - 1995