메뉴 건너뛰기




Volumn , Issue , 2010, Pages 582-590

Painless unsupervised learning with features

Author keywords

[No Author keywords available]

Indexed keywords

DISCRIMINATIVE TRAINING; EM ALGORITHMS; GENERATIVE MODEL; GRADIENT BASED; GRAMMAR INDUCTION; LOGISTIC REGRESSION MODELS; MULTINOMIALS; PART OF SPEECH; TRAINING METHODS; WORD ALIGNMENT; WORD SEGMENTATION;

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

References (31)
  • 6
    • 85009227369 scopus 로고    scopus 로고
    • Conditional and joint models for grapheme-to-phoneme conversion
    • S. F. Chen. 2003. Conditional and joint models for grapheme-to-phoneme conversion. In Eurospeech.
    • (2003) Eurospeech
    • Chen, S.F.1
  • 18
    • 34547991476 scopus 로고    scopus 로고
    • Corpus-based induction of syntactic structure: Models of dependency and constituency
    • D. Klein and C. D. Manning. 2004. Corpus-based induction of syntactic structure: Models of dependency and constituency. In Association for Computational Linguistics.
    • (2004) Association for Computational Linguistics
    • Klein, D.1    Manning, C.D.2
  • 21
    • 33646887390 scopus 로고
    • On the limited memory BFGS method for large scale optimization
    • D. C. Liu, J. Nocedal, and C. Dong. 1989. On the limited memory BFGS method for large scale optimization. Mathematical Programming.
    • (1989) Mathematical Programming
    • Liu, D.C.1    Nocedal, J.2    Dong, C.3
  • 23
    • 84867119745 scopus 로고
    • Tagging English text with a probabilistic model
    • B. Merialdo. 1994. Tagging English text with a probabilistic model. Computational Linguistics.
    • (1994) Computational Linguistics
    • Merialdo, B.1
  • 24
    • 0002788893 scopus 로고    scopus 로고
    • A view of the EM algorithm that justifies incremental, sparse, and other variants
    • Kluwer Academic Publishers
    • R. Neal and G. E. Hinton. 1998. A view of the EM algorithm that justifies incremental, sparse, and other variants. In Learning in Graphical Models. Kluwer Academic Publishers.
    • (1998) Learning in Graphical Models
    • Neal, R.1    Hinton, G.E.2
  • 29
    • 37249024089 scopus 로고    scopus 로고
    • Weighted and probabilistic context-free grammars are equally expressive
    • N. A. Smith and M. Johnson. 2007. Weighted and probabilistic context-free grammars are equally expressive. Computational Linguistics.
    • (2007) Computational Linguistics
    • Smith, N.A.1    Johnson, M.2


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