메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1373-1379

Tree-distance and some other variants of evalb

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING;

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

References (21)
  • 2
    • 18444373554 scopus 로고    scopus 로고
    • A survey on tree edit distance and related problems
    • Philip Bille. 2005. A survey on tree edit distance and related problems. Theor. Computer. Sci., 337(1-3):217-239.
    • (2005) Theor. Computer. Sci. , vol.337 , Issue.1-3 , pp. 217-239
    • Bille, P.1
  • 4
    • 85036148712 scopus 로고    scopus 로고
    • A maximum-entropy-inspired parser
    • Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of NAACL 2000, pages 132-139.
    • (2000) Proceedings of NAACL 2000 , pp. 132-139
    • Charniak, E.1
  • 5
    • 85118152899 scopus 로고    scopus 로고
    • Three generative, lexicalized models for statistical parsing
    • Michael Collins. 1997. Three generative, lexicalized models for statistical parsing. In Proceedings of ACL 97.
    • (1997) Proceedings of ACL 97
    • Collins, M.1
  • 6
    • 4043082208 scopus 로고    scopus 로고
    • Head-driven statistical models for natural language parsing
    • Michael Collins. 2003. Head-driven statistical models for natural language parsing. Computational Linguistics, 29(4):589-637.
    • (2003) Computational Linguistics , vol.29 , Issue.4 , pp. 589-637
    • Collins, M.1
  • 7
    • 77954139156 scopus 로고    scopus 로고
    • Clustering by tree distance for parse tree normalisation
    • Martin Emms. 2006a. Clustering by tree distance for parse tree normalisation. In Proceedings of NLUCS 2006, pages 91-100.
    • (2006) Proceedings of NLUCS 2006 , pp. 91-100
    • Emms, M.1
  • 8
    • 85020398036 scopus 로고    scopus 로고
    • Variants of tree similarity in a question answering task
    • Sydney, Australia, July. Association for Computational Linguistics
    • Martin Emms. 2006b. Variants of tree similarity in a question answering task. In Proceedings of the Workshop on Linguistic Distances, pages 100-108, Sydney, Australia, July. Association for Computational Linguistics.
    • (2006) Proceedings of the Workshop on Linguistic Distances , pp. 100-108
    • Emms, M.1
  • 9
    • 85037532557 scopus 로고    scopus 로고
    • at www.cs.tcd.ie/Martin. Emms/tdist
    • Martin Emms. 2008. Tree distance software at www.cs.tcd.ie/Martin. Emms/tdist.
    • (2008) Tree Distance Software
  • 10
    • 33745847093 scopus 로고    scopus 로고
    • Recognizing textual entailment with tree edit distance algorithms
    • Ido Dagan, Oren Glickman, and Bernardo Magnini, editors
    • Milen Kouylekov and Bernardo Magnini. 2005. Recognizing textual entailment with tree edit distance algorithms. In Ido Dagan, Oren Glickman, and Bernardo Magnini, editors, Pascal Challenges Workshop on Recognising Textual Entailment.
    • (2005) Pascal Challenges Workshop on Recognising Textual Entailment
    • Kouylekov, M.1    Magnini, B.2
  • 11
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • K. Zhang and D. Shasha. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18:1245-1262.
    • (1989) SIAM Journal of Computing , vol.18 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2
  • 12
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1994. Building a large annotated corpus of english: The penn treebank. Computational Linguistics, 19(2):313-330.
    • (1994) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Ann Marcinkiewicz, M.3
  • 14
    • 29344468250 scopus 로고    scopus 로고
    • Natural language inference via dependency tree mapping: An application to question answering
    • Vasin Punyakanok, Dan Roth, and Wen tau Yih. 2004. Natural language inference via dependency tree mapping: An application to question answering. Computational Linguistics.
    • (2004) Computational Linguistics
    • Punyakanok, V.1    Roth, D.2    Tau Yih, W.3
  • 17
    • 0347622487 scopus 로고    scopus 로고
    • A test of the leaf-ancestor metric for parse accuracy
    • Geoffrey Sampson and Anna Babarczy. 2003. A test of the leaf-ancestor metric for parse accuracy. Nat. Lang. Eng., 9(4):365-380.
    • (2003) Nat. Lang. Eng. , vol.9 , Issue.4 , pp. 365-380
    • Sampson, G.1    Babarczy, A.2
  • 18
    • 85037530127 scopus 로고    scopus 로고
    • Satoshi Sekine and Michael Collins. 1997. evalb software at nlp. cs.nyu.edu/evalb.
    • (1997)
    • Sekine, S.1    Collins, M.2
  • 20
    • 0004217877 scopus 로고
    • 2nd edition, Dept. of Computer Science, University of Glasgow
    • C. J. van Rijsbergen. 1979. Information Retrieval, 2nd edition. Dept. of Computer Science, University of Glasgow.
    • (1979) Information Retrieval
    • Van Rijsbergen, C.J.1
  • 21
    • 0001116877 scopus 로고
    • Binary codes capable of correcting insertions and reversals
    • V. I. Levenshtein. 1966. Binary codes capable of correcting insertions and reversals. Sov. Phys. Dokl, 10:707-710.
    • (1966) Sov. Phys. Dokl , vol.10 , pp. 707-710
    • Levenshtein, V.I.1


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