메뉴 건너뛰기




Volumn , Issue , 2004, Pages

Part of speech tagging in context

Author keywords

[No Author keywords available]

Indexed keywords

COMPREHENSIVE COMPARISONS; HMM TRAINING; IN CONTEXTS; LEXICAL PROBABILITY; PART OF SPEECH TAGGING; PARTS-OF-SPEECH TAGGING; STATE OF THE ART; UNSUPERVISED METHOD;

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

References (16)
  • 2
    • 0000353178 scopus 로고    scopus 로고
    • A maximization technique in the statistical analysis of probabilistic functions of Markov chains
    • L.E. Baum, T. Petrie, G. Soules, and N. Weiss. A maximization technique in the statistical analysis of probabilistic functions of Markov chains. Annals of Mathematical Statistics, 41:164-171.
    • Annals of Mathematical Statistics , vol.41 , pp. 164-171
    • Baum, L.E.1    Petrie, T.2    Soules, G.3    Weiss, N.4
  • 4
    • 0006807318 scopus 로고
    • Unsupervised learning of disambiguation rules for part of speech tagging
    • Cambridge, MA
    • E. Brill. 1995. Unsupervised learning of disambiguation rules for part of speech tagging. In Proceedings of the Third Workshop on Very Large Corpora, Cambridge, MA.
    • (1995) Proceedings of the Third Workshop on Very Large Corpora
    • Brill, E.1
  • 6
    • 85127836544 scopus 로고    scopus 로고
    • Discriminative training methods for hidden Markov models: theory and experiments with perceptron algorithms
    • Philadelphia, PA
    • M. Collins. 2002. Discriminative training methods for hidden Markov models: theory and experiments with perceptron algorithms. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, Philadelphia, PA.
    • (2002) Proceedings of the Conference on Empirical Methods in Natural Language Processing
    • Collins, M.1
  • 9
    • 0026890725 scopus 로고
    • Robust part-of-speech tagging using a hidden Markov model
    • J. Kupiec. 1992. Robust part-of-speech tagging using a hidden Markov model. Computer Speech and Language 6.
    • (1992) Computer Speech and Language , vol.6
    • Kupiec, J.1
  • 10
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and labeling sequence data
    • J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML-01, pages 282-289.
    • (2001) Proceedings of ICML-01 , pp. 282-289
    • Lafferty, J.1    McCallum, A.2    Pereira, F.3
  • 11
    • 0026374882 scopus 로고
    • Tagging English text with a probabilistic model
    • Toronto
    • B. Merialdo. 1991. Tagging English text with a probabilistic model. In Proceedings of ICASSP. Toronto, pp. 809-812.
    • (1991) Proceedings of ICASSP , pp. 809-812
    • Merialdo, B.1
  • 12
    • 0027929445 scopus 로고
    • On structuring probabilistic dependencies in stochastic language modeling
    • H. Ney, U. Essen and R. Kneser. 1994. On structuring probabilistic dependencies in stochastic language modeling. Computer, Speech and Language, 8:1-38.
    • (1994) Computer, Speech and Language , vol.8 , pp. 1-38
    • Ney, H.1    Essen, U.2    Kneser, R.3
  • 14
    • 84983470508 scopus 로고    scopus 로고
    • Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network
    • K. Toutanova, D. Klein, C. Manning, and Y. Singer. 2003. Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network. In Proceedings of HLT-NAACL. pp. 252-259.
    • (2003) Proceedings of HLT-NAACL , pp. 252-259
    • Toutanova, K.1    Klein, D.2    Manning, C.3    Singer, Y.4
  • 15
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymptotically optimal decoding algorithm
    • A.J. Viterbi. 1967. Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Transactions on Information Theory, 13:260-269.
    • (1967) IEEE Transactions on Information Theory , vol.13 , pp. 260-269
    • Viterbi, A.J.1


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