메뉴 건너뛰기




Volumn 2005-January, Issue , 2005, Pages 271-278

Tree edit distance for textual entailment

Author keywords

PASCAL RTE; Textual entailment; Tree Edit distance

Indexed keywords

CHARACTER RECOGNITION; COSTS; FORESTRY; TREES (MATHEMATICS);

EID: 84962664805     PISSN: 13138502     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (12)

References (18)
  • 9
    • 84992162860 scopus 로고    scopus 로고
    • Discovery of inference rules for question answering
    • Dekang Lin and Patrick Pantel. Discovery of inference rules for Question Answering. Natural Language Engineering, 7(4), pages 343-360, 2001.
    • (2001) Natural Language Engineering , vol.7 , Issue.4 , pp. 343-360
    • Lin, D.1    Pantel, P.2
  • 12
    • 33645236134 scopus 로고    scopus 로고
    • Word net: Similarity - measuring the relatedness of concepts
    • Tedd Pedersen, Siddharth Patwardhan and Jason Michelizzi Word Net: Similarity - Measuring the relatedness of concepts. AAAI-2004.
    • (2004) AAAI
    • Pedersen, T.1    Patwardhan, S.2    Michelizzi, J.3
  • 18
    • 0001495763 scopus 로고
    • Fast algorithm for the unit cost editing distance between trees
    • December
    • Kaizhong Zhang, Dennis Shasha. Fast algorithm for the unit cost editing distance between trees. Journal of algorithms, vol. 11, p. 1245-1262, December 1990.
    • (1990) Journal of Algorithms , vol.11 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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