메뉴 건너뛰기




Volumn 2, Issue , 2012, Pages 1-5

Higher-order constituent parsing and parser combination

Author keywords

[No Author keywords available]

Indexed keywords

F1 SCORES; FIRST-ORDER; GRAMMAR RULES; HIGHER-ORDER; HIGHER-ORDER MODELS; HIGHPERFORMANCE; PARSE TREES; TREEBANKS;

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

References (33)
  • 2
    • 33646029849 scopus 로고    scopus 로고
    • An efficient implementation of a new DOP model
    • Rens Bod. 2003. An efficient implementation of a new DOP model. In EACL 2003, pages 19-26.
    • (2003) EACL2003 , pp. 19-26
    • Bod, R.1
  • 3
    • 80053343339 scopus 로고    scopus 로고
    • Two languages are better than one (for syntactic parsing)
    • David Burkett and Dan Klein. 2008. Two languages are better than one (for syntactic parsing). In EMNLP 2008, pages 877-886.
    • (2008) EMNLP 2008 , pp. 877-886
    • Burkett, D.1    Klein, D.2
  • 4
    • 80053251519 scopus 로고    scopus 로고
    • TAG, dynamic programming, and the perceptron for efficient, feature-rich parsing
    • Xavier Carreras, Michael Collins, and Terry Koo. 2008. TAG, dynamic programming, and the perceptron for efficient, feature-rich parsing. In CoNLL 2008, pages 9-16.
    • (2008) CoNLL 2008 , pp. 9-16
    • Carreras, X.1    Collins, M.2    Koo, T.3
  • 5
    • 80053358560 scopus 로고    scopus 로고
    • Experiments with a higher-order projective dependency parser
    • Xavier Carreras. 2007. Experiments with a higher-order projective dependency parser. In EMNLP-CoNLL 2007, pages 957-961.
    • (2007) EMNLP-CoNLL 2007 , pp. 957-961
    • Carreras, X.1
  • 6
    • 84859885240 scopus 로고    scopus 로고
    • Coarse-tofine n-best parsing and MaxEnt discriminative reranking
    • Eugene Charniak and Mark Johnson. 2005. Coarse-tofine n-best parsing and MaxEnt discriminative reranking. In ACL 2005, pages 173-180.
    • (2005) ACL 2005 , pp. 173-180
    • Charniak, E.1    Johnson, M.2
  • 7
    • 85036148712 scopus 로고    scopus 로고
    • A maximum-entropy-inspired parser
    • Eugene Charniak. 2000. A maximum-entropy-inspired parser. In NAACL 2000, pages 132-139.
    • (2000) NAACL 2000 , pp. 132-139
    • Charniak, E.1
  • 8
    • 84878174166 scopus 로고    scopus 로고
    • Improving part-ofspeech tagging for context-free parsing
    • Xiao Chen and Chunyu Kit. 2011. Improving part-ofspeech tagging for context-free parsing. In IJCNLP 2011, pages 1260-1268.
    • (2011) IJCNLP 2011 , pp. 1260-1268
    • Chen, X.1    Kit, C.2
  • 10
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • Michael Collins and Nigel Duffy. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In ACL 2002, pages 263-270.
    • (2002) ACL 2002 , pp. 263-270
    • Collins, M.1    Duffy, N.2
  • 11
    • 26444551655 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • Michael Collins. 2000. Discriminative reranking for natural language parsing. In ICML 2000, pages 175-182.
    • (2000) ICML 2000 , pp. 175-182
    • Collins, M.1
  • 12
    • 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 EMNLP 2002, pages 1-8.
    • (2002) EMNLP 2002 , pp. 1-8
    • Collins, M.1
  • 13
    • 4043070633 scopus 로고    scopus 로고
    • Three new probabilistic models for dependency parsing: An exploration
    • Jason M. Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In COLING 1996, pages 340-345.
    • (1996) COLING 1996 , pp. 340-345
    • Eisner, J.M.1
  • 14
    • 72449211489 scopus 로고    scopus 로고
    • Efficient, feature-based, conditional random field parsing
    • Jenny Rose Finkel, Alex Kleeman, and Christopher D. Manning. 2008. Efficient, feature-based, conditional random field parsing. In ACL-HLT 2008, pages 959- 967.
    • (2008) ACL-HLT 2008 , pp. 959-967
    • Finkel, J.R.1    Kleeman, A.2    Manning, C.D.3
  • 15
    • 79551518140 scopus 로고    scopus 로고
    • Combining constituent parsers
    • Victoria Fossum and Kevin Knight. 2009. Combining constituent parsers. In NAACL-HLT 2009, pages 253- 256.
    • (2009) NAACL-HLT 2009 , pp. 253-256
    • Fossum, V.1    Knight, K.2
  • 16
    • 80053361259 scopus 로고    scopus 로고
    • Discriminative training of a neural network statistical parser
    • James Henderson. 2004. Discriminative training of a neural network statistical parser. In ACL 2004, pages 95-102.
    • (2004) ACL 2004 , pp. 95-102
    • Henderson, J.1
  • 17
    • 0013344078 scopus 로고    scopus 로고
    • Training products of experts by minimizing contrastive divergence
    • Geoffrey E. Hinton. 2002. Training products of experts by minimizing contrastive divergence. Neural Computation, 14(8):1771-1800.
    • (2002) Neural Computation , vol.14 , Issue.8 , pp. 1771-1800
    • Hinton, G.E.1
  • 18
    • 80053257514 scopus 로고    scopus 로고
    • Self-training with products of latent variable grammars
    • Zhongqiang Huang, Mary Harper, and Slav Petrov. 2010. Self-training with products of latent variable grammars. In EMNLP 2010, pages 12-22.
    • (2010) EMNLP 2010 , pp. 12-22
    • Huang, Z.1    Harper, M.2    Petrov, S.3
  • 19
    • 84859887879 scopus 로고    scopus 로고
    • Forest reranking: Discriminative parsing with non-local features
    • Liang Huang. 2008. Forest reranking: Discriminative parsing with non-local features. In ACL-HLT 2008, pages 586-594.
    • (2008) ACL-HLT 2008 , pp. 586-594
    • Huang, L.1
  • 20
    • 0013363096 scopus 로고    scopus 로고
    • Joint and conditional estimation of tagging and parsing models
    • Mark Johnson. 2001. Joint and conditional estimation of tagging and parsing models. In ACL 2001, pages 322-329.
    • (2001) ACL 2001 , pp. 322-329
    • Johnson, M.1
  • 22
    • 84859952372 scopus 로고    scopus 로고
    • Efficient thirdorder dependency parsers
    • Terry Koo and Michael Collins. 2010. Efficient thirdorder dependency parsers. In ACL 2010, pages 1-11.
    • (2010) ACL 2010 , pp. 1-11
    • Koo, T.1    Collins, M.2
  • 23
    • 84876798255 scopus 로고    scopus 로고
    • Online learning of approximate dependency parsing algorithms
    • Ryan McDonald and Fernando Pereira. 2006. Online learning of approximate dependency parsing algorithms. In EACL 2006, pages 81-88.
    • (2006) EACL 2006 , pp. 81-88
    • McDonald, R.1    Pereira, F.2
  • 24
    • 84859925125 scopus 로고    scopus 로고
    • Online large-margin training of dependency parsers
    • Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005a. Online large-margin training of dependency parsers. In ACL 2005, pages 91-98.
    • (2005) ACL 2005 , pp. 91-98
    • McDonald, R.1    Crammer, K.2    Pereira, F.3
  • 25
    • 80053274459 scopus 로고    scopus 로고
    • Non-projective dependency parsing using spanning tree algorithms
    • Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005b. Non-projective dependency parsing using spanning tree algorithms. In EMNLP-HLT 2005, pages 523-530.
    • (2005) EMNLP-HLT 2005 , pp. 523-530
    • Mcdonald, R.1    Pereira, F.2    Ribarov, K.3    Hajič, J.4
  • 26
    • 84858380058 scopus 로고    scopus 로고
    • Improved inference for unlexicalized parsing
    • Slav Petrov and Dan Klein. 2007. Improved inference for unlexicalized parsing. In NAACL-HLT 2007, pages 404-411.
    • (2007) NAACL-HLT 2007 , pp. 404-411
    • Petrov, S.1    Klein, D.2
  • 27
    • 85162020178 scopus 로고    scopus 로고
    • Discriminative loglinear grammars with latent variables
    • Slav Petrov and Dan Klein. 2008a. Discriminative loglinear grammars with latent variables. In NIPS 20, pages 1-8.
    • (2008) NIPS 20 , pp. 1-8
    • Petrov, S.1    Klein, D.2
  • 28
    • 80053347519 scopus 로고    scopus 로고
    • Sparse multi-scale grammars for discriminative latent variable parsing
    • Slav Petrov and Dan Klein. 2008b. Sparse multi-scale grammars for discriminative latent variable parsing. In EMNLP 2008, pages 867-876.
    • (2008) EMNLP 2008 , pp. 867-876
    • Petrov, S.1    Klein, D.2
  • 29
    • 79551488594 scopus 로고    scopus 로고
    • Products of random latent variable grammars
    • Slav Petrov. 2010. Products of random latent variable grammars. In NAACL-HLT 2010, pages 19-27.
    • (2010) NAACL-HLT 2010 , pp. 19-27
    • Petrov, S.1
  • 30
    • 0001008029 scopus 로고
    • An efficient method for finding the minimum of a function of several variables without calculating derivatives
    • M. J. D. Powell. 1964. An efficient method for finding the minimum of a function of several variables without calculating derivatives. Computer Journal, 7(2):155- 162.
    • (1964) Computer Journal , vol.7 , Issue.2 , pp. 155-162
    • Powell, M.J.D.1
  • 31
    • 85119974562 scopus 로고    scopus 로고
    • Parser combination by reparsing
    • Kenji Sagae and Alon Lavie. 2006. Parser combination by reparsing. In NAACL-HLT 2006, pages 129-132.
    • (2006) NAACL-HLT 2006 , pp. 129-132
    • Sagae, K.1    Lavie, A.2
  • 33
    • 78649295943 scopus 로고    scopus 로고
    • K-best combination of syntactic parsers
    • Hui Zhang, Min Zhang, Chew Lim Tan, and Haizhou Li. 2009. K-best combination of syntactic parsers. In EMNLP 2009, pages 1552-1560.
    • (2009) EMNLP 2009 , pp. 1552-1560
    • Zhang, H.1    Zhang, M.2    Tan, C.L.3    Li, H.4


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