메뉴 건너뛰기




Volumn , Issue , 2012, Pages 66-76

Dependency parsing with undirected graphs

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; LINGUISTICS; TREES (MATHEMATICS);

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

References (29)
  • 6
    • 39149127439 scopus 로고    scopus 로고
    • Sinica treebank: Design criteria, representational issues and implementation
    • Anne Abeilĺe, editor, chapter 13, Kluwer
    • K. Chen, C. Luo, M. Chang, F. Chen, C. Chen, C. Huang, and Z. Gao. 2003. Sinica treebank: Design criteria, representational issues and implementation. In Anne Abeilĺe, editor, Treebanks: Building and Using Parsed Corpora, chapter 13, pages 231- 248. Kluwer.
    • (2003) Treebanks: Building and Using Parsed Corpora , pp. 231-248
    • Chen, K.1    Luo, C.2    Chang, M.3    Chen, F.4    Chen, C.5    Huang, C.6    Gao, Z.7
  • 7
    • 0000666661 scopus 로고
    • On the shortest arborescence of a directed graph
    • Y. J. Chu and T. H. Liu. 1965. On the shortest arborescence of a directed graph. Science Sinica, 14:1396- 1400.
    • (1965) Science Sinica , vol.14 , pp. 1396-1400
    • Chu, Y.J.1    Liu, T.H.2
  • 15
    • 50849134556 scopus 로고    scopus 로고
    • The danish dependency treebank and the underlying linguistic theory
    • Växjö, Sweden. Växjö University Press
    • Matthias T. Kromann. 2003. The Danish dependency treebank and the underlying linguistic theory. In Proceedings of the 2nd Workshop on Treebanks and Linguistic Theories (TLT), pages 217-220, Växjö, Sweden. Växjö University Press.
    • (2003) Proceedings of the 2nd Workshop on Treebanks and Linguistic Theories (TLT) , pp. 217-220
    • Kromann, M.T.1
  • 25
    • 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
  • 27
    • 0003644604 scopus 로고
    • Parsing english with a link grammar
    • Carnegie Mellon University, Computer Science
    • Daniel Sleator and Davy Temperley. 1991. Parsing English with a link grammar. Technical Report CMU-CS-91-196, Carnegie Mellon University, Computer Science.
    • (1991) Technical Report CMU-CS-91-196
    • Sleator, D.1    Temperley, D.2
  • 28
    • 0017465744 scopus 로고
    • Finding optimum branchings
    • R. E. Tarjan. 1977. Finding optimum branchings. Networks, 7:25-35.
    • (1977) Networks , vol.7 , pp. 25-35
    • Tarjan, R.E.1


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