Estimation of Probabilistic Context-Free Grammars
暂无分享,去创建一个
[1] Ulf Grenander. Lectures in pattern theory - Volume 1: Pattern synthesis , 1976 .
[2] Joan-Andreu Sánchez,et al. Consistency of Stochastic Context-Free Grammars From Probabilistic Estimation Based on Growth Transformations , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[3] C. S. Wetherell,et al. Probabilistic Languages: A Review and Some Open Questions , 1980, CSUR.
[4] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[5] J. Baker. Trainable grammars for speech recognition , 1979 .
[6] Andreas Stolcke,et al. An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities , 1994, CL.
[7] L. Baum,et al. An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process , 1972 .
[8] Taylor L. Booth,et al. Applying Probability Measures to Abstract Languages , 1973, IEEE Transactions on Computers.
[9] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[10] T. E. Harris,et al. The Theory of Branching Processes. , 1963 .