Modeling latent-dynamic in shallow parsing: A latent conditional model with improved inference

Coling 2008 - 22nd International Conference on Computational Linguistics, Proceedings of the Conference

Volumn 1, Issue , 2008, Pages 841-848

  Sun, Xu ^a   Morency, Louis Philippe ^b   Okanohara, Daisuke ^a   Tsujii, Jun'ichi ^a,c  

^a UNIVERSITY OF TOKYO   (Japan)

^b USC Institute for Creative Technologies ^*  (United States)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONDITIONAL MODELS; HIDDEN STATE; INFERENCE ALGORITHM; INTERMEDIATE STRUCTURES; PART OF SPEECH; SEQUENCE LABELING; SHALLOW PARSING;

ALGORITHMS; COMPUTATIONAL LINGUISTICS; DYNAMICS;

INFERENCE ENGINES;

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

References (30)

1. Abney, S. 1991. Parsing by chunks. In R. Berwick, S. Abney, and C. Tenny, editors, Principle-based Parsing. Kluwer Academic Publishers.
2. Abney, S.; Schapire, R. E. and Singer, Y. 1999. Boosting applied to tagging and PP attachment. In Proc. EMNLP/VLC-99.
3. Andrew, G. and Gao, J. 2007. Scalable training of Ll-regularized log-linear models. In Proc. ICML-07.
4. Bikel, D. M.; Schwartz, R. L. and Weischedel, R. M. 1999. An algorithm that learns what's in a name. Machine Learning, 34: 211-231.
5. Chen, S. F. and Rosenfeld, R. 1999. A Gaussian prior for smoothing maximum entropy models. Technical Report CMU-CS-99-108, CMU.
6. Collins, M. 2002. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proc. EMNLP-02.
7. Freitag, D. and McCallum, A. 2000. Information extraction with HMM structures learned by stochastic optimization. In Proc. AAAI-00.
8. Gillick, L. and Cox, S. 1989. Some statistical issues in the comparison of speech recognition algorithms. In International Conference on Acoustics Speech and Signal Processing, v1, pages 532-535.
9. Hart, P.E.; Nilsson, N.J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost path. IEEE Trans. On System Science and Cybernetics, SSC-4(2): 100-107.
10. Kudo, T. and Matsumoto, Y. 2001. Chunking with support vector machines. In Proc. NAACL-01.
11. Kupiec, J. 1992. Robust part-of-speech tagging using a hidden Markov model. Computer Speech and Language. IEEE Transactions on SMC-B
12. Lafferty, J.; McCallum, A. and Pereira, F 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. ICML-01, pages 282-289.
13. Malouf, R. 2002. A comparison of algorithms for maximum entropy parameter estimation. In Proc. CoNLL-02.
14. Matsuzaki, T.; Miyao Y and Tsujii, J. 2005. Probabilistic CFG with Latent Annotations. In Proc. ACL-05.
15. McDonald, R.; Crammer, K. and Pereira, F 2005. Flexible Text Segmentation with Structured Multilabel Classification. In Proc. HLT/EMNLP-05, pages 987-994.
16. Morency, L.P; Quattoni, A. and Darrell, T. 2007. Latent-Dynamic Discriminative Models for Continuous Gesture Recognition. In Proc. CVPR-07, pages 1-8.
17. Nocedal, J. and Wright, S.J. 1999. Numerical Optimization. Springer.
18. Petrov, S.; Pauls, A.; and Klein, D. 2007. Discriminative log-linear grammars with latent variables. In Proc. NIPS-07.
19. Punyakanok, V. and Roth, D. 2001. The use of classifiers in sequential inference. In Proc. NIPS-01, pages 995-1001. MIT Press.
20. Ramshaw, L. A. and Marcus, M. P. 1995. Text chunking using transformation-based learning. In Proc. Third Workshop on Very Large Corpora. In Proc. ACL-95.
21. Ratnaparkhi, A. 1996. A maximum entropy model for part-of-speech tagging. In Proc. EMNLP-96.
22. Sang, E.F.T.K. 2000. Noun Phrase Representation by System Combination. In Proc. ANLP/NAACL-00.
23. Sang, E.F.T.K and Buchholz, S. 2000. Introduction to the CoNLL-2000 shared task: Chunking. In Proc. CoNLL-00, pages 127-132.
24. Sha, F and Pereira, F 2003. Shallow Parsing with Conditional Random Fields. In Proc. HLT/NAACL-03.
25. Shewchuk, J. R. 1994. An introduction to the conjugate gradient method without the agonizing pain. http://www.2.cs.cmu.edu/jrs/jrspapers.html/#cg.
26. Sutton, C.; Rohanimanesh, K. and McCallum, A. 2004. Dynamic conditional random fields: Factorized probabilistic models for labeling and segmenting sequence data. In Proc. ICML-04.
27. Viterbi, A.J. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory. 13(2):260-269.
28. Vishwanathan, S.; Schraudolph, N. N.; Schmidt, M.W. and Murphy, K. 2006. Accelerated training of conditional random fields with stochastic meta-descent. In Proc. ICML-06.
29. Wallach, H. 2002. Efficient training of conditional random fields. In Proc. 6th Annual CLUK Research Colloquium.
30. Zhang, T.; Damerau, F and Johnson, D. 2002. Text chunking based on a generalization of winnow. Journal of Machine Learning Research, 2:615-637.