Abstract
This paper investigates two elements of Maximum Entropy tagging: the use of a correction feature in the Generalised Iterative Scaling (Gis) estimation algorithm, and techniques for model smoothing. We show analytically and empirically that the correction feature, assumed to be required for the correctness of GIS, is unnecessary. We also explore the use of a Gaussian prior and a simple cutoff for smoothing. The experiments are performed with two tagsets: the standard Penn Treebank POS tagset and the larger set of lexical types from Combinatory Categorial Grammar.
Cite
CITATION STYLE
Curran, J. R., & Clark, S. (2003). Investigating GIS and smoothing for maximum entropy taggers. In 10th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2003 (pp. 91–98). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1067807.1067821
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.