메뉴 건너뛰기




Volumn , Issue , 2002, Pages 1-8

Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; HIDDEN MARKOV MODELS; MAXIMUM ENTROPY METHODS;

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

References (12)
  • 1
    • 85146429450 scopus 로고
    • Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging
    • References Brill, E. (1995). Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging. Computational Linguistics.
    • (1995) Computational Linguistics
    • References Brill, E.1
  • 3
    • 1942515435 scopus 로고    scopus 로고
    • New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron
    • Collins, M., and Duy, N. (2002). New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron. In Proceedings of ACL 2002.
    • (2002) Proceedings of ACL 2002
    • Collins, M.1    Duy, N.2
  • 4
    • 85045072379 scopus 로고    scopus 로고
    • Ranking Algorithms for Named{ Entity Extraction: Boosting and the Voted Perceptron
    • Collins, M. (2002). Ranking Algorithms for Named{ Entity Extraction: Boosting and the Voted Perceptron. In Proceedings of ACL 2002.
    • (2002) Proceedings of ACL 2002
    • Collins, M.1
  • 5
    • 0033281425 scopus 로고    scopus 로고
    • Large Margin Classification using the Perceptron Algorithm
    • Freund, Y. & Schapire, R. (1999). Large Margin Classification using the Perceptron Algorithm. In Machine Learning, 37(3):277{296.
    • (1999) Machine Learning , vol.37 , Issue.3 , pp. 277-296
    • Freund, Y.1    Schapire, R.2
  • 7
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and lab eling sequence data
    • Lafferty, J., McCallum, A., and Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and lab eling sequence data. In Proceedings of ICML 2001.
    • (2001) Proceedings of ICML 2001
    • Lafferty, J.1    McCallum, A.2    Pereira, F.3
  • 8
    • 0000747663 scopus 로고    scopus 로고
    • Maximum entropy markov models for information extraction and segmentation
    • McCallum, A., Freitag, D., and Pereira, F. (2000) Maximum entropy markov models for information extraction and segmentation. In Proceedings of ICML 2000.
    • (2000) Proceedings of ICML 2000
    • McCallum, A.1    Freitag, D.2    Pereira, F.3
  • 12
    • 11144273669 scopus 로고
    • The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain
    • (Reprinted in Neurocomputing (MIT Press, 1998))
    • Rosenblatt, F. 1958. The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain. Psychological Review, 65, 386-408. (Reprinted in Neurocomputing (MIT Press, 1998).)
    • (1958) Psychological Review , vol.65 , pp. 386-408
    • Rosenblatt, F.1


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