메뉴 건너뛰기




Volumn , Issue , 2010, Pages 742-750

An efficient algorithm for easy-first non-directional dependency parsing

Author keywords

[No Author keywords available]

Indexed keywords

ATTACHMENT POINTS; COMPLEX STRUCTURE; DEPENDENCY PARSING; DEPENDENCY STRUCTURES; DEPENDENCY TREES; DETERMINISTIC PARSING; EFFICIENT ALGORITHM;

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

References (24)
  • 1
    • 85086490822 scopus 로고    scopus 로고
    • CoNLL-X shared task on multilingual dependency parsing
    • Sabine Buchholz and Erwin Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proc. of CoNLL.
    • (2006) Proc. of CoNLL
    • Buchholz, S.1    Marsi, E.2
  • 2
    • 80053358560 scopus 로고    scopus 로고
    • Experiments with a higher-order projective dependency parser
    • Xavier Carreras. 2007. Experiments with a higher-order projective dependency parser. In Proc. of CoNLL Shared Task, EMNLP-CoNLL.
    • (2007) Proc. of CoNLL Shared Task, EMNLP-CoNLL
    • Carreras, X.1
  • 3
    • 85127836544 scopus 로고    scopus 로고
    • Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms
    • Michael Collins. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Proc of EMNLP.
    • (2002) Proc of EMNLP
    • Collins, M.1
  • 4
    • 85088340969 scopus 로고    scopus 로고
    • Vine parsing and minimum risk reranking for speed and precision
    • Morristown, NJ, USA. Association for Computational Linguistics
    • Markus Dreyer, David A. Smith, and Noah A. Smith. 2006. Vine parsing and minimum risk reranking for speed and precision. In Proc. of CoNLL, pages 201-205, Morristown, NJ, USA. Association for Computational Linguistics.
    • (2006) Proc. of CoNLL , pp. 201-205
    • Dreyer, M.1    Smith, D.A.2    Smith, N.A.3
  • 5
    • 85116870770 scopus 로고    scopus 로고
    • Arsing with soft and hard constraints on dependency length
    • Jason Eisner and Noah A. Smith. 2005. arsing with soft and hard constraints on dependency length. In Proc. of IWPT.
    • (2005) Proc. of IWPT
    • Eisner, J.1    Smith, N.A.2
  • 6
    • 80053434895 scopus 로고    scopus 로고
    • Bilingually-constrained (monolingual) shift-reduce parsing
    • Liang Huang, Wenbin Jiang, and Qun Liu. 2009. Bilingually-constrained (monolingual) shift-reduce parsing. In Proc of EMNLP.
    • (2009) Proc of EMNLP
    • Huang, L.1    Jiang, W.2    Liu, Q.3
  • 7
    • 85008242043 scopus 로고    scopus 로고
    • Extended constituent-to-dependency conversion for English
    • Richard Johansson and Pierre Nugues. 2007. Extended constituent-to- dependency conversion for english. In Proc of NODALIDA.
    • (2007) Proc of NODALIDA
    • Johansson, R.1    Nugues, P.2
  • 8
    • 80053360468 scopus 로고    scopus 로고
    • Characterizing the errors of data-driven dependency parsing models
    • Ryan McDonald and Joakim Nivre. 2007. Characterizing the errors of data-driven dependency parsing models. In Proc. of EMNLP.
    • (2007) Proc. of EMNLP
    • McDonald, R.1    Nivre, J.2
  • 9
    • 84876798255 scopus 로고    scopus 로고
    • Online learning of approximate dependency parsing algorithms
    • Ryan McDonald and Fernando Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc of EACL.
    • (2006) Proc of EACL
    • McDonald, R.1    Pereira, F.2
  • 10
    • 84859925125 scopus 로고    scopus 로고
    • Online large-margin training of dependency parsers
    • Ryan McDonald, Koby Crammer, and Fernando 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
  • 11
    • 70349242103 scopus 로고    scopus 로고
    • Multilingual dependency parsing using global features
    • Tetsuji Nakagawa. 2007. Multilingual dependency parsing using global features. In Proc. of EMNLP-CoNLL.
    • (2007) Proc. of EMNLP-CoNLL
    • Nakagawa, T.1
  • 12
    • 80053375807 scopus 로고    scopus 로고
    • Integrating graph-based and transition-based dependency parsers
    • Columbus, Ohio, June. Association for Computational Linguistics
    • Joakim Nivre and Ryan McDonald. 2008. Integrating graph-based and transition-based dependency parsers. In Proc. of ACL, pages 950-958, Columbus, Ohio, June. Association for Computational Linguistics.
    • (2008) Proc. of ACL , pp. 950-958
    • Nivre, J.1    McDonald, R.2
  • 13
    • 84949890107 scopus 로고    scopus 로고
    • Malt-parser: A data-driven parser-generator for dependency parsing
    • Joakim Nivre, Johan Hall, and Jens Nillson. 2006. Malt-Parser: A data-driven parser-generator for dependency parsing. In Proc. of LREC.
    • (2006) Proc. of LREC
    • Nivre, J.1    Hall, J.2    Nillson, J.3
  • 16
    • 80053349723 scopus 로고    scopus 로고
    • Incremental integer linear programming for non-projective dependency parsing
    • Sebastian Riedel and James Clarke. 2006. Incremental integer linear programming for non-projective dependency parsing. In Proc. of EMNLP 2006, July.
    • (2006) Proc. of EMNLP 2006, July
    • Riedel, S.1    Clarke, J.2
  • 17
    • 85036282108 scopus 로고    scopus 로고
    • A best-first probabilistic shift-reduce parser
    • Kenji Sagae and Alon Lavie. 2006a. A best-first probabilistic shift-reduce parser. In Proc of ACL.
    • (2006) Proc of ACL
    • Sagae, K.1    Lavie, A.2
  • 18
    • 85119974562 scopus 로고    scopus 로고
    • Parser combination by reparsing
    • Kenji Sagae and Alon Lavie. 2006b. Parser combination by reparsing. In Proc of NAACL.
    • (2006) Proc of NAACL
    • Sagae, K.1    Lavie, A.2
  • 19
    • 84858406523 scopus 로고    scopus 로고
    • An English dependency treebank à la tesnière
    • Federico Sangati and Chiara Mazza. 2009. An english dependency treebank à la tesnière. In Proc of TLT8.
    • (2009) Proc of TLT8
    • Sangati, F.1    Mazza, C.2
  • 20
    • 80053261917 scopus 로고    scopus 로고
    • Ltag dependency parsing with bidirectional incremental construction
    • Libin Shen and Aravind K. Joshi. 2008. Ltag dependency parsing with bidirectional incremental construction. In Proc of EMNLP.
    • (2008) Proc of EMNLP
    • Shen, L.1    Joshi, A.K.2
  • 21
    • 84860520429 scopus 로고    scopus 로고
    • Guided learning for bidirectional sequence classification
    • Libin Shen, Giorgio Satta, and Aravind K. Joshi. 2007. Guided learning for bidirectional sequence classification. In Proc of ACL.
    • (2007) Proc of ACL
    • Shen, L.1    Satta, G.2    Joshi, A.K.3
  • 22
    • 80053357914 scopus 로고    scopus 로고
    • Fast and robust multilingual dependency parsing with a generative latent variable model
    • Ivan Titov and James 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
  • 23
    • 26044449174 scopus 로고    scopus 로고
    • Statistical dependency analysis with support vector machines
    • Yamada and Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proc. of IWPT.
    • (2003) Proc. of IWPT
    • Yamada1    Matsumoto2
  • 24
    • 80053354167 scopus 로고    scopus 로고
    • A tale of two parsers: Investigating and combining graph-based and transition-based dependency parsing using beamsearch
    • Yue Zhang and Stephen Clark. 2008. A tale of two parsers: investigating and combining graph-based and transition-based dependency parsing using beamsearch. In Proc of EMNLP.
    • (2008) Proc of EMNLP
    • Yue, Z.1    Clark, S.2


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