1. Abney, S., McAllester, D., & Pereira, F. (1999). Relating probabilistic grammars and automata. In 37th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Maryland, USA, pp. 542–549.
2. Baker, J. (1979). Trainable grammars for speech recognition. In J. Wolf & D. Klatt (Eds.), Speech Communication Papers Presented at the 97th Meeting of the Acoustical Society of America, pp. 547–550.
3. Bar-Hillel Y., Perles M., Shamir E. (1964) On formal properties of simple phrase structure grammars. In: Bar-Hillel Y.(eds) Language and information: Selected essays on their theory and application(Chap 9). Addison-Wesley, Reading Massachusetts, pp 116–150
4. Chi Z. (1999) Statistical properties of probabilistic context-free grammars. Computational Linguistics, 25(1): 131–160
5. Chi Z., Geman S. (1998) Estimation of probabilistic context-free grammars. Computational Linguistics, 24(2): 299–305