Online learning for inexact hypergraph search

EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

Volumn , Issue , 2013, Pages 908-913

  Zhang, Hao ^a   Huang, Liang ^b   Zhao, Kai ^b   McDonald, Ryan ^a  

^a GOOGLE INC   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; LEARNING ALGORITHMS; NATURAL LANGUAGE PROCESSING SYSTEMS; SOCIAL NETWORKING (ONLINE);

BEAM SEARCH; HYPER GRAPH; INEXACT SEARCHES; ONLINE LEARNING; ONLINE LEARNING ALGORITHMS; PERCEPTRON; SEQUENTIAL SEARCH; STRUCTURED PREDICTION;

E-LEARNING;

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

References (22)

1. B. Bohnet and J. Kuhn. 2012. The best of bothworlds - a graph-based completion model for transition-based parsers. In Proc. of EACL.
2. S. Buchholz and E. Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proc. of CoNLL.
3. David Chiang, Yuval Marton, and Philip Resnik. 2008. Online large-margin training of syntactic and structural translation features. In Proc. of EMNLP.
4. D. Chiang. 2007. Hierarchical phrase-based translation. Computational Linguistics, 33(2).
5. M. Collins and B. Roark. 2004. Incremental parsing with the perceptron algorithm. In Proc. of ACL.
6. M. Collins. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Proc. of ACL.
7. K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer. 2006. Online passive-aggressive algorithms. Journal of Machine Learning Research.
8. H. Daumé and D. Marcu. 2005. Learning as search optimization: Approximate large margin methods for structured prediction. In Proc. of ICML.
9. M. De Marneffe, B. MacCartney, and C.D. Manning. 2006. Generating typed dependency parses from phrase structure parses. In Proc. of LREC.
10. J. Eisner. 1996. Three new probabilistic models for dependency parsing: an exploration. In Proc. of COL-ING.
11. L. Huang, S. Fayong, and G. Yang. 2012. Structured perceptron with inexact search. In Proc. of NAACL.
12. L. Huang. 2008. Forest reranking: Discriminative parsing with non-local features. In Proc. of ACL.
13. T. Koo and M. Collins. 2010. Efficient third-order dependency parsers. In Proc. of ACL.
14. X. Ma and H. Zhao. 2012. Fourth-order dependency parsing. In Proc. of COLING.
15. A. F. T. Martins, N. Smith, E. P. Xing, P. M. Q. Aguiar, and M. A. T. Figueiredo. 2010. Turbo parsers: Dependency parsing by approximate variational inference. In Proc. of EMNLP.
16. A. F. T. Martins, M. B. Almeida, and N. A. Smith. 2013. Turning on the turbo: Fast third-order non-projective turbo parsers. In Proc. of ACL.
17. J. Nivre, J. Hall, S. Kübler, R. McDonald, J. Nilsson, S. Riedel, and D. Yuret. 2007. The CoNLL 2007 shared task on dependency parsing. In Proc. of EMNLP-CoNLL.
18. X. Qian and Y. Liu. 2013. Branch and bound algorithm for dependency parsing with non-local features. TACL, Vol 1.
19. A. Rush and S. Petrov. 2012. Efficient multi-pass dependency pruning with vine parsing. In Proc. of NAACL.
20. Y. Zhang and S. Clark. 2008. A Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing. In Proc. of EMNLP.
21. H. Zhang and R. McDonald. 2012. Generalized higherorder dependency parsing with cube pruning. In Proc. of EMNLP.
22. Y. Zhang and J. Nivre. 2011. Transition-based dependency parsing with rich non-local features. In Proc. of ACL-HLT, Volume 2.