메뉴 건너뛰기




Volumn , Issue , 2008, Pages 133-136

Accurate conversion of dependency parses: Targeting the stanford scheme

Author keywords

[No Author keywords available]

Indexed keywords

PERCENTAGE POINTS; PERFORMANCE PENALTIES; STANFORD;

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

References (13)
  • 1
  • 2
    • 84860542791 scopus 로고    scopus 로고
    • Formalism-independent parser evaluation with CCG and DepBank
    • S. Clark and J. Curran. 2007. Formalism-independent parser evaluation with CCG and DepBank. In Proc. of ACL'07, pages 248-255.
    • (2007) Proc. of ACL'07 , pp. 248-255
    • Clark, S.1    Curran, J.2
  • 3
    • 33847095048 scopus 로고    scopus 로고
    • Benchmarking natural-language parsers for biological applications using dependency graphs
    • A. B. Clegg and A. Shepherd. 2007. Benchmarking natural-language parsers for biological applications using dependency graphs. BMC Bioinformatics, 8(1):24.
    • (2007) BMC Bioinformatics , vol.8 , Issue.1 , pp. 24
    • Clegg, A.B.1    Shepherd, A.2
  • 4
    • 33646016255 scopus 로고    scopus 로고
    • Parsing biomedical literature
    • M. Lease and E. Charniak. 2005. Parsing biomedical literature. In Proc. of IJCNLP'05, pages 58-69.
    • (2005) Proc. of IJCNLP'05 , pp. 58-69
    • Lease, M.1    Charniak, E.2
  • 5
    • 85037338954 scopus 로고    scopus 로고
    • Generating typed dependency parses from phrase structure parses
    • M-C. de Marneffe, B. MacCartney, and C. Manning. 2006. Generating typed dependency parses from phrase structure parses. In Proc. of LREC'06, pages 449-454.
    • (2006) Proc. of LREC'06 , pp. 449-454
    • De Marneffe, M.-C.1    MacCartney, B.2    Manning, C.3
  • 6
    • 0005496287 scopus 로고    scopus 로고
    • Automatic rule induction for unknown-word guessing
    • A. Mikheev. 1997. Automatic rule induction for unknown-word guessing. Computational Linguistics, 23(3):405-423.
    • (1997) Computational Linguistics , vol.23 , Issue.3 , pp. 405-423
    • Mikheev, A.1
  • 9
    • 84886762111 scopus 로고    scopus 로고
    • On the unification of syntactic annotations under the stanford dependency scheme: A case study on BioInfer and GENIA
    • S. Pyysalo, F. Ginter, V. Laippala, K. Haverinen, J. Heimonen, and T. Salakoski. 2007b. On the unification of syntactic annotations under the Stanford dependency scheme: A case study on BioInfer and GENIA. In Proc. of BioNLP'07, pages 25-32.
    • (2007) Proc. of BioNLP'07 , pp. 25-32
    • Pyysalo, S.1    Ginter, F.2    Laippala, V.3    Haverinen, K.4    Heimonen, J.5    Salakoski, T.6
  • 10
    • 84874251872 scopus 로고    scopus 로고
    • Challenges in mapping of syntactic representations for framework-independent parser evaluation
    • K. Sagae, Y. Miyao, T. Matsuzaki, and J. Tsujii. 2008. Challenges in mapping of syntactic representations for framework-independent parser evaluation. In Proc. of ICGL'08.
    • (2008) Proc. of ICGL'08
    • Sagae, K.1    Miyao, Y.2    Matsuzaki, T.3    Tsujii, J.4


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