Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Abe, N., Warmuth, M.K.: On the computational complexity of approximating distributions by probabilistic automata. Machine Learning 9, 205–260 (1992)
2. Baum, L.E., Petrie, T.: Statistical inference for probabilistic functions of finite state markov chains. Annals of Mathematical Statistics 37, 1559–1663 (1966)
3. LNAI;R.C. Carrasco,1994
4. Clark, A.: Memory-based learning of morphology with stochastic transducers. In: Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), pp. 513–520 (2002)
5. Clark, A.: Learning deterministic context free grammars in the Omphalos competition. Machine Learning (to appear, 2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献