---
title: "A Practical Part-of-Speech Tagger — Cutting 1992"
description: "The paper addresses a practical engineering question: how to build a part-of-speech tagger that holds up on messy real-world corpora, runs fast, and can…"
authors: ["Doug Cutting", "Julian Kupiec", "Jan Pedersen", "Penelope Sibun"]
year: 1992
venue: "Third Conference on Applied Natural Language Processing"
source: "https://aclanthology.org/A92-1018/"
doi: "10.3115/974499.974523"
licence: "CC BY-NC-SA 3.0 (ACL Anthology, before 2016)"
licence_url: "https://creativecommons.org/licenses/by-nc-sa/3.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/cutting-1992-practical-part-speech-tagger/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/cutting-1992-practical-part-speech-tagger/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [1992](https://md.research.elamur.ai/free/en/papers/1992/) / A Practical Part-of-Speech Tagger

# A Practical Part-of-Speech Tagger

**Authors:** Doug Cutting, Julian Kupiec, Jan Pedersen, Penelope Sibun · **Year:** 1992 · **Venue:** Third Conference on Applied Natural Language Processing · **Licence:** [CC BY-NC-SA 3.0 (ACL Anthology, before 2016)](https://creativecommons.org/licenses/by-nc-sa/3.0/)

**Links:** [Publisher's page](https://aclanthology.org/A92-1018/) · [PDF](https://aclanthology.org/A92-1018.pdf) · [DOI 10.3115/974499.974523](https://doi.org/10.3115/974499.974523) · [OpenAlex](https://openalex.org/W2046224275)

**Citations:** 618 citations (openalex-snapshot · 2026-10-14) · [131](#cited-by) in our library, of the 140884 papers whose bibliographies we read

## Summary
The paper addresses a practical engineering question: how to build a part-of-speech tagger that holds up on messy real-world corpora, runs fast, and can be moved to a new tagset, domain or language cheaply. The Xerox PARC authors implement a first-order hidden Markov model trained with Baum-Welch on unlabeled text. The only inputs are a lexicon and raw text, so no hand-tagged corpus is needed. Words are grouped into ambiguity classes, meaning the set of tags each word allows. Only frequent words keep their own parameters. Unknown words are handled by suffix-based guessing, with a default open-class fallback. Implementation work covers numerical scaling, log-space Viterbi decoding and trie-based lookup, which keep tagging linear in text length. Accuracy is above 96%. The tagger then feeds three shallow-analysis systems: phrase recognition, noun sense disambiguation and grammatical function labeling. Its importance lies in showing that a competitive tagger can come from cheap resources, which matters most for languages and domains without treebanks.

## Key points
- The model is a first-order HMM, estimated with the forward-backward (Baum-Welch) algorithm and decoded with Viterbi. Training needs only a lexicon plus untagged text, and accuracy exceeds 96%.
- Ambiguity classes shrink the roughly 50,000-word Brown corpus vocabulary to about 400 classes. Reasonable results came from training on as few as 3,000 sentences.
- The lexicon works in three stages: a hand-built lexicon for frequent words, then suffix-based class prediction for unknown words, then a default class containing all open-class tags. Both dictionaries and suffix tables are stored as tries.
- Rescaling the forward and backward probabilities and running Viterbi on log probabilities prevent numerical underflow. Unseen tag sequences get small non-zero probabilities, so any input can still be tagged.
- Downstream results:
  - Hearst's CatchWord noun homograph disambiguator reached about 90% on nouns with clearly distinct senses.
  - The Sopa grammatical function assigner (Subject/Object/Predicative) reached about 80%.

## Interesting ideas
- **Pooling rare words by ambiguity class.** Rare words share statistics with other words that have the same tag set, so far less data is needed. New lexicon entries usually fit an existing class and need no retraining. This could help any low-resource sequence labeling task, for example Ukrainian morphology with rich tag sets.
- **Separating the tagset from the training data.** Since training uses raw text, switching to a different or specialized tagset only requires changing the lexicon. This makes experimenting with tagset designs cheap.
- **A layered fallback for unknown words.** Lookup goes from an exact dictionary, to suffix heuristics, to a broad default class. The result degrades gracefully instead of failing, which suits noisy or out-of-domain corpora.
- **Favoring precision in downstream chunking.** The phrase recognizer accepts only simple, contiguous tag patterns and takes the longest match. It may miss parts of some phrases but rarely produces false positives, so later stages such as argument labeling can trust what it outputs.
- **Explicit practical requirements as design criteria.** Robustness, efficiency, accuracy, tunability and reusability are stated up front and guide every design choice. This is a useful checklist when building NLP components meant for production pipelines rather than benchmarks.

*Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.*

Fields: [Natural language processing](https://md.research.elamur.ai/free/en/shelves/nlp/)

Topics: [Part-of-speech tagging](https://md.research.elamur.ai/free/en/topics/part-of-speech-tagging/)

## Cited by

Cited by

131 papers of our library cite it (of the 140884 whose bibliographies we read); 13 of them have a page here, 118 not yet.

- [Adaptive Sentence Boundary Disambiguation](https://md.research.elamur.ai/free/en/papers/aclbulk-1994-palmer-adaptive-sentence-boundary-disambiguation/)
- [Classifying the Semantic Relations in Noun Compounds via a Domain-Specific Lexical Hierarchy](https://md.research.elamur.ai/free/en/papers/aclbulk-2001-rosario-classifying-semantic-relations-noun-compounds/)
- [TnT – A Statistical Part-of-Speech Tagger](https://md.research.elamur.ai/free/en/papers/brants-2000-tnt-statistical-part-speech-tagger/)
- [A Simple Rule-Based Part of Speech Tagger](https://md.research.elamur.ai/free/en/papers/brill-1992-simple-rule-based-part-speech/)
- [Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging](https://md.research.elamur.ai/free/en/papers/brill-1995-transformation-based-error-driven-learning/)
- [Learning Morpho-Lexical Probabilities from an Untagged Corpus with an Application to Hebrew](https://md.research.elamur.ai/free/en/papers/cl-1995-levinger-learning-morpho-lexical-probabilities-untagged/)
- [Automatic induction of shallow-transfer rules for open-source machine translation](https://md.research.elamur.ai/free/en/papers/martinez-2007-automatic-induction-shallow-transfer-rules/)
- [Tagging English Text with a Probabilistic Model](https://md.research.elamur.ai/free/en/papers/merialdo-1994-tagging-english-text-probabilistic-model/)
- [Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach](https://md.research.elamur.ai/free/en/papers/ng-1996-integrating-multiple-knowledge-sources-disambiguate/)
- [A Maximum Entropy Approach to Identifying Sentence Boundaries](https://md.research.elamur.ai/free/en/papers/reynar-1997-maximum-entropy-approach-identifying-sentence/)
- [Opentrad Apertium Open-Source Machine Translation System: an Opportunity for Business and Research](https://md.research.elamur.ai/free/en/papers/sanchez-2006-opentrad-apertium-open-source-machine/)
- [Inferring Shallow-Transfer Machine Translation Rules from Small Parallel Corpora](https://md.research.elamur.ai/free/en/papers/sanchez-2014-martinez-inferring-shallow-transfer-machine-translation/)
- [An Annotation Scheme for Free Word Order Languages](https://md.research.elamur.ai/free/en/papers/skut-1997-annotation-scheme-free-word-order/)

## Cite

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@inproceedings{cutting1992practical,
  title = {{A Practical Part-of-Speech Tagger}},
  author = {Cutting, Doug and Kupiec, Julian and Pedersen, Jan and Sibun, Penelope},
  booktitle = {Third Conference on Applied Natural Language Processing},
  year = {1992},
  doi = {10.3115/974499.974523},
  url = {https://doi.org/10.3115/974499.974523}
}
```

- [next → A Simple Rule-Based Part of Speech Tagger](https://md.research.elamur.ai/free/en/papers/brill-1992-simple-rule-based-part-speech/)
- [↑ back to papers of 1992](https://md.research.elamur.ai/free/en/papers/1992/)

## References

26 references, 1 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986. [find](https://scholar.google.com/scholar?q=A%2E+V%2E+Aho%2C+R%2E+Sethi%2C+and+J%2E+D%2E+Ullman%2E+Compilers%3A+Principles%2C+Techniques+and+Tools%2E+Addison%2DWesley%2C+1986%2E)
2. L. E. Baum. An inequality and associated maximization technique in statistical estimation for probabilistic functions of a Markov process. Inequalities, 3:1-8, 1972. [find](https://scholar.google.com/scholar?q=L%2E+E%2E+Baum%2E+An+inequality+and+associated+maximization+technique+in+statistical+estimation+for+probabilistic+functions+of+a+Markov+process%2E+Inequalities%2C+3%3A1%2D8%2C+1972%2E)
3. K. W. Church. A stochastic parts program and noun phrase parser for unrestricted text. In Proceedings of the Second Conference on Applied Natural Language Processing (ACL), pages 136-143, 1988. [find](https://scholar.google.com/scholar?q=K%2E+W%2E+Church%2E+A+stochastic+parts+program+and+noun+phrase+parser+for+unrestricted+text%2E+In+Proceedings+of+the+Second+Conference+on+Applied+Natural+Language+Processing+%28ACL%29%2C+pages+136%2D143%2C+1988%2E) [our card](https://md.research.elamur.ai/free/en/papers/church-1988-stochastic-parts-program-noun-phrase/)
4. D.R. Cutting, J. Pedersen, and P.-K. Halvorsen. An object-oriented architecture for text retrieval. In Conference Proceedings of R[AO'91, Intelligent Text and Image Handling, Barcelona, Spain, pages 285-298, April 1991. [find](https://scholar.google.com/scholar?q=D%2ER%2E+Cutting%2C+J%2E+Pedersen%2C+and+P%2E%2DK%2E+Halvorsen%2E+An+object%2Doriented+architecture+for+text+retrieval%2E+In+Conference+Proceedings+of+R%5BAO%2791%2C+Intelligent+Text+and+Image+Handling%2C+Barcelona%2C+Spain%2C+pages+2)
5. S. DeRose. Grammatical category disambiguation by statistical optimization. Computational Linguistics, 14:31-39, 1988. [find](https://scholar.google.com/scholar?q=S%2E+DeRose%2E+Grammatical+category+disambiguation+by+statistical+optimization%2E+Computational+Linguistics%2C+14%3A31%2D39%2C+1988%2E)
6. A. M. Derouault and B. Merialdo. Natural language modeling for phoneme-to-text transcription. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-8:742-749, 1986. [find](https://scholar.google.com/scholar?q=A%2E+M%2E+Derouault+and+B%2E+Merialdo%2E+Natural+language+modeling+for+phoneme%2Dto%2Dtext+transcription%2E+IEEE+Transactions+on+Pattern+Analysis+and+Machine+Intelligence%2C+PAMI%2D8%3A742%2D749%2C+1986%2E)
7. W. N. Francis and F. Ku~era. Frequency Analysis of English Usage. Houghton Mifflin, 1982. [find](https://scholar.google.com/scholar?q=W%2E+N%2E+Francis+and+F%2E+Ku%7Eera%2E+Frequency+Analysis+of+English+Usage%2E+Houghton+Mifflin%2C+1982%2E)
8. R. Garside, G. Leech, and G. Sampson. The Computational Analysis of English. Long.man, 1987. [find](https://scholar.google.com/scholar?q=R%2E+Garside%2C+G%2E+Leech%2C+and+G%2E+Sampson%2E+The+Computational+Analysis+of+English%2E+Long%2Eman%2C+1987%2E)
9. B. B. Greene and G. M. Rubin. Automatic grammatical tagging of English. Technical report, Department of Linguistics, Brown University, Providence, Rhode Island, 1971. [find](https://scholar.google.com/scholar?q=B%2E+B%2E+Greene+and+G%2E+M%2E+Rubin%2E+Automatic+grammatical+tagging+of+English%2E+Technical+report%2C+Department+of+Linguistics%2C+Brown+University%2C+Providence%2C+Rhode+Island%2C+1971%2E)
10. M. A. Hearst. Noun homograph disambiguation using local context in large text corpora. In The Proceedings of the 7th New OED Conference on Using Corpora, pages 1-22, Oxford, 1991. [find](https://scholar.google.com/scholar?q=M%2E+A%2E+Hearst%2E+Noun+homograph+disambiguation+using+local+context+in+large+text+corpora%2E+In+The+Proceedings+of+the+7th+New+OED+Conference+on+Using+Corpora%2C+pages+1%2D22%2C+Oxford%2C+1991%2E)
11. F. Jelinek and R. L. Mercer. Interpolated estimation of markov source parameters from sparse data. In Proceedings of the Workshop Pattern Recognition in Practice, pages 381-397, Amsterdam, 1980. North-Holland. [find](https://scholar.google.com/scholar?q=F%2E+Jelinek+and+R%2E+L%2E+Mercer%2E+Interpolated+estimation+of+markov+source+parameters+from+sparse+data%2E+In+Proceedings+of+the+Workshop+Pattern+Recognition+in+Practice%2C+pages+381%2D397%2C+Amsterdam%2C+1980%2E+North)
12. F. Jelinek. Markov source modeling of text generation. In J. K. Skwirzinski, editor, Impact of Processing Techniques on Communication. Nijhoff, Dordrecht, 1985. [find](https://scholar.google.com/scholar?q=F%2E+Jelinek%2E+Markov+source+modeling+of+text+generation%2E+In+J%2E+K%2E+Skwirzinski%2C+editor%2C+Impact+of+Processing+Techniques+on+Communication%2E+Nijhoff%2C+Dordrecht%2C+1985%2E)
13. D. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973. [find](https://scholar.google.com/scholar?q=D%2E+Knuth%2E+The+Art+of+Computer+Programming%2C+volume+3%3A+Sorting+and+Searching%2E+Addison%2DWesley%2C+1973%2E)
14. K. Koskenniemi. Finte-state parsing and disambiguation. In H. Karlgren, editor, COLING-90, pages 229-232, Helsinki University, 1990. [find](https://scholar.google.com/scholar?q=K%2E+Koskenniemi%2E+Finte%2Dstate+parsing+and+disambiguation%2E+In+H%2E+Karlgren%2C+editor%2C+COLING%2D90%2C+pages+229%2D232%2C+Helsinki+University%2C+1990%2E)
15. J. M. Kupiec. Augmenting a hidden Markov model for phrase-dependent word tagging. In Proceedings of the DARPA Speech and Natural Language Workshop, pages 92-98, Cape Cod, MA, 1989. Morgan Kaufmann. [find](https://scholar.google.com/scholar?q=J%2E+M%2E+Kupiec%2E+Augmenting+a+hidden+Markov+model+for+phrase%2Ddependent+word+tagging%2E+In+Proceedings+of+the+DARPA+Speech+and+Natural+Language+Workshop%2C+pages+92%2D98%2C+Cape+Cod%2C+MA%2C+1989%2E+Morgan+Kaufmann%2E)
16. J. M. Kupiec. Probabilistic models of short and long distance word dependencies in running text. In Proceedings of the 1989 DARPA Speech and Natural Language Workshop, pages 290-295, Philadelphia, 1989. Morgan Kaufmann. [find](https://scholar.google.com/scholar?q=J%2E+M%2E+Kupiec%2E+Probabilistic+models+of+short+and+long+distance+word+dependencies+in+running+text%2E+In+Proceedings+of+the+1989+DARPA+Speech+and+Natural+Language+Workshop%2C+pages+290%2D295%2C+Philadelphia%2C+198)
17. J. M. Kupiec. Robust part-of-speech tagging using a hidden markov model, submitted to Computer Speech and Language, 1992. [find](https://scholar.google.com/scholar?q=J%2E+M%2E+Kupiec%2E+Robust+part%2Dof%2Dspeech+tagging+using+a+hidden+markov+model%2C+submitted+to+Computer+Speech+and+Language%2C+1992%2E)
18. M. E. Lesk. LEX - - a lexical analyzer generator. Computing Science Technical Report 39, AT&T Bell Laboratories, Murray Hill, New Jersey, 1975. [find](https://scholar.google.com/scholar?q=M%2E+E%2E+Lesk%2E+LEX+%2D+%2D+a+lexical+analyzer+generator%2E+Computing+Science+Technical+Report+39%2C+AT%26T+Bell+Laboratories%2C+Murray+Hill%2C+New+Jersey%2C+1975%2E)
19. S. E. Levinson, L. R. Rabiner, and M. M. Sondhi. An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition. Bell System Technical • Journal, 62:1035-1074, 1983. [find](https://scholar.google.com/scholar?q=S%2E+E%2E+Levinson%2C+L%2E+R%2E+Rabiner%2C+and+M%2E+M%2E+Sondhi%2E+An+introduction+to+the+application+of+the+theory+of+probabilistic+functions+of+a+Markov+process+to+automatic+speech+recognition%2E+Bell+System+Technical+)
20. B. Merialdo. Tagging text with a probablistic model. In Proceedings of ICASSP-91, pages 809-812, Toronto, Canada, 1991. [find](https://scholar.google.com/scholar?q=B%2E+Merialdo%2E+Tagging+text+with+a+probablistic+model%2E+In+Proceedings+of+ICASSP%2D91%2C+pages+809%2D812%2C+Toronto%2C+Canada%2C+1991%2E)
21. M. W. Meteer, R. Schwartz, and R. Weischedel. POST: Using probabilities in language processing. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 960-965, 1991. [find](https://scholar.google.com/scholar?q=M%2E+W%2E+Meteer%2C+R%2E+Schwartz%2C+and+R%2E+Weischedel%2E+POST%3A+Using+probabilities+in+language+processing%2E+In+Proceedings+of+the+12th+International+Joint+Conference+on+Artificial+Intelligence%2C+pages+960%2D965%2C+199)
22. IEEE Task P754. A proposed standard for binary floating-point arithmetic. Computer, 14(3):51-62, March 1981. [find](https://scholar.google.com/scholar?q=IEEE+Task+P754%2E+A+proposed+standard+for+binary+floating%2Dpoint+arithmetic%2E+Computer%2C+14%283%29%3A51%2D62%2C+March+1981%2E)
23. L. R. Rabiner and B. H. Juang. An introduction to hidden markov models. IEEE ASSP Magazine, January 1986. [find](https://scholar.google.com/scholar?q=L%2E+R%2E+Rabiner+and+B%2E+H%2E+Juang%2E+An+introduction+to+hidden+markov+models%2E+IEEE+ASSP+Magazine%2C+January+1986%2E)
24. P. Sibun. Grammatical function assignment in unrestricted text. internal report, Xerox Palo Alto Research Center, 1991. [find](https://scholar.google.com/scholar?q=P%2E+Sibun%2E+Grammatical+function+assignment+in+unrestricted+text%2E+internal+report%2C+Xerox+Palo+Alto+Research+Center%2C+1991%2E)
25. G. L. Steele, Jr. Common Lisp, The Language. Digital Press, second edition, 1990. [find](https://scholar.google.com/scholar?q=G%2E+L%2E+Steele%2C+Jr%2E+Common+Lisp%2C+The+Language%2E+Digital+Press%2C+second+edition%2C+1990%2E)
26. A. J. Viterbi. Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. In IEEE Transactions on Information Theory, pages 260-269, April 1967. [find](https://scholar.google.com/scholar?q=A%2E+J%2E+Viterbi%2E+Error+bounds+for+convolutional+codes+and+an+asymptotically+optimal+decoding+algorithm%2E+In+IEEE+Transactions+on+Information+Theory%2C+pages+260%2D269%2C+April+1967%2E)