Transducer Composition for Context-Dependent Network Expansion

5th European Conference on Speech Communication and Technology, EUROSPEECH 1997

Volumn , Issue , 1997, Pages 1427-1430

  Riley, Michael ^a   Pereira, Fernando ^a   Mohri, Mehryar ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SPEECH COMMUNICATION; TRANSDUCERS;

AUTOMATIC MODELING; CONTEXT DEPENDENCY; CONTEXT DEPENDENT; CONTEXT DEPENDENT MODELING; DEPENDENCY CONSTRAINTS; HIGH-ACCURACY; LEVEL MODEL; LOST OPPORTUNITIES; MODEL OPTIMIZATION; NETWORK EXPANSION;

SPEECH RECOGNITION;

EID: 0002247642     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. L. Bahl, F. Jelinek, and R. Mercer. A maximum likelihood approach to continuous speech recognition. IEEE Trans. PAMI, 5(2):179-190, Mar. 1983.
2. J. Berstel. Transductions and Context-Free Languages. Teubner Studienbucher, Stuttgart, Germany, 1979.
3. J. Berstel and C. Reutenauer. Rational Series and Their Languages. Springer-Verlag, Berlin, Germany, 1988.
4. E. Burhke, W. Chou, and Q. Zhou. A wave decoder for continuous speech recognition. In Proceedings of ICSLP, Philadelphia, Pennsylvania, 1996.
5. C. Choffrut. Contributions a l' étude de quelques familles remarquables de fonctions rationnelles. These de doctorat d' etat, LITP, Université Paris 7, Paris, France, 1978.
6. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages,and Computation. Addison Wesley, Reading, Massachusetts, 1979.
7. R. Kaplan and M. Kay. Regular models of phonological rule systems. Computational Linguistics, 3(20):331-378, 1994.
8. W. Kuich and A. Salomaa. Semirings, Automata, Languages. Springer-Verlag, Berlin, Germany, 1986.
9. K.-F. Lee. Context dependent phonetic hidden Markov models for continuous speech recognition. IEEE Trans. ASSP, 38(4):599-609, Apr. 1990.
10. M. Mohri. Finite-state transducers in language and speech processing. ComputationalLinguistics, 23, 1997.
11. M. Mohri. Minimization algorithms for sequential transducers. Theoretical Computer Science, 1997. To appear.
12. M. Mohri, F. Pereira, and M. Riley. Weighted automata in text and speech processing. In ECAI-96 Workshop, Budapest, Hungary, 1996.
13. M. Mohri and M. Riley. Weighted determinization and minimization for large vocabulary speech recognition. In Eurospeech'97, Rhodes, Greece, 1997.
14. M. Mohri and R. Sproat. An efficient compiler for weighted rewrite rules. In 34th Annual Meeting of the ACL, 1996. Distributed by Morgan Kaufmann, San Francisco.
15. J. Odell, V. Valtchev, P. Woodland, and S. Young. A one pass decoder design for large vocabulary recognition. In ARPA Human LanguageTechnologyWorkshop,1994. Distributed by Morgan Kaufmann, San Francisco.
16. F. Pereira and M. Riley. Speech recognition by composition of weighted finite automata. In E. Roche and Y. Schabes, editors, Finite-State Devices for Natural Language Processing. MIT Press, Cambridge, Massachusetts, 1997. Forthcoming.
17. G. Riccardi, E. Bocchieri, and R. Pieraccini. Non-deterministic stochastic language models for speech recognition. In Proc. ICASSP, volume 1, pages 237-240. IEEE, 1995.
18. R. Sproat and M. Riley. Compilation of weighted finite-state transducers from decision trees. In 34th Annual Meeting of ACL, 1996. Distributed by Morgan Kaufmann, San Francisco.
19. S. Young, J. Odell, and P. Woodland. Tree-based state-tying for high accuracy acoustic modelling. In ARPA Human Language Technology Workshop, 1994. Distributed by Morgan Kaufmann, San Francisco.