论文信息 - Probabilistic part-of-speech tagging using decision trees

Probabilistic part-of-speech tagging using decision trees

In this paper, a new probabilistic tagging method is presented which avoids problems that Markov Model based taggers face, when they have to estimate transition probabilities from sparse data. In this tagging method, transition probabilities are estimated using a decision tree. Based on this method, a part-of-speech tagger (called TreeTagger) has been implemented which achieves 96.36 % accuracy on Penn-Treebank data which is better than that of a trigram tagger (96.06 %) on the same data.

Helmut Schmidt | Helmut Schmidt

[1] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[2] J. Ross Quinlan,et al. Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .

[3] Steven J. DeRose,et al. Grammatical Category Disambiguation by Statistical Optimization , 1988, CL.

[4] Kenneth Ward Church. A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text , 1988, ANLP.

[5] Kiyohiro Shikano,et al. Neural Network Approach to Word Category Prediction for English Texts , 1990, COLING.

[6] Penelope Sibun,et al. A Practical Part-of-Speech Tagger , 1992, ANLP.

[7] Eric Brill,et al. A corpus-based approach to language learning , 1993 .

[8] Vito Pirrelli,et al. Context-sensitivity and linguistic structure in analogy-based parallel networks , 1994 .

[9] Helmut Schmid,et al. Part-of-Speech Tagging With Neural Networks , 1994, COLING.