A Maximum Entropy Model for Part-Of-Speech Tagging
暂无分享,去创建一个
[1] J. Darroch,et al. Generalized Iterative Scaling for Log-Linear Models , 1972 .
[2] Robert L. Mercer,et al. Class-Based n-gram Models of Natural Language , 1992, CL.
[3] Beatrice Santorini,et al. Building a Large Annotated Corpus of English: The Penn Treebank , 1993, CL.
[4] Ronald Rosenfeld,et al. Adaptive Language Modeling Using the Maximum Entropy Principle , 1993, HLT.
[5] Richard M. Schwartz,et al. Coping with Ambiguity and Unknown Words through Probabilistic Models , 1993, CL.
[6] Adwait Ratnaparkhi,et al. A Maximum Entropy Model for Prepositional Phrase Attachment , 1994, HLT.
[7] Bernard Mérialdo,et al. Tagging English Text with a Probabilistic Model , 1994, CL.
[8] John D. Lafferty,et al. Decision Tree Parsing using a Hidden Derivation Model , 1994, HLT.
[9] Eric Brill,et al. Some Advances in Transformation-Based Part of Speech Tagging , 1994, AAAI.
[10] David M. Magerman. Statistical Decision-Tree Models for Parsing , 1995, ACL.
[11] Adam L. Berger,et al. A Maximum Entropy Approach to Natural Language Processing , 1996, CL.
[12] John D. Lafferty,et al. Inducing Features of Random Fields , 1995, IEEE Trans. Pattern Anal. Mach. Intell..