Structural correspondence learning for dependency parsing

EMNLP-CoNLL 2007 - Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning

Volumn , Issue , 2007, Pages 1166-1169

  Shimizu, Nobuyuki ^a   Nakagawa, Hiroshi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY LINEAR CLASSIFIER; COLLINS; DEPENDENCY PARSING; DIFFERENT DOMAINS; MC-DONALD; NON-PROJECTIVE DEPENDENCY PARSING; ON-LINE FASHION; PERCEPTRON; UNLABELED DATA;

COMPUTATIONAL LINGUISTICS; SINGULAR VALUE DECOMPOSITION;

NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (14)

1. J. Blitzer, R. McDonald, and F. Pereira. 2006. Domain adaptation with structural correspondence learning. In Proc. of Empirical Methods in Natural Language Processing (EMNLP).
2. R. Bunescu and R. Mooney. 2005. A shortest path dependency kernel for relation extraction. In Proc. of the Joint Conf. on Human Language Technology and Empirical Methods in Natural Language Processing (HLT/EMNLP).
3. Y.J. Chu and T.H. Liu. 1965. On the shortest arborescence of a directed graph. In Science Sinica, page 14:13961400.
4. M. Collins and B. Roark. 2004. Incremental parsing with the perceptron algorithm. In Proc. of the 42rd Annual Meeting of the ACL.
5. M. Collins. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Proc. of Empirical Methods in Natural Language Processing (EMNLP).
6. K. Crammer and Y. Singer. 2003. Ultraconservative online algorithms for multiclass problems. In JMLR.
7. Y. Ding and M. Palmer. 2005. Machine translation using probabilistic synchronous dependency insertion grammars. In Proc. of the 43rd AnnualMeeting of the ACL.
8. J. Edmonds. 1967. Optimum branchings. In Journal of Research of the National Bureau of Standards, page 71B:233240.
9. R. Johansson and P. Nugues. 2007. Extended constituent-to-dependency conversion for English. In Proc. of the 16th Nordic Conference on Computational Linguistics (NODALIDA).
10. S. Kulick, A. Bies, M. Liberman, M. Mandel, R. Mc- Donald, M. Palmer, A. Schein, and L. Ungar. 2004. Integrated annotation for biomedical information extraction. In Proc. of the Human Language Technology Conference and the Annual Meeting of the North American Chapter of the Association for Computational Linguistics (HLT/NAACL).
11. G. Leonidas. 2003. Arborescence optimization problems solvable by edmonds algorithm. In Theoretical Computer Science, page 301:427-437.
12. M. Marcus, B. Santorini, and M. Marcinkiewicz. 1993. Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 19(2):313-330.
13. R. McDonald, F. Pereira, K. Ribarov, and J. Hajič. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proc. of the Joint Conf. on Human Language Technology and Empirical Methods in Natural Language Processing (HLT/EMNLP).
14. J. Nivre, J. Hall, S. K̈ubler, R. McDonald, J. Nilsson, S. Riedel, and D. Yuret. 2007. The CoNLL 2007 shared task on dependency parsing. In Proc. of the Joint Conf. on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL).