Lari, K and Young, SJ (1990) The estimation of stochastic context-free grammars using the Inside-Outside algorithm. Computer Speech and Language, 4. pp. 35-56. ISSN 0885-2308Full text not available from this repository.
Using an entropy argument, it is shown that stochastic context-free grammars (SCFG's) can model sources with hidden branching processes more efficiently than stochastic regular grammars (or equivalently HMM's). However, the automatic estimation of SCFG's using the Inside-Outside algorithm is limited in practice by its O(n3) complexity. In this paper, a novel pre-training algorithm is described which can give significant computational savings. Also, the need for controlling the way that non-terminals are allocated to hidden processes is discussed and a solution is presented in the form of a grammar minimization procedure. © 1990.
|Divisions:||Div F > Machine Intelligence|
|Depositing User:||Unnamed user with email email@example.com|
|Date Deposited:||18 May 2016 17:49|
|Last Modified:||25 May 2016 22:11|