Approximate PCFG parsing using tensor decomposition

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 487-496

  Cohen, Shay B ^a   Satta, Giorgio ^b   Collins, Michael ^a  

^a Columbia University ^*  (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS;

APPROXIMATION QUALITY; TENSOR DECOMPOSITION; TIME COMPLEXITY; TREEBANKS; UPPER BOUND;

APPROXIMATION ALGORITHMS;

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

References (22)

1. 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.
2. P. Boullier. 2003. Guided earley parsing. In 8th International Workshop on Parsing Technologies, pages 43-54.
3. J. D. Carroll and J. J. Chang. 1970. Analysis of individual differences in multidimensional scaling via an N-way generalization of Eckart-Young decomposition. Psychometrika, 35:283-319.
4. E. Charniak, M. Johnson, M. Elsner, J. Austerweil, D. Ellis, I. Haxton, C. Hill, R. Shrivaths, J. Moore, M. Pozar, and T. Vu. 2006. Multilevel coarse-to-fine pcfg parsing. In Proceedings of HLT-NAACL.
5. E. C. Chi and T. G. Kolda. 2011. On tensors, sparsity, and nonnegative factorizations. ArXiv:1112. 2414 [math. NA], December.
6. S. B. Cohen and M. Collins. 2012. Tensor decomposition for fast latent-variable PCFG parsing. In Proceedings of NIPS.
7. S. B. Cohen, R. J. Simmons, and N. A. Smith. 2011. Products of weighted logic programs. Theory and Practice of Logic Programming, 11(2-3):263-296.
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. J. Eisner and N. A. Smith. 2005. Parsing with soft and hard constraints on dependency length. In Proceedings of IWPT, Parsing '05.
10. J. Eisner, E. Goldlust, and N. A. Smith. 2004. Dyna: A declarative language for implementing dynamic programs. In Proc. of ACL (companion volume).
11. N. M. Faber, R. Bro, and P. Hopke. 2003. Recent developments in CANDECOMP/PARAFAC algorithms: A critical review. Chemometrics and Intelligent Laboratory Systems, 65(1):119-137.
12. J. Goodman. 1996. Parsing algorithms and metrics. In Proceedings of ACL.
13. R. A. Harshman. 1970. Foundations of the PARAFAC procedure: Models and conditions for an explanatory" multi-modal factor analysis. UCLA working papers in phoentics, 16:1-84.
14. J. Høastad. 1990. Tensor rank is NP-complete. Algorithms, 11:644-654.
15. H. Jaeger. 2000. Observable operator models for discrete stochastic time series. Neural Computation, 12(6):1371-1398.
16. D. Klein and C. D. Manning. 2003. Accurate unlexicalized parsing. In Proceedings of ACL.
17. T. G. Kolda and B. W. Bader. 2009. Tensor decompositions and applications. SIAM Rev., 51:455-500.
18. J. B. Kruskal. 1989. Rank, decomposition, and uniqueness for 3-way and N-way arrays. In R. Coppi and S. Bolasco, editors, Multiway Data Analysis, pages 7-18.
19. M. Maamouri, A. Bies, T. Buckwalter, and W. Mekki. 2004. The Penn Arabic Treebank: Building a largescale annotated Arabic corpus. In Proceedings NEMLAR.
20. M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn treebank. Computational Linguistics, 19(2):313-330.
21. T. Matsuzaki, Y. Miyao, and J. Tsujii. 2005. Probabilistic CFG with latent annotations. In Proceedings of ACL.
22. M.-J. Nederhof. 2000. Practical experiments with regular approximation of context-free languages. Computational Linguistics, 26(1):17-44.