메뉴 건너뛰기




Volumn , Issue , 2013, Pages 1411-1416

A walk-based semantically enriched tree kernel over distributed word representations

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS;

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

References (25)
  • 1
    • 33750537410 scopus 로고    scopus 로고
    • Conditionally positive definite kernels for svm based image recognition
    • Sabri Boughorbel, Jean-Philippe Tarel, and Nozha Boujemaa. 2005. Conditionally positive definite kernels for svm based image recognition. In ICME, pages 113-116.
    • (2005) ICME , pp. 113-116
    • Boughorbel, S.1    Tarel, J.-P.2    Boujemaa, N.3
  • 3
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • Association for Computational Linguistics
    • Michael Collins and Nigel Duffy. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In Proceedings of the 40th annual meeting on association for computational linguistics, pages 263-270. Association for Computational Linguistics.
    • (2002) Proceedings of the 40th Annual Meeting on Association for Computational Linguistics , pp. 263-270
    • Collins, M.1    Duffy, N.2
  • 7
    • 44949156668 scopus 로고    scopus 로고
    • Using machine translation evaluation techniques to determine sentence-level semantic equivalence
    • Andrew Finch. 2005. Using machine translation evaluation techniques to determine sentence-level semantic equivalence. In In IWP2005.
    • (2005) IWP2005
    • Finch, A.1
  • 12
    • 84857178726 scopus 로고    scopus 로고
    • Paraphrase recognition using machine learning to combine similarity measures
    • Stroudsburg, PA, USA. Association for Computational Linguistics
    • Prodromos Malakasiotis. 2009. Paraphrase recognition using machine learning to combine similarity measures. In Proceedings of the ACL-IJCNLP 2009 Student Research Workshop, ACLstudent '09, pages 27-35, Stroudsburg, PA, USA. Association for Computational Linguistics.
    • (2009) Proceedings of the ACL-IJCNLP 2009 Student Research Workshop, ACLstudent '09 , pp. 27-35
    • Malakasiotis, P.1
  • 13
    • 45749138033 scopus 로고    scopus 로고
    • Tree kernels for semantic role labeling
    • Alessandro Moschitti, Daniele Pighin, and Roberto Basili. 2008. Tree kernels for semantic role labeling. Computational Linguistics, 34(2):193-224.
    • (2008) Computational Linguistics , vol.34 , Issue.2 , pp. 193-224
    • Moschitti, A.1    Pighin, D.2    Basili, R.3
  • 15
    • 33750333944 scopus 로고    scopus 로고
    • Efficient convolution kernels for dependency and constituent syntactic trees
    • Springer
    • Alessandro Moschitti. 2006a. Efficient convolution kernels for dependency and constituent syntactic trees. In Machine Learning: ECML 2006, pages 318-329. Springer.
    • (2006) Machine Learning: ECML 2006 , pp. 318-329
    • Moschitti, A.1
  • 17
    • 84859895244 scopus 로고    scopus 로고
    • Seeing stars: Exploiting class relationships for sentiment categorization with respect to rating scales
    • Bo Pang and Lillian Lee. 2005. Seeing stars: Exploiting class relationships for sentiment categorization with respect to rating scales. In Proceedings of the ACL.
    • (2005) Proceedings of the ACL
    • Pang, B.1    Lee, L.2
  • 18
    • 75149168148 scopus 로고    scopus 로고
    • Exploiting constituent dependencies for tree kernel-based semantic relation extraction
    • Association for Computational Linguistics
    • Longhua Qian, Guodong Zhou, Fang Kong, Qiaoming Zhu, and Peide Qian. 2008. Exploiting constituent dependencies for tree kernel-based semantic relation extraction. In Proceedings of the 22nd International Conference on Computational Linguistics-Volume 1, pages 697-704. Association for Computational Linguistics.
    • (2008) Proceedings of the 22nd International Conference on Computational Linguistics , vol.1 , pp. 697-704
    • Qian, L.1    Zhou, G.2    Kong, F.3    Zhu, Q.4    Qian, P.5
  • 21
    • 80053281465 scopus 로고    scopus 로고
    • A fast, accurate, non-projective, semantically-enriched parser
    • Stroudsburg, PA, USA. Association for Computational Linguistics
    • Stephen Tratz and Eduard Hovy. 2011. A fast, accurate, non-projective, semantically-enriched parser. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP '11, pages 1257-1268, Stroudsburg, PA, USA. Association for Computational Linguistics.
    • (2011) Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP '11 , pp. 1257-1268
    • Tratz, S.1    Hovy, E.2
  • 24
    • 77949622808 scopus 로고    scopus 로고
    • Disambiguating the species of biomedical named entities using natural language parsers
    • Xinglong Wang, Jun'ichi Tsujii, and Sophia Ananiadou. 2010. Disambiguating the species of biomedical named entities using natural language parsers. Bioinformatics, 26(5):661-667.
    • (2010) Bioinformatics , vol.26 , Issue.5 , pp. 661-667
    • Wang, X.1    Tsujii, J.2    Ananiadou, S.3


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