Porting statistical parsers with data-defined kernels

CoNLL 2006 - Proceedings of the 10th Conference on Computational Natural Language Learning

Volumn , Issue , 2006, Pages 6-13

  Titov, Ivan ^a   Henderson, James ^b  

^a UNIVERSITY OF GENEVA   (Switzerland)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LARGE MARGIN CLASSIFIERS; NEURAL-NETWORKS; PERFORMANCE; PROBABILISTIC MODELS; STATISTICAL PARSER; SVM CLASSIFIERS; TARGET DOMAIN;

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

References (14)

1. Michael Collins and Nigel Duffy. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures and the voted perceptron. In Proc. ACL 2002 , pages 263–270, Philadelphia, PA.
2. Michael Collins. 1997. Three generative, lexicalized models for statistical parsing. In Proc. ACL/EACL 1997 , pages 16–23, Somerset, New Jersey.
3. Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA.
4. Daniel Gildea. 2001. Corpus variation and parser performance. In Proc. EMNLP 2001 , Pittsburgh, PA.
5. James Henderson and Ivan Titov. 2005. Data-defined kernels for parse reranking derived from probabilistic models. In Proc. ACL 2005 , Ann Arbor, MI.
6. James Henderson. 2003. Inducing history representations for broad coverage statistical parsing. In Proc. NAACL/HLT 2003 , pages 103–110, Edmonton, Canada.
7. Terry Koo and Michael Collins. 2005. Hidden-variable models for discriminative reranking. In Proc. EMNLP 2005 , Vancouver, B.C., Canada.
8. Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313–330.
9. Takuya Matsuzaki, Yusuke Miyao, and Jun’ichi Tsujii. 2005. Probabilistic CFG with latent annotations. In Proc. ACL 2005 , Ann Arbor, MI.
10. Adwait Ratnaparkhi. 1999. Learning to parse natural language with maximum entropy models. Machine Learning, 34:151–175.
11. Brian Roark and Michiel Bacchiani. 2003. Supervised and unsuperised PCFG adaptation to novel domains. In Proc. HLT/ACL 2003 , Edmionton, Canada.
12. Libin Shen and Aravind K. Joshi. 2003. An SVM based voting algorithm with application to parse reranking. In Proc. 7th Conf. on Computational Natural Language Learning, pages 9–16, Edmonton, Canada.
13. Ioannis Tsochantaridis, Thomas Hofmann, Thorsten Joachims, and Yasemin Altun. 2004. Support vector machine learning for interdependent and structured output spaces. In Proc. 21st Int. Conf. on Machine Learning, pages 823–830, Banff, Alberta, Canada.
14. Alexander Yeh. 2000. More accurate tests for the statistical significance of the result differences. In Proc. 17th Int. Conf. on Computational Linguistics, pages 947–953, Saarbruken, Germany.