메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1149-1155

A multilingual dependency analysis system using online passive-aggressive learning

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY ANALYSIS; DEPENDENCY PARSING; ON-LINE ALGORITHMS; ONLINE LEARNING ALGORITHMS; PARTICIPATING SYSTEMS;

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

References (28)
  • 3
    • 34447631680 scopus 로고    scopus 로고
    • The PDT: A 3-level annotation scenario
    • (Abeillé, 2003), chapter 7
    • A. Böhmová, J. Hajič, E. Hajǐcová, and B. Hladká. 2003. The PDT: a 3-level annotation scenario. In Abeilĺe (Abeillé, 2003), chapter 7, pages 103-127.
    • (2003) Abeillé , pp. 103-127
    • Böhmová, A.1    Hajič, J.2    Hajǐcová, E.3    Hladká, B.4
  • 5
    • 39149127439 scopus 로고    scopus 로고
    • Sinica treebank: Design criteria, representational issues and implementation
    • (Abeillé, 2003), chapter 13
    • 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 Abeilĺe (Abeilĺe, 2003), chapter 13, pages 231-248.
    • (2003) Abeillé , pp. 231-248
    • Chen, K.1    Luo, C.2    Chang, M.3    Chen, F.4    Chen, C.5    Huang, C.6    Gao, Z.7
  • 6
    • 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. In Science Sinica.
    • (1965) Science Sinica
    • Chu, Y.J.1    Liu, T.H.2
  • 7
    • 85127836544 scopus 로고    scopus 로고
    • Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms
    • M. Collins. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Proceedings of EMNLP.
    • (2002) Proceedings of EMNLP
    • Collins, M.1
  • 9
    • 0141496132 scopus 로고    scopus 로고
    • Ultraconservative online algorithms for multiclass problems
    • K. Crammer and Y. Singer. 2003. Ultraconservative online algorithms for multiclass problems. Journal of Machine Learning Research, 3:951-991.
    • (2003) Journal of Machine Learning Research , vol.3 , pp. 951-991
    • Crammer, K.1    Singer, Y.2
  • 12
    • 4043070633 scopus 로고    scopus 로고
    • Three new probabilistic models for dependency parsing: An exploration
    • J. Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of COLING 1996, pages 340-345.
    • (1996) Proceedings of COLING 1996 , pp. 340-345
    • Eisner, J.1
  • 16
    • 34249852033 scopus 로고
    • Building a large annotated corpus of English: The Penn Treebank
    • M. Marcus, B. Santorini, and M. Marcinkiewicz. 1993. Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 19(2):313-330.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.1    Santorini, B.2    Marcinkiewicz, M.3
  • 24
    • 34447632015 scopus 로고    scopus 로고
    • Building a Turkish treebank
    • (Abeilĺe, 2003), chapter 15
    • K. Oflazer, B. Say, D. Zeynep Hakkani-Tür, and G. Tür. 2003. Building a Turkish treebank. In Abeilĺe (Abeilĺe, 2003), chapter 15, pages 261-277.
    • (2003) Abeilĺe , pp. 261-277
    • Oflazer, K.1    Say, B.2    Hakkani-Tür, D.Z.3    Tür, G.4


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