메뉴 건너뛰기




Volumn , Issue , 2012, Pages 320-331

Generalized higher-order dependency parsing with cube pruning

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC EFFICIENCY; DECODING ALGORITHM; DEPENDENCY PARSER; DEPENDENCY PARSING; HIGHER-ORDER; LINEAR COMPLEXITY; STANDARD TESTS; STRUCTURAL FEATURE;

EID: 84883358952     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (37)

References (39)
  • 1
    • 84859070268 scopus 로고    scopus 로고
    • Beam-width prediction for efficient context-free parsing
    • N. Bodenstab, A. Dunlop, K. Hall, and B. Roark. 2011. Beam-width prediction for efficient context-free parsing. In Proc. ACL.
    • (2011) Proc. ACL
    • Bodenstab, N.1    Dunlop, A.2    Hall, K.3    Roark, B.4
  • 2
    • 85086490822 scopus 로고    scopus 로고
    • CoNLL-X shared task on multilingual dependency parsing
    • S. Buchholz and E. Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proc. of CoNLL.
    • (2006) Proc. of CoNLL
    • Buchholz, S.1    Marsi, E.2
  • 4
    • 84859885240 scopus 로고    scopus 로고
    • Coarse-to-fine n-best parsing and maxent discriminative reranking
    • E. Charniak and M. Johnson. 2005. Coarse-to-fine n-best parsing and maxent discriminative reranking. In Proc. ACL.
    • (2005) Proc. ACL
    • Charniak, E.1    Johnson, M.2
  • 5
    • 34347360650 scopus 로고    scopus 로고
    • Hierarchical phrase-based translation
    • D. Chiang. 2007. Hierarchical phrase-based translation. Computational Linguistics, 33(2).
    • (2007) Computational Linguistics , vol.33 , Issue.2
    • Chiang, D.1
  • 7
    • 85037338954 scopus 로고    scopus 로고
    • Generating typed dependency parses from phrase structure parses
    • M. De Marneffe, B. MacCartney, and C.D. Manning. 2006. Generating typed dependency parses from phrase structure parses. In Proc. of LREC.
    • (2006) Proc. of LREC
    • De Marneffe, M.1    MacCartney, B.2    Manning, C.D.3
  • 8
    • 80053356594 scopus 로고    scopus 로고
    • Probabilistic parsing action models for multi-lingual dependency parsing
    • X. Duan, J. Zhao, and B. Xu. 2007. Probabilistic parsing action models for multi-lingual dependency parsing. In Proc. of EMNLP-CoNLL.
    • (2007) Proc. of EMNLP-CoNLL
    • Duan, X.1    Zhao, J.2    Xu, B.3
  • 9
    • 4043070633 scopus 로고    scopus 로고
    • Three new probabilistic models for dependency parsing: An exploration
    • J. Eisner. 1996. Three new probabilistic models for dependency parsing: an exploration. In Proc. of COLING.
    • (1996) Proc. of COLING
    • Eisner, J.1
  • 10
    • 80053397731 scopus 로고    scopus 로고
    • Cube summing, approximate inference with non-local features, and dynamic programming without semirings
    • K. Gimpel and N.A. Smith. 2009. Cube summing, approximate inference with non-local features, and dynamic programming without semirings. In Proc. EACL.
    • (2009) Proc. EACL
    • Gimpel, K.1    Smith, N.A.2
  • 11
    • 84858414868 scopus 로고    scopus 로고
    • Optimal reduction of rule length in linear context-free rewriting systems
    • C. Gómez-Rodríguez, M. Kuhlmann, G. Satta, and D. Weir. 2009. Optimal reduction of rule length in linear context-free rewriting systems. In Proc. NAACL.
    • (2009) Proc. NAACL
    • Gómez-Rodríguez, C.1    Kuhlmann, M.2    Satta, G.3    Weir, D.4
  • 12
    • 84858387792 scopus 로고    scopus 로고
    • Efficient parsing of well-nested linear context-free rewriting systems
    • C. Gómez-Rodríguez, M. Kuhlmann, and G. Satta. 2010. Efficient parsing of well-nested linear context-free rewriting systems. In Proc. NAACL.
    • (2010) Proc. NAACL
    • Gómez-Rodríguez, C.1    Kuhlmann, M.2    Satta, G.3
  • 13
    • 84860530304 scopus 로고    scopus 로고
    • K-best spanning tree parsing
    • K. Hall. 2007. K-best spanning tree parsing. In Proc. of ACL.
    • (2007) Proc. of ACL
    • Hall, K.1
  • 14
    • 84926138135 scopus 로고    scopus 로고
    • Structured perceptron with inexact search
    • L. Huang and S. Fayong. 2012. Structured perceptron with inexact search. In Proc. of NAACL.
    • (2012) Proc. of NAACL
    • Huang, L.1    Fayong, S.2
  • 15
    • 84859990009 scopus 로고    scopus 로고
    • Dynamic programming for linear-time incremental parsing
    • L. Huang and K. Sagae. 2010. Dynamic programming for linear-time incremental parsing. In Proc. of ACL.
    • (2010) Proc. of ACL
    • Huang, L.1    Sagae, K.2
  • 16
    • 84859887879 scopus 로고    scopus 로고
    • Forest reranking: Discriminative parsing with non-local features
    • L. Huang. 2008. Forest reranking: Discriminative parsing with non-local features. In Proc. of ACL.
    • (2008) Proc. of ACL
    • Huang, L.1
  • 17
    • 80053340695 scopus 로고    scopus 로고
    • Incremental dependency parsing using online learning
    • R. Johansson and P. Nugues. 2007. Incremental dependency parsing using online learning. In Proc. of EMNLP-CoNLL.
    • (2007) Proc. of EMNLP-CoNLL
    • Johansson, R.1    Nugues, P.2
  • 18
    • 84859952372 scopus 로고    scopus 로고
    • Efficient third-order dependency parsers
    • T. Koo and M. Collins. 2010. Efficient third-order dependency parsers. In Proc. of ACL.
    • (2010) Proc. of ACL
    • Koo, T.1    Collins, M.2
  • 20
    • 84891614320 scopus 로고    scopus 로고
    • Treebank grammar techniques for non-projective dependency parsing
    • M. Kuhlmann and G. Satta. 2009. Treebank grammar techniques for non-projective dependency parsing. In Proc. EACL.
    • (2009) Proc. EACL
    • Kuhlmann, M.1    Satta, G.2
  • 21
    • 84859887629 scopus 로고    scopus 로고
    • Concise integer linear programming formulations for dependency parsing
    • A. F. T. Martins, N. Smith, and E. P. Xing. 2009. Concise integer linear programming formulations for dependency parsing. In Proc. of ACL.
    • (2009) Proc. of ACL
    • Martins, A.F.T.1    Smith, N.2    Xing, E.P.3
  • 24
    • 80053360468 scopus 로고    scopus 로고
    • Characterizing the errors of data-driven dependency parsing models
    • R. McDonald and J. Nivre. 2007. Characterizing the errors of data-driven dependency parsing models. In Proc. of EMNLP-CoNLL.
    • (2007) Proc. of EMNLP-CoNLL
    • McDonald, R.1    Nivre, J.2
  • 25
    • 84876798255 scopus 로고    scopus 로고
    • Online learning of approximate dependency parsing algorithms
    • R. McDonald and F. Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc. of EACL.
    • (2006) Proc. of EACL
    • McDonald, R.1    Pereira, F.2
  • 26
    • 84859925125 scopus 로고    scopus 로고
    • Online large-margin training of dependency parsers
    • R. McDonald, K. Crammer, and F. Pereira. 2005. Online large-margin training of dependency parsers. In Proc. of ACL.
    • (2005) Proc. of ACL
    • McDonald, R.1    Crammer, K.2    Pereira, F.3
  • 27
    • 70349242103 scopus 로고    scopus 로고
    • Multilingual dependency parsing using global features
    • T. Nakagawa. 2007. Multilingual dependency parsing using global features. In Proc. of EMNLP-CoNLL.
    • (2007) Proc. of EMNLP-CoNLL
    • Nakagawa, T.1
  • 28
    • 80053375807 scopus 로고    scopus 로고
    • Integrating graph-based and transition-based dependency parsers
    • J. Nivre and R. McDonald. 2008. Integrating graph-based and transition-based dependency parsers. In Proc. of ACL.
    • (2008) Proc. of ACL
    • Nivre, J.1    McDonald, R.2
  • 30
    • 84858380058 scopus 로고    scopus 로고
    • Improved inference for unlexicalized parsing
    • S. Petrov and D. Klein. 2007. Improved inference for unlexicalized parsing. In Proc. NAACL.
    • (2007) Proc. NAACL
    • Petrov, S.1    Klein, D.2
  • 31
    • 80053349723 scopus 로고    scopus 로고
    • Incremental integer linear programming for non-projective dependency parsing
    • S. Riedel and J. Clarke. 2006. Incremental integer linear programming for non-projective dependency parsing. In Proc. of EMNLP.
    • (2006) Proc. of EMNLP
    • Riedel, S.1    Clarke, J.2
  • 32
    • 84863376534 scopus 로고    scopus 로고
    • Classifying chart cells for quadratic complexity context-free inference
    • B. Roark and K. Hollingshead. 2008. Classifying chart cells for quadratic complexity context-free inference. In Proc. COLING.
    • (2008) Proc. COLING
    • Roark, B.1    Hollingshead, K.2
  • 33
    • 84858416194 scopus 로고    scopus 로고
    • Linear complexity context-free parsing pipelines via chart constraints
    • B. Roark and K. Hollingshead. 2009. Linear complexity context-free parsing pipelines via chart constraints. In Proce. NAACL.
    • (2009) Proce. NAACL
    • Roark, B.1    Hollingshead, K.2
  • 34
    • 84883323287 scopus 로고    scopus 로고
    • Efficient multi-pass dependency pruning with vine parsing
    • A. Rush and S. Petrov. 2012. Efficient multi-pass dependency pruning with vine parsing. In Proc. of NAACL.
    • (2012) Proc. of NAACL
    • Rush, A.1    Petrov, S.2
  • 35
    • 80053375671 scopus 로고    scopus 로고
    • Dependency parsing by belief propagation
    • D. Smith and J. Eisner. 2008. Dependency parsing by belief propagation. In Proc. of EMNLP.
    • (2008) Proc. of EMNLP
    • Smith, D.1    Eisner, J.2
  • 36
    • 80053357914 scopus 로고    scopus 로고
    • Fast and robust multilingual dependency parsing with a generative latent variable model
    • I. Titov and J. Henderson. 2007. Fast and robust multilingual dependency parsing with a generative latent variable model. In Proc. of EMNLP-CoNLL.
    • (2007) Proc. of EMNLP-CoNLL
    • Titov, I.1    Henderson, J.2
  • 38
    • 77956001364 scopus 로고    scopus 로고
    • A tale of two parsers: Investigating and combining graph-based and transition-based dependency parsing
    • 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.
    • (2008) Proc. of EMNLP
    • Zhang, Y.1    Clark, S.2
  • 39
    • 84859018340 scopus 로고    scopus 로고
    • Transition-based dependency parsing with rich non-local features
    • Y. Zhang and J. Nivre. 2011. Transition-based dependency parsing with rich non-local features. In Proc. of ACL-HLT, Volume 2.
    • (2011) Proc. of ACL-HLT , vol.2
    • Zhang, Y.1    Nivre, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.