Spectral learning for non-deterministic dependency parsing

EACL 2012 - 13th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings

Volumn , Issue , 2012, Pages 409-419

  Luque, Franco M ^a   Quattoni, Ariadna ^b   Balle, Borja ^b   Carreras, Xavier ^b  

^a UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; LINGUISTICS;

DEPENDENCY PARSING; HIDDEN STRUCTURES; LOCAL MINIMUMS; RECURSIONS; SPECTRAL LEARNING; SPECTRAL METHODS;

LEARNING ALGORITHMS;

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

References (27)

1. Raphael Bailly. 2011. Quadratic weighted automata: Spectral algorithm and likelihood maximization. JMLR Workshop and Conference Proceedings - ACML.
2. James K. Baker. 1979. Trainable grammars for speech recognition. In D. H. Klatt and J. J. Wolf, editors, Speech Communication Papers for the 97th Meeting of the Acoustical Society of America, pages 547- 550.
3. Borja Balle, Ariadna Quattoni, and Xavier Carreras. 2012. Local loss optimization in operator models: A new insight into spectral learning. Technical Report LSI-12-5-R, Departament de Llenguatges i Sistemes Informàtics (LSI), Universitat Politècnica de Catalunya (UPC).
4. Xavier Carreras. 2007. Experiments with a higherorder projective dependency parser. In Proceedings of the CoNLL Shared Task Session of EMNLP CONLL 2007, pages 957-961, Prague, Czech Republic, June. Association for Computational Linguistics.
5. Stephen Clark and James R. Curran. 2004. Parsing the wsj using ccg and log-linear models. In Proceedings of the 42nd Meeting of the Association for Computational Linguistics (ACL'04), Main Volume, pages 103-110, Barcelona, Spain, July.
6. Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.
7. Arthur P. Dempster, Nan M. Laird, and Donald B. Rubin. 1977. Maximum likelihood from incomplete data via the em algorithm. Journal of the royal statistical society, Series B, 39(1):1-38.
8. Jason Eisner and Giorgio Satta. 1999. Efficient parsing for bilexical context-free grammars and headautomaton grammars. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL), pages 457-464, University of Maryland, June.
9. Jason Eisner and Noah A. Smith. 2010. Favor short dependencies: Parsing with soft and hard constraints on dependency length. In Harry Bunt, Paola Merlo, and Joakim Nivre, editors, Trends in Parsing Technology: Dependency Parsing, Domain Adaptation, and Deep Parsing, chapter 8, pages 121-150. Springer.
10. Jason Eisner. 2000. Bilexical grammars and their cubic-Time parsing algorithms. In Harry Bunt and Anton Nijholt, editors, Advances in Probabilistic and Other Parsing Technologies, pages 29-62. Kluwer Academic Publishers, October.
11. Joshua Goodman. 1996. Parsing algorithms and metrics. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, pages 177-183, Santa Cruz, California, USA, June. Association for Computational Linguistics.
12. Daniel Hsu, Sham M. Kakade, and Tong Zhang. 2009. A spectral algorithm for learning hidden markov models. In COLT 2009 - The 22nd Conference on Learning Theory.
13. Gabriel Infante-Lopez and Maarten de Rijke. 2004. Alternative approaches for generating bodies of grammar rules. In Proceedings of the 42nd Meeting of the Association for Computational Linguistics (ACL'04), Main Volume, pages 454-461, Barcelona, Spain, July.
14. Terry Koo and Michael Collins. 2010. Efficient thirdorder dependency parsers. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, pages 1-11, Uppsala, Sweden, July. Association for Computational Linguistics.
15. Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schütze. 2008. Introduction to Information Retrieval. Cambridge University Press, Cambridge, first edition, July.
16. Mitchell P. Marcus, Beatrice Santorini, and Mary A. Marcinkiewicz. 1994. Building a large annotated corpus of english: The penn treebank. Computational Linguistics, 19.
17. Andre Martins, Noah Smith, and Eric Xing. 2009. Concise integer linear programming formulations for dependency parsing. In Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, pages 342- 350, Suntec, Singapore, August. Association for Computational Linguistics.
18. Takuya Matsuzaki, Yusuke Miyao, and Junichi Tsujii. 2005. Probabilistic CFG with latent annotations. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL'05), pages 75-82, Ann Arbor, Michigan, June. Association for Computational Linguistics.
19. Ryan McDonald and Fernando Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proceedings of the 11th Conference of the European Chapter of the Association for Computational Linguistics, pages 81-88.
20. Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajic. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing, pages 523-530, Vancouver, British Columbia, Canada, October. Association for Computational Linguistics.
21. Gabriele Antonio Musillo and Paola Merlo. 2008. Unlexicalised hidden variable models of split dependency grammars. In Proceedings of ACL-08: HLT, Short Papers, pages 213-216, Columbus, Ohio, June. Association for Computational Linguistics.
22. James D. Park and Adnan Darwiche. 2004. Complexity results and approximation strategies for mapexplanations. Journal of Artificial Intelligence Research, 21:101-133.
23. Mark Paskin. 2001. Cubic-Time parsing and learning algorithms for grammatical bigram models. Technical Report UCB/CSD-01-1148, University of California, Berkeley.
24. Slav Petrov and Dan Klein. 2007. Improved inference for unlexicalized parsing. In Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference, pages 404-411, Rochester, New York, April. Association for Computational Linguistics.
25. Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 433- 440, Sydney, Australia, July. Association for Computational Linguistics.
26. Ivan Titov and James Henderson. 2006. Loss minimization in parse reranking. In Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing, pages 560-567, Sydney, Australia, July. Association for Computational Linguistics.
27. Ivan Titov and James Henderson. 2007. A latent variable model for generative dependency parsing. In Proceedings of the Tenth International Conference on Parsing Technologies, pages 144-155, Prague, Czech Republic, June. Association for Computational Linguistics.