메뉴 건너뛰기




Volumn , Issue , 2006, Pages 6-13

Porting statistical parsers with data-defined kernels

Author keywords

[No Author keywords available]

Indexed keywords

LARGE MARGIN CLASSIFIERS; PROBABILISTIC MODELING; STATISTICAL PARSER; SVM CLASSIFIERS; TARGET DOMAIN;

EID: 84862300388     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1596276.1596280     Document Type: Conference Paper
Times cited : (13)

References (14)
  • 1
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures and the voted perceptron
    • In, Philadelphia, PA
    • Michael Collins and Nigel Duffy. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures and the voted perceptron. In Proc. ACL 2002, pages 263-270, Philadelphia, PA.
    • (2002) Proc. ACL 2002 , pp. 263-270
    • Collins, M.1    Duffy, N.2
  • 2
    • 85118152899 scopus 로고    scopus 로고
    • Three generative, lexicalized models for statistical parsing
    • In, Somerset, New Jersey
    • Michael Collins. 1997. Three generative, lexicalized models for statistical parsing. In Proc. ACL/EACL 1997, pages 16-23, Somerset, New Jersey.
    • (1997) Proc. ACL/EACL 1997 , pp. 16-23
    • Collins, M.1
  • 4
    • 84859944900 scopus 로고    scopus 로고
    • Corpus variation and parser performance
    • In, Pittsburgh, PA
    • Daniel Gildea. 2001. Corpus variation and parser performance. In Proc. EMNLP 2001, Pittsburgh, PA.
    • (2001) Proc. EMNLP 2001
    • Gildea, D.1
  • 5
    • 84859898745 scopus 로고    scopus 로고
    • Data-defined kernels for parse reranking derived from probabilistic models
    • In, Ann Arbor, MI
    • James Henderson and Ivan Titov. 2005. Data-defined kernels for parse reranking derived from probabilistic models. In Proc. ACL 2005, Ann Arbor, MI.
    • (2005) Proc. ACL 2005
    • Henderson, J.1    Titov, I.2
  • 6
    • 85118708235 scopus 로고    scopus 로고
    • Inducing history representations for broad coverage statistical parsing
    • In, Edmonton, Canada
    • James Henderson. 2003. Inducing history representations for broad coverage statistical parsing. In Proc. NAACL/HLT 2003, pages 103-110, Edmonton, Canada.
    • (2003) Proc. NAACL/HLT 2003 , pp. 103-110
    • Henderson, J.1
  • 7
    • 78049407284 scopus 로고    scopus 로고
    • Hidden-variable models for discriminative reranking
    • In, Vancouver, B.C., Canada
    • Terry Koo and Michael Collins. 2005. Hidden-variable models for discriminative reranking. In Proc. EMNLP 2005, Vancouver, B.C., Canada.
    • (2005) Proc. EMNLP 2005
    • Koo, T.1    Collins, M.2
  • 8
    • 34249852033 scopus 로고
    • Building a large annotated corpus of English: The Penn Treebank
    • Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Marcinkiewicz, M.A.3
  • 9
    • 84859896044 scopus 로고    scopus 로고
    • Probabilistic CFG with latent annotations
    • In, Ann Arbor, MI
    • Takuya Matsuzaki, Yusuke Miyao, and Jun'ichi Tsujii. 2005. Probabilistic CFG with latent annotations. In Proc. ACL 2005, Ann Arbor, MI.
    • (2005) Proc. ACL 2005
    • Matsuzaki, T.1    Miyao, Y.2    Tsujii, J.3
  • 10
    • 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:151-175.
    • (1999) Machine Learning , vol.34 , pp. 151-175
    • Ratnaparkhi, A.1
  • 11
    • 84862293242 scopus 로고    scopus 로고
    • Supervised and unsuperised PCFG adaptation to novel domains
    • In, Edmionton, Canada
    • Brian Roark and Michiel Bacchiani. 2003. Supervised and unsuperised PCFG adaptation to novel domains. In Proc. HLT/ACL 2003, Edmionton, Canada.
    • (2003) Proc. HLT/ACL 2003
    • Roark, B.1    Bacchiani, M.2
  • 12
    • 85123782758 scopus 로고    scopus 로고
    • An SVM based voting algorithm with application to parse reranking
    • In, Edmonton, Canada
    • Libin Shen and Aravind K. Joshi. 2003. An SVM based voting algorithm with application to parse reranking. In Proc. 7th Conf. on Computational Natural Language Learning, pages 9-16, Edmonton, Canada.
    • (2003) Proc. 7th Conf. on Computational Natural Language Learning , pp. 9-16
    • Shen, L.1    Joshi, A.K.2
  • 13
    • 14344250451 scopus 로고    scopus 로고
    • Support vector machine learning for interdependent and structured output spaces
    • In, Banff, Alberta, Canada
    • Ioannis Tsochantaridis, Thomas Hofmann, Thorsten Joachims, and Yasemin Altun. 2004. Support vector machine learning for interdependent and structured output spaces. In Proc. 21st Int. Conf. on Machine Learning, pages 823-830, Banff, Alberta, Canada.
    • (2004) Proc. 21st Int. Conf. on Machine Learning , pp. 823-830
    • Tsochantaridis, I.1    Hofmann, T.2    Joachims, T.3    Altun, Y.4
  • 14
    • 0347606818 scopus 로고    scopus 로고
    • More accurate tests for the statistical significance of the result differences
    • In, Saarbruken, Germany
    • Alexander Yeh. 2000. More accurate tests for the statistical significance of the result differences. In Proc. 17th Int. Conf. on Computational Linguistics, pages 947-953, Saarbruken, Germany.
    • (2000) Proc. 17th Int. Conf. on Computational Linguistics , pp. 947-953
    • Yeh, A.1


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