메뉴 건너뛰기




Volumn , Issue , 2007, Pages 72-77

Shallow semantics in fast textual entailment rule learners

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS; TEXT PROCESSING;

EID: 85121214305     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (18)

References (9)
  • 2
    • 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 Proceedings of ACL02.
    • (2002) Proceedings of ACL02
    • Collins, Michael1    Duffy, Nigel2
  • 5
    • 0002714543 scopus 로고    scopus 로고
    • Making large-scale svm learning practical
    • B. Schlkopf, C. Burges, and A. Smola, editors, MIT Press
    • Thorsten Joachims. 1999. Making large-scale svm learning practical. In B. Schlkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods-Support Vector Learning. MIT Press.
    • (1999) Advances in Kernel Methods-Support Vector Learning
    • Joachims, Thorsten1
  • 7
    • 84874714333 scopus 로고    scopus 로고
    • Making tree kernels practical for natural language learning
    • Trento, Italy
    • Alessandro Moschitti. 2006. Making tree kernels practical for natural language learning. In Proceedings of EACL’06, Trento, Italy.
    • (2006) Proceedings of EACL’06
    • Moschitti, Alessandro1


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