메뉴 건너뛰기




Volumn , Issue , 2009, Pages 305-311

Question Answering over structured data: An entailment-based approach to question analysis

Author keywords

Relation extraction; Restricted domain question answering; Textual entailment

Indexed keywords

EXTRACTION; STATISTICAL TESTS; TEXT PROCESSING;

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

References (13)
  • 5
    • 33745838229 scopus 로고    scopus 로고
    • The PASCAL recognising textual entailment challenge
    • volume 3944 of LNAI. Springer-Verlag
    • I. Dagan, O. Glickman, and B. Magnini. The PASCAL Recognising Textual Entailment Challenge. In Machine Learning Challenges (MLCW 2005), volume 3944 of LNAI. Springer-Verlag, 2006.
    • (2006) Machine Learning Challenges (MLCW 2005)
    • Dagan, I.1    Glickman, O.2    Magnini, B.3
  • 7
    • 77955029524 scopus 로고    scopus 로고
    • Methods for using textual entailment in open-domain question answering
    • Sydney, Australia
    • S. Harabagiu and A. Hickl. Methods for Using Textual Entailment in Open-Domain Question Answering. In Proceedings of COLING/ACL 2006, Sydney, Australia, 2006.
    • (2006) Proceedings of COLING/ACL 2006
    • Harabagiu, S.1    Hickl, A.2
  • 8
    • 33745872567 scopus 로고    scopus 로고
    • Combining lexical resources with tree edit distance for recognizing textual entailment
    • volume 3944 of LNAI. Springer-Verlag
    • M. Kouylekov and B. Magnini. Combining Lexical Resources with Tree Edit Distance for Recognizing Textual Entailment. In Machine Learning Challenges (MLCW 2005), volume 3944 of LNAI. Springer-Verlag, 2006.
    • (2006) Machine Learning Challenges (MLCW 2005)
    • Kouylekov, M.1    Magnini, B.2
  • 9
    • 84866854892 scopus 로고    scopus 로고
    • Detecting expected answer relations through textual entailment
    • Haifa, Israel
    • M. Negri, M. Kouylekov, and B. Magnini. Detecting Expected Answer Relations through Textual Entailment. In Proceedings of CICLing 2008, Haifa, Israel, 2008.
    • (2008) Proceedings of CICLing 2008
    • Negri, M.1    Kouylekov, M.2    Magnini, B.3
  • 13
    • 0001495763 scopus 로고
    • Fast algorithm for the unit cost editing distance between trees
    • December
    • K. Zhang and D. Shasha. Fast Algorithm for the Unit Cost Editing Distance Between Trees. Journal of Algorithms, 11, December 1990.
    • (1990) Journal of Algorithms , vol.11
    • Zhang, K.1    Shasha, D.2


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