Experiments with spectral learning of latent-variable PCFGs

NAACL HLT 2013 - 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Main Conference

Volumn , Issue , 2013, Pages 148-157

  Cohen, Shay B ^a   Stratos, Karl ^a   Collins, Michael ^a   Foster, Dean P ^b   Ungar, Lyle ^c  

^a Columbia University ^*  (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; NATURAL LANGUAGE PROCESSING SYSTEMS;

EM ALGORITHMS; LATENT VARIABLE; NATURAL LANGUAGE PARSING; ORDERS OF MAGNITUDE; PARAMETERS ESTIMATES; PARAMETERS ESTIMATION; PERFORMANCE; SAMPLE COMPLEXITY; SPECTRAL ALGORITHM; SPECTRAL LEARNING;

PARAMETER ESTIMATION;

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

References (27)

1. A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Telgarsky. 2012. Tensor decompositions for learning latent-variable models. ArXiv:1210. 7559.
2. S. Arora, R. Se, and A. Moitra. 2012. Learning topic models-going beyond SVD. In Proceedings of FOCS.
3. R. Bailly, A. Habrar, and F. Denis. 2010. A spectral approach for probabilistic grammatical inference on trees. In Proceedings of ALT.
4. B. Balle, A. Quattoni, and X. Carreras. 2011. A spectral learning algorithm for finite state transducers. In Proceedings of ECML.
5. E. Black, S. Abney, D. Flickenger, C. Gdaniec, R. Grishman, P Harrison, D. Hindle, R. Ingria, F. Jelinek, J. Klavans, M. Liberman, M. Marcus, S. Roukos, B. Santorini, and T. Strzalkowski. 1991. A procedure for quantitatively comparing the syntactic coverage of English grammars. In Proceedings of DARPA Workshop on Speech and Natural Language.
6. X. Carreras, M. Collins, and T. Koo. 2008. TAG, Dynamic Programming, and the Perceptron for Efficient, Feature-rich Parsing. In Proceedings of CoNLL, pages 9-16.
7. E. Charniak and M. Johnson. 2005. Coarse-to-fine nbest parsing and maxent discriminative reranking. In Proceedings of ACL.
8. S. B. Cohen, K. Stratos, M. Collins, D. F. Foster, and L. Ungar. 2012. Spectral learning of latent-variable PCFGs. In Proceedings of ACL.
9. M. Collins. 2003. Head-driven statistical models for natural language processing. Computational Linguistics, 29:589-637.
10. P. Dhillon, D. P. Foster, and L. H. Ungar. 2011. Multiview learning of word embeddings via CCA. In Proceedings of NIPS.
11. P. Dhillon, J. Rodu, M. Collins, D. P. Foster, and L. H. Ungar. 2012. Spectral dependency parsing with latent variables. In Proceedings of EMNLP.
12. J. Goodman. 1996. Parsing algorithms and metrics. In Proceedings of ACL.
13. D. Hardoon, S. Szedmak, and J. Shawe-Taylor. 2004. Canonical correlation analysis: An overview with application to learning methods. Neural Computation, 16(12):2639-2664.
14. S. Hiroyuki, M. Yusuke, F. Akinori, and N. Masaaki. 2012. Bayesian symbol-refined tree substitution grammars for syntactic parsing. In Proceedings of ACL, pages 440-448.
15. H. Hotelling. 1936. Relations between two sets of variants. Biometrika, 28:321-377.
16. D. Hsu, S. M. Kakade, and T. Zhang. 2009. A spectral algorithm for learning hidden Markov models. In Proceedings of COLT.
17. S. M. Kakade and D. P. Foster. 2009. Multi-view regression via canonical correlation analysis. In COLT.
18. D. Klein and C. D. Manning. 2003. Accurate unlexicalized parsing. In Proc. of ACL, pages 423-430.
19. F. M. Luque, A. Quattoni, B. Balle, and X. Carreras. 2012. Spectral learning for non-deterministic dependency parsing. In Proceedings of EACL.
20. M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn treebank. Computational Linguistics, 19:313-330.
21. A. F. T. Martins, N. A. Smith, E. P. Xing, M. T. Figueiredo, and M. Q. Aguiar. 2010. TurboParsers: Dependency parsing by approximate variational inference. In Proceedings of EMNLP.
22. T. Matsuzaki, Y. Miyao, and J. Tsujii. 2005. Probabilistic CFG with latent annotations. In Proceedings of ACL.
23. A. Parikh, L. Song, and E. P. Xing. 2011. A spectral algorithm for latent tree graphical models. In Proceedings of The 28th International Conference on Machine Learningy (ICML 2011).
24. S. Petrov and D. Klein. 2007. Improved inference for unlexicalized parsing. In Proc. of HLT-NAACL.
25. S. Petrov, L. Barrett, R. Thibaux, and D. Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In Proceedings of COLING-ACL.
26. S. Siddiqi, B. Boots, and G. Gordon. 2010. Reducedrank hidden markov models. JMLR, 9:741-748.
27. S. Vempala and G. Wang. 2004. A spectral algorithm for learning mixtures of distributions. Journal of Computer and System Sciences, 68(4):841-860.