메뉴 건너뛰기




Volumn , Issue , 2005, Pages 137-144

Speeding up training with tree kernels for node relation labeling

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; FORESTRY; NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS; VECTOR SPACES;

EID: 80053275652     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1220575.1220593     Document Type: Conference Paper
Times cited : (18)

References (17)
  • 2
    • 84862288194 scopus 로고    scopus 로고
    • Introduction to the CoNLL-2005 shared task: Semantic role labeling
    • X. Carreras and L. Màrquez. 2005. Introduction to the CoNLL-2005 shared task: Semantic role labeling. In CoNLL 2005.
    • (2005) CoNLL 2005
    • Carreras, X.1    Màrquez, L.2
  • 3
    • 26944488170 scopus 로고    scopus 로고
    • CMTreeMiner: Mining both closed and maximal frequent subtrees
    • Y. Chi, Y. Yang, Y. Xia, and R. R. Muntz. 2004. CMTreeMiner: Mining both closed and maximal frequent subtrees. In PAKDD 2004.
    • (2004) PAKDD 2004
    • Chi, Y.1    Yang, Y.2    Xia, Y.3    Muntz, R.R.4
  • 4
    • 1942419006 scopus 로고    scopus 로고
    • Convolution kernels for natural language
    • M. Collins and N. Duffy. 2001. Convolution kernels for natural language. In NIPS 2001.
    • (2001) NIPS 2001
    • Collins, M.1    Duffy, N.2
  • 5
    • 85144480129 scopus 로고    scopus 로고
    • Dependency tree kernels for relation extraction
    • A. Culotta and J. Sorensen. 2004. Dependency tree kernels for relation extraction. In ACL 2004.
    • (2004) ACL 2004
    • Culotta, A.1    Sorensen, J.2
  • 6
    • 1942485292 scopus 로고    scopus 로고
    • On kernel methods for relational learning
    • C. Cumby and D. Roth. 2003. On kernel methods for relational learning. In ICML 2003.
    • (2003) ICML 2003
    • Cumby, C.1    Roth, D.2
  • 9
    • 10844244750 scopus 로고    scopus 로고
    • Kernels for semistructured data
    • H. Kashima and T. Koyanagi. 2002. Kernels for semistructured data. In ICML 2002, pages 291-298.
    • (2002) ICML 2002 , pp. 291-298
    • Kashima, H.1    Koyanagi, T.2
  • 10
    • 85147247683 scopus 로고    scopus 로고
    • Fast methods for kernel-based text analysis
    • T. Kudo and Y. Matsumoto. 2003a. Fast methods for kernel-based text analysis. In ACL 2003.
    • (2003) ACL 2003
    • Kudo, T.1    Matsumoto, Y.2
  • 11
    • 80053225641 scopus 로고    scopus 로고
    • Subtree-based Markov random fields and its application to natural language analysis (in Japanese)
    • NL-157
    • T. Kudo and Y. Matsumoto. 2003b. Subtree-based Markov random fields and its application to natural language analysis (in Japanese). IPSJ, NL-157.
    • (2003) IPSJ
    • Kudo, T.1    Matsumoto, Y.2
  • 12
    • 84996469094 scopus 로고    scopus 로고
    • A boosting algorithm for classification of semi-structured text
    • T. Kudo and Y. Matsumoto. 2004. A boosting algorithm for classification of semi-structured text. In EMNLP 2004, pages 301-308.
    • (2004) EMNLP 2004 , pp. 301-308
    • Kudo, T.1    Matsumoto, Y.2
  • 13
    • 85036466792 scopus 로고    scopus 로고
    • A study on convolution kernels for shallow semantic parsing
    • A. Moschitti. 2004. A study on convolution kernels for shallow semantic parsing. In ACL 2004.
    • (2004) ACL 2004
    • Moschitti, A.1
  • 14
    • 79957672585 scopus 로고    scopus 로고
    • Using LTAG based features in parse reranking
    • L. Shen, A. Sarkar, and A. K. Joshi. 2003. Using LTAG based features in parse reranking. In EMNLP 2003.
    • (2003) EMNLP 2003
    • Shen, L.1    Sarkar, A.2    Joshi, A.K.3
  • 15
    • 30344446850 scopus 로고    scopus 로고
    • Convolution kernels with feature selection for natural language processing tasks
    • J. Suzuki, H. Isozaki, and E. Maeda. 2004. Convolution kernels with feature selection for natural language processing tasks. In ACL 2004, pages 119-126.
    • (2004) ACL 2004 , pp. 119-126
    • Suzuki, J.1    Isozaki, H.2    Maeda, E.3


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