메뉴 건너뛰기




Volumn 2, Issue , 2011, Pages 687-692

Getting the most out of transition-based dependency parsing

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; DEPENDENCY PARSING; NON-PROJECTIVE DEPENDENCY PARSING; PARSING ALGORITHM;

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

References (21)
  • 5
    • 84868134211 scopus 로고    scopus 로고
    • K-best, locally pruned, transition-based dependency parsing using robust risk minimization
    • John Benjamins
    • Jinho D. Choi and Nicolas Nicolov. 2009. K-best, locally pruned, transition-based dependency parsing using robust risk minimization. In Recent Advances in Natural Language Processing V, pages 205-216. John Benjamins.
    • (2009) Recent Advances in Natural Language Processing , vol.5 , pp. 205-216
    • Choi, J.D.1    Nicolov, N.2
  • 7
    • 67349244372 scopus 로고    scopus 로고
    • Search-based structured prediction
    • Hal Daumé, Iii, John Langford, and Daniel Marcu. 2009. Search-based structured prediction. Machine Learning, 75(3):297-325.
    • (2009) Machine Learning , vol.75 , Issue.3 , pp. 297-325
    • Daumé, H.1    Langford, I.J.2    Marcu, D.3
  • 17
    • 57349126314 scopus 로고    scopus 로고
    • Algorithms for deterministic incremental dependency parsing
    • Joakim Nivre. 2008. Algorithms for deterministic incremental dependency parsing. Computational Linguistics, 34(4):513-553.
    • (2008) Computational Linguistics , vol.34 , Issue.4 , pp. 513-553
    • Nivre, J.1


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