The estimation of stochastic context-free grammars using the Inside-Outside algorithm

Computer Speech and Language

Volumn 4, Issue 1, 1990, Pages 35-56

  Lari, K ^a   Young, S J ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002532056     PISSN: 08852308     EISSN: 10958363     Source Type: Journal    
DOI: 10.1016/0885-2308(90)90022-X     Document Type: Article

References (25)

1. Statistical inference about Markov chains
2. A maximum likelihood approach to continuous speech recognition
3. Trainable grammars for speech recognition
4. Applying probability measures to abstract languages
5. Three models for the description of languages
6. On certain formal properties of grammars
7. Grammatical inference for automatic speech recognition: an application of the Inside/Outside algorithm and the spelling of English words
8. Markov source modeling of text generation
9. Digital filtering using logarithmic arithmetic
10. Specification for T-Rack
11. Continuous speech recognition results of the BYBLOS system on the DARPA 1000-word resource management database
12. On the entropy of context-free languages
13. Large-vocabulary speaker-independent continuous speech recognition using HMM
14. An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition
15. Structural methods in automatic speech recognition
16. The role of phonological rules in speech understanding research
17. Branching processes with terminal types applications to context-free grammars
18. Theory of branching processes
19. A mathematical theory of communication
20. Prediction and entropy of printed English
21. Entropies of probabilistic grammars
22. Linguistic modelling for application in speech recognition