메뉴 건너뛰기




Volumn , Issue , 2009, Pages 162-171

Transition-based parsing of the Chinese treebank using a global discriminative model

Author keywords

[No Author keywords available]

Indexed keywords

BEAM SEARCH; COMPETITIVE PERFORMANCE; DEPENDENCY PARSING; DETERMINISTICS; DISCRIMINATIVE MODELS; MODEL-BASED OPC; PARSING PROCESS; STATE OF THE ART; TREEBANKS;

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

References (22)
  • 1
    • 10044271821 scopus 로고    scopus 로고
    • Two statistical parsing models applied to the Chinese Treebank
    • Morristown, NJ, USA
    • Daniel M. Bikel and David Chiang. 2000. Two statistical parsing models applied to the Chinese Treebank. In Proceedings of SIGHAN Workshop, pages 1-6, Morristown, NJ, USA.
    • (2000) Proceedings of SIGHAN Workshop , pp. 1-6
    • Bikel, Daniel M.1    Chiang, David2
  • 3
    • 52449089736 scopus 로고
    • Generalized probabilistic LR parsing of natural language (corpora) with unification-based grammars
    • Ted Briscoe and John Carroll. 1993. Generalized probabilistic LR parsing of natural language (corpora) with unification-based grammars. Computational Linguistics, 19(1):25-59.
    • (1993) Computational Linguistics , vol.19 , Issue.1 , pp. 25-59
    • Briscoe, Ted1    Carroll, John2
  • 4
    • 80053251519 scopus 로고    scopus 로고
    • Tag, dynamic programming, and the perceptron for efficient, feature-rich parsing
    • Manchester, England, August
    • Xavier Carreras, Michael Collins, and Terry Koo. 2008. Tag, dynamic programming, and the perceptron for efficient, feature-rich parsing. In Proceedings of CoNLL, pages 9-16, Manchester, England, August.
    • (2008) Proceedings of CoNLL , pp. 9-16
    • Carreras, Xavier1    Collins, Michael2    Koo, Terry3
  • 5
    • 85036148712 scopus 로고    scopus 로고
    • A maximum-entropy-inspired parser
    • Seattle, WA
    • Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of NAACL, pages 132-139, Seattle, WA.
    • (2000) Proceedings of NAACL , pp. 132-139
    • Charniak, Eugene1
  • 7
    • 37249086043 scopus 로고    scopus 로고
    • Wide-coverage efficient statistical parsing with CCG and log-linear models
    • Stephen Clark and James R. Curran. 2007. Wide-coverage efficient statistical parsing with CCG and log-linear models. Computational Linguistics, 33(4):493-552.
    • (2007) Computational Linguistics , vol.33 , Issue.4 , pp. 493-552
    • Clark, Stephen1    Curran, James R.2
  • 8
    • 85116919751 scopus 로고    scopus 로고
    • Incremental parsing with the perceptron algorithm
    • Barcelona, Spain, July
    • Michael Collins and Brian Roark. 2004. Incremental parsing with the perceptron algorithm. In Proceedings of ACL, pages 111-118, Barcelona, Spain, July.
    • (2004) Proceedings of ACL , pp. 111-118
    • Collins, Michael1    Roark, Brian2
  • 9
    • 85118152899 scopus 로고    scopus 로고
    • Three generative, lexicalised models for statistical parsing
    • Madrid, Spain
    • Michael Collins. 1997. Three generative, lexicalised models for statistical parsing. In Proceedings of the 35th Meeting of the ACL, pages 16-23, Madrid, Spain.
    • (1997) Proceedings of the 35th Meeting of the ACL , pp. 16-23
    • Collins, Michael1
  • 10
    • 85127836544 scopus 로고    scopus 로고
    • Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms
    • Philadelphia, USA, July
    • Michael Collins. 2002. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proceedings of EMNLP, pages 1-8, Philadelphia, USA, July.
    • (2002) Proceedings of EMNLP , pp. 1-8
    • Collins, Michael1
  • 11
    • 79952811980 scopus 로고    scopus 로고
    • Probabilistic models for action-based Chinese dependency parsing
    • Warsaw, Poland, September
    • Xiangyu Duan, Jun Zhao, and Bo Xu. 2007. Probabilistic models for action-based Chinese dependency parsing. In Proceedings of ECML/ECPPKDD, Warsaw, Poland, September.
    • (2007) Proceedings of ECML/ECPPKDD
    • Duan, Xiangyu1    Zhao, Jun2    Xu, Bo3
  • 12
    • 72449211489 scopus 로고    scopus 로고
    • Efficient, feature-based, conditional random field parsing
    • Columbus, Ohio, June. Association for Computational Linguistics
    • Jenny Rose Finkel, Alex Kleeman, and Christopher D. Manning. 2008. Efficient, feature-based, conditional random field parsing. In Proceedings of ACL/HLT, pages 959-967, Columbus, Ohio, June. Association for Computational Linguistics.
    • (2008) Proceedings of ACL/HLT , pp. 959-967
    • Finkel, Jenny Rose1    Kleeman, Alex2    Manning, Christopher D.3
  • 13
    • 78649300745 scopus 로고    scopus 로고
    • Is it harder to parse Chinese, or the Chinese Treebank?
    • Sapporo, Japan, July
    • Roger Levy and Christopher D. Manning. 2003. Is it harder to parse Chinese, or the Chinese Treebank? In Proceedings of ACL, pages 439-446, Sapporo, Japan, July.
    • (2003) Proceedings of ACL , pp. 439-446
    • Levy, Roger1    Manning, Christopher D.2
  • 14
    • 84859925125 scopus 로고    scopus 로고
    • Online large-margin training of dependency parsers
    • Ann Arbor, Michigan, June
    • Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005. Online large-margin training of dependency parsers. In Proceedings of ACL, pages 91-98, Ann Arbor, Michigan, June.
    • (2005) Proceedings of ACL , pp. 91-98
    • McDonald, Ryan1    Crammer, Koby2    Pereira, Fernando3
  • 16
    • 84858380058 scopus 로고    scopus 로고
    • Improved inference for unlexicalized parsing
    • Rochester, New York, April. Association for Computational Linguistics
    • Slav Petrov and Dan Klein. 2007. Improved inference for unlexicalized parsing. In Proceedings of HLT/NAACL, pages 404-411, Rochester, New York, April. Association for Computational Linguistics.
    • (2007) Proceedings of HLT/NAACL , pp. 404-411
    • Petrov, Slav1    Klein, Dan2
  • 17
    • 0032660854 scopus 로고    scopus 로고
    • Learning to parse natural language with maximum entropy models
    • Adwait Ratnaparkhi. 1999. Learning to parse natural language with maximum entropy models. Machine Learning, 34(1-3):151-175.
    • (1999) Machine Learning , vol.34 , Issue.1-3 , pp. 151-175
    • Ratnaparkhi, Adwait1
  • 18
    • 85116932591 scopus 로고    scopus 로고
    • A classifier-based parser with linear run-time complexity
    • Vancouver, British Columbia, October
    • Kenji Sagae and Alon Lavie. 2005. A classifier-based parser with linear run-time complexity. In Proceedings of IWPT, pages 125-132, Vancouver, British Columbia, October.
    • (2005) Proceedings of IWPT , pp. 125-132
    • Sagae, Kenji1    Lavie, Alon2
  • 20
    • 84860532048 scopus 로고    scopus 로고
    • A fast, accurate deterministic parser for Chinese
    • Sydney, Australia
    • Mengqiu Wang, Kenji Sagae, and Teruko Mitamura. 2006. A fast, accurate deterministic parser for Chinese. In Proceedings of COLING/ACL, pages 425-432, Sydney, Australia.
    • (2006) Proceedings of COLING/ACL , pp. 425-432
    • Wang, Mengqiu1    Sagae, Kenji2    Mitamura, Teruko3
  • 22
    • 80053354167 scopus 로고    scopus 로고
    • A tale of two parsers: investigating and combining graph-based and transition-based dependency parsing using beam-search
    • Hawaii, USA, October
    • Yue Zhang and Stephen Clark. 2008. A tale of two parsers: investigating and combining graph-based and transition-based dependency parsing using beam-search. In Proceedings of EMNLP, pages 562-571, Hawaii, USA, October.
    • (2008) Proceedings of EMNLP , pp. 562-571
    • Zhang, Yue1    Clark, Stephen2


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