메뉴 건너뛰기




Volumn , Issue , 2004, Pages

discriminative hidden Markov modeling with long state dependence using a kNN ensemble

Author keywords

[No Author keywords available]

Indexed keywords

BASED MODELLING; CONTEXT INDEPENDENT; DISCRIMINATIVE HIDDEN MARKOV MODELS; MODELING APPROACH; MUTUAL INFORMATIONS; PROBABILITY ESTIMATOR; SEQUENTIAL DATA; STATE DEPENDENCE; STATE-TRANSITION MODEL; VARIABLE LENGTH;

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

References (24)
  • 8
    • 0001882615 scopus 로고
    • Self-Organized Language Modeling for Speech Recognition
    • Alex Waibel and Kai-Fu Lee(Editors). Morgan Kaufmann
    • Jelinek F. (1989). Self-Organized Language Modeling for Speech Recognition. In Alex Waibel and Kai-Fu Lee(Editors). Readings in Speech Recognitiopn. Morgan Kaufmann. 450-506.
    • (1989) Readings in Speech Recognitiopn , pp. 450-506
    • Jelinek, F.1
  • 9
    • 0023312404 scopus 로고
    • Estimation of Probabilities from Sparse Data for the Language Model Component of a Speech Recognizer
    • Katz S.M. (1987). Estimation of Probabilities from Sparse Data for the Language Model Component of a Speech Recognizer. IEEE Transactions on Acoustics. Speech and Signal Processing. 35: 400-401.
    • (1987) IEEE Transactions on Acoustics. Speech and Signal Processing , vol.35 , pp. 400-401
    • Katz, S.M.1
  • 10
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: probabilistic models for segmenting and labeling sequence data
    • Lafferty J. McCallum A and Pereira F. (2001). Conditional random fields: probabilistic models for segmenting and labeling sequence data. ICML-20.
    • (2001) ICML-20
    • Lafferty, J.1    McCallum, A2    Pereira, F.3
  • 11
    • 34249852033 scopus 로고
    • Buliding a large annotated corpus of English: The Penn Treebank
    • Marcus M., Santorini B. & Marcinkiewicz M.A. (1993). Buliding 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.A.3
  • 12
    • 0000747663 scopus 로고    scopus 로고
    • Maximum entropy Markov models for information extraction and segmentation
    • Stanford, California
    • McCallum A. Freitag D. and Pereira F. 2000. Maximum entropy Markov models for information extraction and segmentation. ICML-19. 591-598. Stanford, California.
    • (2000) ICML-19 , pp. 591-598
    • McCallum, A.1    Freitag, D.2    Pereira, F.3
  • 13
    • 84867119745 scopus 로고
    • Tagging English Text with a Probabilistic Model
    • Merialdo B. (1994). Tagging English Text with a Probabilistic Model. Computational Linguistics. 20(2): 155-171.
    • (1994) Computational Linguistics , vol.20 , Issue.2 , pp. 155-171
    • Merialdo, B.1
  • 15
    • 0024610919 scopus 로고
    • A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition
    • Rabiner L.R. (1989). A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition”. Proceedings of the IEEE, 77(2): 257-286.
    • (1989) Proceedings of the IEEE , vol.77 , Issue.2 , pp. 257-286
    • Rabiner, L.R.1
  • 16
    • 0032660854 scopus 로고    scopus 로고
    • Learning to parsing natural language with maximum entropy models
    • Ratnaparkhi A. 1999. Learning to parsing natural language with maximum entropy models. Machine Learning. 34:151-175.
    • (1999) Machine Learning , vol.34 , pp. 151-175
    • Ratnaparkhi, A.1
  • 21
    • 84935113569 scopus 로고
    • Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm
    • Viterbi A.J. (1967). Error Bounds for Convolutional Codes and an Asymptotically Optimum 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가 분석하여 추출한 것입니다.