1. Baldi, P., Chauvin, Y.: Smooth On-Line Learning Algorithms for Hidden Markov Models. Neural Computation 6(2), 307–318 (1994)
2. Bangalore, S., Joshi, A.: Supertagging: An approach to almost parsing. Computational Linguistics 25(2), 237–266 (1999)
3. Bangalore, S., Haffner, P., Emami, G.: Factoring global inference by enriching local representations. Technical report, AT&T Labs – Reserach (2005)
4. Bangalore, S., Boulllier, P., Nasr, A., Rambow, O., Sagot, B.: MICA: A probabilistic dependency parser based on Tree Insertion Grammar. In: North American Chapter of the Association for Computational Linguistics, NAACL (2009)
5. Baum, L.E.: An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes. In: Shisha, O. (ed.) Inequalities III: Proceedings of the Third Symposium on Inequalities, University of California, Los Angeles, pp. 1–8. Academic Press, London (1972)