메뉴 건너뛰기




Volumn , Issue , 2007, Pages 245-248

NAIST.Japan: Temporal relation identification using dependency parsed tree

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

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

References (9)
  • 2
    • 85033690108 scopus 로고    scopus 로고
    • Verbocean: Mining the web for fine-grained semantiv verb relations
    • T. Chklovsky and P. Pantel. 2004. Verbocean: Mining the web for fine-grained semantiv verb relations. In Proc. of EMNLP-2004.
    • (2004) Proc. of EMNLP-2004
    • Chklovsky, T.1    Pantel, P.2
  • 3
    • 33646057547 scopus 로고    scopus 로고
    • New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron
    • M. Collins and N. Duffy. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In Proc. of ACL-2002.
    • (2002) Proc. of ACL-2002
    • Collins, M.1    Duffy, N.2
  • 4
    • 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 Proc. of EMNLP-2004.
    • (2004) Proc. of EMNLP-2004
    • Kudo, T.1    Matsumoto, Y.2
  • 7
    • 84876798255 scopus 로고    scopus 로고
    • Online learning of approximate dependency parsing algorithms
    • R. McDonald and F. Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc. of EACL-2006.
    • (2006) Proc. of EACL-2006
    • McDonald, R.1    Pereira, F.2


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