메뉴 건너뛰기




Volumn 1891, Issue , 2000, Pages 196-206

Combination of estimation algorithms and grammatical inference techniques to learn stochastic context-free grammars

Author keywords

[No Author keywords available]

Indexed keywords

INFERENCE ENGINES; STOCHASTIC SYSTEMS;

EID: 84974695815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45257-7_16     Document Type: Conference Paper
Times cited : (3)

References (16)
  • 1
    • 72249114653 scopus 로고    scopus 로고
    • Learning of stochastic context-free grammars from bracketed corpora by means of reestimation algorithms
    • M.I. Torres and A. Sanfeliu, editors, Bilbao, Espana, May, AERFAI
    • F. Amaya, J.M. Benedí, and J.A. Sánchez. Learning of stochastic context-free grammars from bracketed corpora by means of reestimation algorithms. In M.I. Torres and A. Sanfeliu, editors, Proc. VIII Spanish Symposium on Pattern Recognition and Image Analysis, pages 119-126, Bilbao, Espana, May 1999. AERFAI.
    • (1999) Proc. VIII Spanish Symposium on Pattern Recognition and Image Analysis , pp. 119-126
    • Amaya, F.1    Benedí, J.M.2    Sánchez, J.A.3
  • 2
    • 0001862769 scopus 로고
    • An inequality and associated maximization technique in statistical estimation for probabilistic functions of markov processes
    • L.E. Baum. An inequality and associated maximization technique in statistical estimation for probabilistic functions of markov processes. Inequalities, 3:1-8, 1972.
    • (1972) Inequalities , vol.3 , pp. 1-8
    • Baum, L.E.1
  • 5
    • 84930565154 scopus 로고
    • Computation of the probability of initial substring generation by stochastic context-free grammars
    • F. Jelinek and J.D. Lafferty. Computation of the probability of initial substring generation by stochastic context-free grammars. Computational Linguistics, 17(3):315-323, 1991.
    • (1991) Computational Linguistics , vol.17 , Issue.3 , pp. 315-323
    • Jelinek, F.1    Lafferty, J.D.2
  • 6
    • 0002532056 scopus 로고
    • The estimation of stochastic context-free grammars using the inside-outside algorithm
    • K. Lari and S.J. Young. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer, Speech and Language, 4:35-56, 1990.
    • (1990) Computer, Speech and Language , vol.4 , pp. 35-56
    • Lari, K.1    Young, S.J.2
  • 7
    • 0026846105 scopus 로고
    • On the structural grammatical inference problem for some classes of context-free grammars
    • April
    • E. Mäkinen. On the structural grammatical inference problem for some classes of context-free grammars. Information Processing Letters, April (42):1-5, 1992.
    • (1992) Information Processing Letters , Issue.42 , pp. 1-5
    • Mäkinen, E.1
  • 8
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • M.P. Marcus, B. Santorini, and M.A. Marcinkiewicz. Building a large annotated corpus of english: the penn treebank. Computational Linguistics, 19(2):313-330, 1993.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Marcinkiewicz, M.A.3
  • 9
    • 0012077631 scopus 로고
    • Stochastic grammars and pattern recognition
    • P. Laface and R. De Mori, editors, Springer-Verlag
    • H. Ney. Stochastic grammars and pattern recognition. In P. Laface and R. De Mori, editors, Speech Recognition and Understanding. Recent Advances, pages 319-344. Springer-Verlag, 1992.
    • (1992) Speech Recognition and Understanding. Recent Advances , pp. 319-344
    • Ney, H.1
  • 11
    • 0039078228 scopus 로고    scopus 로고
    • The cmu statistical language modeling toolkit and its use in the 1994 arpa csr evaluation
    • Austin, Texas, USA
    • R. Rosenfeld. The cmu statistical language modeling toolkit and its use in the 1994 arpa csr evaluation. In ARPA Spoken Language Technology Workshop, Austin, Texas, USA, 1995.
    • ARPA Spoken Language Technology Workshop , pp. 1995
    • Rosenfeld, R.1
  • 12
    • 0026839284 scopus 로고
    • Efficient learning of context-free grammars from positive structural examples
    • Y. Sakakibara. Efficient learning of context-free grammars from positive structural examples. Information and Computation, 97:23-60, 1992.
    • (1992) Information and Computation , vol.97 , pp. 23-60
    • Sakakibara, Y.1
  • 13
    • 0031237601 scopus 로고    scopus 로고
    • Consistency of stochastic context-free grammmars from probabilistic estimation based on growth transformation
    • J.A. Sánchez and J.M. Benedí. Consistency of stochastic context-free grammmars from probabilistic estimation based on growth transformation. IEEE Trans. Pattern Analysis and Machine Intelligence, 19(9):1052-1055, 1997.
    • (1997) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.19 , Issue.9 , pp. 1052-1055
    • Sánchez, J.A.1    Benedí, J.M.2
  • 14
    • 16344385165 scopus 로고    scopus 로고
    • Estimation of the probability distributions of stochastic context-free grammars from the k-best derivations
    • Sidney, Australia
    • J.A. Sánchez and J.M. Benedí.. Estimation of the probability distributions of stochastic context-free grammars from the k-best derivations In In 5th International Conference on Spoken Language Processing, pages 2495-2498, Sidney, Australia, 1998.
    • (1998) International Conference on Spoken Language Processing , pp. 2495-2498
    • Sánchez, J.A.1    Benedí, J.M.2
  • 15
    • 0005930884 scopus 로고    scopus 로고
    • Learning of stochastic context-free grammars by means of estimation algorithms
    • Budapest, Hungary
    • J.A. Sánchez and J.M. Benedí. Learning of stochastic context-free grammars by means of estimation algorithms. In Proc. EUROSPEECH’99, volume 4, pages 1799-1802, Budapest, Hungary, 1999.
    • (1999) Proc. EUROSPEECH’99 , vol.4 , pp. 1799-1802
    • Sánchez, J.A.1    Benedí, J.M.2
  • 16
    • 84958530602 scopus 로고    scopus 로고
    • Comparison between the inside- outside algorithm and the viterbi algorithm for stochastic context-free grammars
    • P. Perner, P. Wang, and A. Rosenfeld, editors, Springer-Verlag
    • J.A. Sánchez, J.M. Benedl, and F. Casacuberta. Comparison between the inside- outside algorithm and the viterbi algorithm for stochastic context-free grammars. In P. Perner, P. Wang, and A. Rosenfeld, editors, Advances in Structural and Syntactical Pattern Recognition, pages 50-59. Springer-Verlag, 1996.
    • (1996) Advances in Structural and Syntactical Pattern Recognition , pp. 50-59
    • Sánchez, J.A.1    Benedl, J.M.2    Casacuberta, F.3


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