Shallow parsing with conditional random fields

Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, HLT-NAACL 2003

Volumn , Issue , 2003, Pages

  Sha, Fei ^a   Pereira, Fernando ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE SEGMENTATION; MAXIMUM ENTROPY METHODS; NATURAL LANGUAGE PROCESSING SYSTEMS;

BASE NOUN PHRASE; GENERATIVE MODEL; LANGUAGE PROCESSING; OPTIMIZATION ALGORITHMS; PERFORMANCE; SEQUENCE LABELING; SHALLOW PARSING; SINGLE MODELS; STANDARD EVALUATIONS; TRAINING METHODS;

RANDOM PROCESSES;

EID: 85043116988     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. S. Abney. Parsing by chunks. In R. Berwick, S. Abney, and C. Tenny, editors, Principle-based Parsing. Kluwer Academic Publishers, 1991.
2. S. Abney, R. E. Schapire, and Y. Singer. Boosting applied to tagging and PP attachment. In Proc. EMNLP-VLC, New Brunswick, New Jersey, 1999. ACL.
3. A. L. Berger, S. A. Della Pietra, and V. J. Della Pietra. A maximum entropy approach to natural language processing. Computational Linguistics, 22(1), 1996.
4. D. M. Bikel, R. L. Schwartz, and R. M. Weischedel. An algorithm that learns what’s in a name. Machine Learning, 34: 211–231, 1999.
5. L. Bottou. Une Approche théorique de l’Apprentissage Connexionniste: Applications à la Reconnaissance de la Parole. PhD thesis, Université de Paris XI, 1991.
6. E. Brill. Transformation-based error-driven learning and natural language processing: a case study in part of speech tagging. Computational Linguistics, 21:543–565, 1995.
7. S. F. Chen and R. Rosenfeld. A Gaussian prior for smoothing maximum entropy models. Technical Report CMU-CS-99-108, Carnegie Mellon University, 1999.
8. M. Collins. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proc. EMNLP 2002. ACL, 2002.
9. M. Collins and N. Duffy. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In Proc. 40th ACL, 2002.
10. J. N. Darroch and D. Ratcliff. Generalized iterative scaling for log-linear models. The Annals of Mathematical Statistics, 43 (5):1470–1480, 1972.
11. S. Della Pietra, V. Della Pietra, and J. Lafferty. Inducing features of random fields. IEEE PAMI, 19(4):380–393, 1997.
12. B. Efron and R. J. Tibshirani. An Introduction to the Bootstrap. Chapman & Hall/CRC, 1993.
13. D. Freitag and A. McCallum. Information extraction with HMM structures learned by stochastic optimization. In Proc. AAAI 2000, 2000.
14. S. Geman and M. Johnson. Dynamic programming for parsing and estimation of stochastic unification-based grammars. In Proc. 40th ACL, 2002.
15. L. Gillick and S. Cox. Some statistical issues in the compairson of speech recognition algorithms. In International Conference on Acoustics Speech and Signal Processing, volume 1, pages 532–535, 1989.
16. J. Hammersley and P. Clifford. Markov fields on finite graphs and lattices. Unpublished manuscript, 1971.
17. T. Kudo and Y. Matsumoto. Chunking with support vector machines. In Proc. NAACL 2001. ACL, 2001.
18. J. Kupiec. Robust part-of-speech tagging using a hidden Markov model. Computer Speech and Language, 6:225–242, 1992.
19. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. ICML-01, pages 282–289, 2001.
20. R. Malouf. A comparison of algorithms for maximum entropy parameter estimation. In Proc. CoNLL-2002, 2002.
21. A. McCallum, D. Freitag, and F. Pereira. Maximum entropy Markov models for information extraction and segmentation. In Proc. ICML 2000, pages 591–598, Stanford, California, 2000.
22. T. P. Minka. Algorithms for maximum-likelihood logistic regression. Technical Report 758, CMU Statistics Department, 2001.
23. J. Nocedal and S. J. Wright. Numerical Optimization. Springer, 1999.
24. V. Punyakanok and D. Roth. The use of classifiers in sequential inference. In NIPS 13, pages 995–1001. MIT Press, 2001.
25. L. A. Ramshaw and M. P. Marcus. Text chunking using transformation-based learning. In Proc. Third Workshop on Very Large Corpora. ACL, 1995.
26. A. Ratnaparkhi. A maximum entropy model for part-of-speech tagging. In Proc. EMNLP, New Brunswick, New Jersey, 1996. ACL.
27. A. Ratnaparkhi. A linear observed time statistical parser based on maximum entropy models. In C. Cardie and R. Weischedel, editors, EMNLP-2. ACL, 1997.
28. S. Riezler, T. H. King, R. M. Kaplan, R. Crouch, J. T. Maxwell III, and M. Johnson. Parsing the Wall Street Journal using a lexical-functional grammar and discriminative estimation techniques. In Proc. 40th ACL, 2002.
29. E. F. T. K. Sang. Memory-based shallow parsing. Journal of Machine Learning Research, 2:559–594, 2002.
30. J. R. Shewchuk. An introduction to the conjugate gradient method without the agonizing pain, 1994. URL http://www-2.cs.cmu.edu/~jrs/jrspapers.html#cg.
31. B. Taskar, P. Abbeel, and D. Koller. Discriminative probabilistic models for relational data. In Eighteenth Conference on Uncertainty in Artificial Intelligence, 2002.
32. E. F. Tjong Kim Sang and S. Buchholz. Introduction to the CoNLL-2000 shared task: Chunking. In Proc. CoNLL-2000, pages 127–132, 2000.
33. H. Wallach. Efficient training of conditional random fields. In Proc. 6th Annual CLUK Research Colloquium, 2002.
34. A. Yeh. More accurate tests for the statistical significance of result differences. In COLING-2000, pages 947–953, Saarbruecken, Germany, 2000.
35. T. Zhang, F. Damerau, and D. Johnson. Text chunking based on a generalization of winnow. Journal of Machine Learning Research, 2:615–637, 2002.