메뉴 건너뛰기




Volumn , Issue , 2008, Pages 2322-2329

How to compare treebanks

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA MINING; ENCODING (SYMBOLS); FORESTRY; LINGUISTICS; SIGNAL ENCODING; SYNTACTICS;

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

References (24)
  • 12
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • V. I. Levenshtein. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics, 10:707-710.
    • (1966) Soviet Physics , vol.10 , pp. 707-710
    • Levenshtein, V.I.1
  • 14
    • 85014232518 scopus 로고    scopus 로고
    • A depedency-based method for evaluating broad-coverage parsers
    • Dekang Lin. 1998. A depedency-based method for evaluating broad-coverage parsers. Natural Language Engineering, 4(2):97-114.
    • (1998) Natural Language Engineering , vol.4 , Issue.2 , pp. 97-114
    • Lin, D.1
  • 15
    • 80053353231 scopus 로고    scopus 로고
    • Annotation schemes and their influence on parsing results
    • Sydney, Australia
    • Wolfgang Maier. 2006. Annotation schemes and their influence on parsing results. In Proceedings of the COLING/ACL 2006 Student Research Workshop, pages 19-24, Sydney, Australia.
    • (2006) Proceedings of the COLING/ACL 2006 Student Research Workshop , pp. 19-24
    • Maier, W.1
  • 24
    • 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


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