메뉴 건너뛰기




Volumn , Issue , 2008, Pages 400-409

A dependency-based word subsequence kernel

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; SYNTACTICS;

EID: 80053361846     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1613715.1613767     Document Type: Conference Paper
Times cited : (14)

References (25)
  • 1
    • 80053262847 scopus 로고    scopus 로고
    • A shortest path dependency kernel for relation extraction
    • Vancouver, BC, October
    • Razvan C. Bunescu and Raymond J. Mooney. 2005a. A shortest path dependency kernel for relation extraction. In Proc. of HLT/EMNLP-05, pages 724-731, Vancouver, BC, October.
    • (2005) Proc. of HLT/EMNLP-05 , pp. 724-731
    • Bunescu, R.C.1    Mooney, R.J.2
  • 2
    • 84864058992 scopus 로고    scopus 로고
    • Subsequence kernels for relation extraction
    • Y. Weiss, B. Schölkopf, and J. Platt, editors, Vancouver, BC
    • Razvan C. Bunescu and Raymond J. Mooney. 2005b. Subsequence kernels for relation extraction. In Y. Weiss, B. Schölkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, Vancouver, BC.
    • (2005) Advances in Neural Information Processing Systems , vol.18
    • Bunescu, R.C.1    Mooney, R.J.2
  • 4
    • 35348959878 scopus 로고    scopus 로고
    • A hybrid convolution tree kernel for semantic role labeling
    • Sydney, Australia, July
    • Wanxiang Che, Min Zhang, Ting Liu, and Sheng Li. 2006. A hybrid convolution tree kernel for semantic role labeling. In Proc. of COLING/ACL-06, pages 73- 80, Sydney, Australia, July.
    • (2006) Proc. of COLING/ACL-06 , pp. 73-80
    • Che, W.1    Zhang, M.2    Liu, T.3    Li, S.4
  • 5
    • 1942419006 scopus 로고    scopus 로고
    • Convolution kernels for natural language
    • Michael Collins and Nigel Duffy. 2001. Convolution kernels for natural language. In Proc. of NIPS-2001.
    • (2001) Proc. of NIPS-2001
    • Collins, M.1    Duffy, N.2
  • 7
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • Philadelphia, PA, July
    • Michael Collins. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In Proc. of ACL-2002, pages 263-270, Philadelphia, PA, July.
    • (2002) Proc. of ACL-2002 , pp. 263-270
    • Collins, M.1
  • 9
    • 85144480129 scopus 로고    scopus 로고
    • Dependency tree kernels for relation extraction
    • Barcelona, Spain, July
    • Aron Culotta and Jeffrey Sorensen. 2004. Dependency tree kernels for relation extraction. In Proc. of ACL-04, pages 423-429, Barcelona, Spain, July.
    • (2004) Proc. of ACL-04 , pp. 423-429
    • Culotta, A.1    Sorensen, J.2
  • 11
    • 84860540911 scopus 로고    scopus 로고
    • Using string-kernels for learning semantic parsers
    • Sydney, Australia, July
    • Rohit J. Kate and Raymond J. Mooney. 2006. Using string-kernels for learning semantic parsers. In Proc. of COLING/ACl-06, pages 913-920, Sydney, Australia, July.
    • (2006) Proc. of COLING/ACl-06 , pp. 913-920
    • Kate, R.J.1    Mooney, R.J.2
  • 12
    • 29344433086 scopus 로고    scopus 로고
    • Learning to transform natural to formal languages
    • Pittsburgh, PA, July
    • Rohit J. Kate, Yuk Wah Wong, and Raymond J. Mooney. 2005. Learning to transform natural to formal languages. In Proc. AAAI-2005, pages 1062-1068, Pittsburgh, PA, July.
    • (2005) Proc. AAAI-2005 , pp. 1062-1068
    • Kate, R.J.1    Wong, Y.W.2    Mooney, R.J.3
  • 13
    • 80053551637 scopus 로고    scopus 로고
    • Simple semi-supervised dependency parsing
    • Columbus, Ohio, June
    • Terry Koo, Xavier Carreras, and Michael Collins. 2008. Simple semi-supervised dependency parsing. In Proc. of ACL-08, pages 595-603, Columbus, Ohio, June.
    • (2008) Proc. of ACL-08 , pp. 595-603
    • Koo, T.1    Carreras, X.2    Collins, M.3
  • 15
    • 80053274459 scopus 로고    scopus 로고
    • Non-projective dependency parsing using spanning tree algorithms
    • Vancouver, BC
    • Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proc. Of HLT/EMNLP-05, pages 523-530, Vancouver, BC.
    • (2005) Proc. of HLT/EMNLP-05 , pp. 523-530
    • McDonald, R.1    Pereira, F.2    Ribarov, K.3    Hajič, J.4
  • 16
    • 70349231969 scopus 로고    scopus 로고
    • Exploiting syntactic and shallow semantic kernels for question answer classification
    • Prague, Czech Republic, June
    • Alessandro Moschitti, Silvia Quarteroni, Roberto Basili, and Suresh Manandhar. 2007. Exploiting syntactic and shallow semantic kernels for question answer classification. In Proc. of ACL-07, pages 776-783, Prague, Czech Republic, June.
    • (2007) Proc. of ACL-07 , pp. 776-783
    • Moschitti, A.1    Quarteroni, S.2    Basili, R.3    Manandhar, S.4
  • 17
    • 84874714333 scopus 로고    scopus 로고
    • Making tree kernels practical for natural language learning
    • Trento, Italy, April
    • Alessandro Moschitti. 2006a. Making tree kernels practical for natural language learning. In Proc. of EACL-06, pages 113-120, Trento, Italy, April.
    • (2006) Proc. of EACL-06 , pp. 113-120
    • Moschitti, A.1
  • 18
    • 45749100075 scopus 로고    scopus 로고
    • Syntactic kernels for natural language learning: The semantic role labeling case
    • New York City, USA, June
    • Alessandro Moschitti. 2006b. Syntactic kernels for natural language learning: the semantic role labeling case. In Proc. of HLT/NAACL-06, short papers, pages 97- 100, New York City, USA, June.
    • (2006) Proc. of HLT/NAACL-06, Short Papers , pp. 97-100
    • Moschitti, A.1
  • 19
    • 24944584599 scopus 로고    scopus 로고
    • Efficient computation of gapped substring kernels on large alphabets
    • Juho Rousu and John Shawe-Taylor. 2005. Efficient computation of gapped substring kernels on large alphabets. Journal of Machine Learning Research, 6:1323-1344.
    • (2005) Journal of Machine Learning Research , vol.6 , pp. 1323-1344
    • Rousu, J.1    Shawe-Taylor, J.2
  • 20
    • 79957672585 scopus 로고    scopus 로고
    • Using ltag based features in parse reranking
    • Sapporo, Japan, July
    • Libin Shen, Anoop Sarkar, and Aravind Joshi. 2003. Using ltag based features in parse reranking. In Proc. Of EMNLP-2003, pages 89-96, Sapporo, Japan, July.
    • (2003) Proc. of EMNLP-2003 , pp. 89-96
    • Shen, L.1    Sarkar, A.2    Joshi, A.3
  • 21
    • 37249070952 scopus 로고    scopus 로고
    • The leaf projection path view of parse trees: Exploring string kernels for HPSG parse selection
    • Barcelona, Spain, July
    • Kristina Toutanova, Penka Markova, and Christopher Manning. 2004. The leaf projection path view of parse trees: Exploring string kernels for HPSG parse selection. In Proc. EMNLP-04, pages 166-173, Barcelona, Spain, July.
    • (2004) Proc. EMNLP-04 , pp. 166-173
    • Toutanova, K.1    Markova, P.2    Manning, C.3
  • 23
    • 80053376246 scopus 로고    scopus 로고
    • Semi-supervised convex training for dependency parsing
    • Columbus, Ohio, June
    • Qin IrisWang, Dale Schuurmans, and Dekang Lin. 2008. Semi-supervised convex training for dependency parsing. In Proceedings of ACL-08: HLT, pages 532-540, Columbus, Ohio, June.
    • (2008) Proceedings of ACL-08: HLT , pp. 532-540
    • Wang, Q.I.1    Schuurmans, D.2    Lin, D.3
  • 25
    • 79953239883 scopus 로고    scopus 로고
    • A grammar-driven convolution tree kernel for semantic role classification
    • Prague, Czech Republic, June
    • Min Zhang, Wanxiang Che, Aiti Aw, Chew Lim Tan, Guodong Zhou, Ting Liu, and Sheng Li. 2007. A grammar-driven convolution tree kernel for semantic role classification. In Proc. of ACL-2007, pages 200- 207, Prague, Czech Republic, June.
    • (2007) Proc. of ACL-2007 , pp. 200-207
    • Zhang, M.1    Che, W.2    Aw, A.3    Tan, C.L.4    Zhou, G.5    Liu, T.6    Li, S.7


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