On the determinization of weighted finite automata

SIAM Journal on Computing

Volumn 30, Issue 5, 2000, Pages 1502-1531

  Buchsbaum, Adam L ^a   Giancarlo, Raffaele ^b   Westbrook, Jeffery R ^c  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF PALERMO   (Italy)

^c 20th Century Television ^*  (United States)

Author keywords

Algorithms; Rational functions and power series; Speech recognition; Weighted automata

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; FUNCTIONS; POLYNOMIALS; SPEECH RECOGNITION; TOPOLOGY;

DETERMINISTIC EQUIVALENT; POLYNOMIAL TIME ALGORITHM; POWER SERIES; RATIONAL FUNCTIONS; WEIGHTED FINITE AUTOMATA;

FINITE AUTOMATA;

EID: 0035187980     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798346676     Document Type: Article

References (32)

1. R. K. AHUJA, T. L. MAGNANTI, AND J. B. ORLIN, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. J. BERSTEL, Transduction and Context-Free Languages, Leitfäden Angew. Math. Mech., 38, Springer-Verlag, Berlin, 1979.
3. J. BERSTEL AND C. REUTENAUER, Rational Series and Their Languages, EATCS Monographs on Theoretical Computer Science 12, Springer-Verlag, Berlin, 1988.
4. E. BOCCHIERI, G. RICCARDI, AND J. ANANTHARAMAN, The 1994 AT&T ATIS CHRONUS recognizer, in Proceedings of the ARPA Spoken Language Technology Workshop, Austin, TX, Morgan-Kaufmann, 1995, pp. 265-268.
5. A. L. BUCHSBAUM AND R. GIANCARLO, Algorithmic aspects in speech recognition: An introduction, ACM J. Exp. Algorithmics, 2 (1997), http://www.jea.acm.org.
6. A. L. BUCHSBAUM, R. GIANCARLO, AND J. R. WESTBROOK, Shrinking language models by robust approximation, in Proceedings of IEEE Int'l. Conf. on Acoustics, Speech, and Signal Processing '98, Vol. 2, Seattle, WA, 1998, pp. 685-688.
7. To appear in Algorithmica as, "An approximate determinization algorithm for weighted finite-state automata."
8. J. L. CARTER AND M. N. WEGMAN, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp. 143-154.
9. C. CHOFFRUT, Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles, Theoret. Comput. Sci., 5 (1977), pp. 325-337.
10. C. CHOFFRUT, Contributions à l'étude de quelques familles remarquables de function rationnelles, Ph.D. thesis, LITP-Université Paris 7, Paris, France, 1978.
11. K. CULIK II AND J. KARHUMÄKI, Finite automata computing real functions, SIAM J. Comput., 23 (1994), pp. 789-814.
12. K. CULIK II AND P. RAJČÁNI, Iterative weighted finite transactions, Acta Inform., 32 (1995), pp. 681-703.
13. D. DERENCOURT, J. KARHUMÄKI, M. LATTEUX, AND A. TERLUTTE, On computational power of weighted finite automata, Fund. Inform., 25 (1996), pp. 285-293.
14. S. EILENBERG, Automata, Languages, and Machines, Vol. A, Academic Press, San Diego, 1974.
15. J. GOLDSTINE, C. M. R. KINTALA, AND D. WOTSCHKE, On measuring nondeterminism in regular languages, Inform. and Comput., 86 (1990), pp. 179-194.
16. J. GOLDSTINE, H. LEUNG, AND D. WOTSCHKE, On the relation between ambiguity and nondetermism in finite automata, Inform. and Comput., 100 (1992), pp. 261-270.
17. L. GROVE, Algebra, Academic Press, New York, 1983.
18. J. KARI AND P. FRÄNTI, Arithmetic coding of weighted finite automata, RAIRO Inform. Théor. Appl., 28 (1994), pp. 343-360.
19. C. M. R. KINTALA AND D. WOTSCHKE, Amounts of nondeterminism infinite automata, Acta Inform., 13 (1980), pp. 199-204.
20. W. KUICH AND A. SALOMAA, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science 5, Springer-Verlag, Berlin, 1986.
21. M. MOHRI, Finite-state transducers in language and speech processing, Comput. Linguist., 23 (1997), pp. 269-311.
22. M. MOHRI, On the use of sequential transducers in natural language processing, in Finite-State Language Processing, MIT Press, Cambridge, MA, 1997, pp. 355-382.
23. M. MOHRI, Minimization algorithms for sequential transducers, Theoret. Comput. Sci., 234 (2000), pp. 177-201.
24. F. PEREIRA AND M. RILEY, Speech recognition by composition of weighted finite automata, in Finite-State Language Processing, MIT Press, Cambridege, MA, 1997, pp. 431-453.
25. F. PEREIRA, M. RILEY, AND R. SPROAT, Weighted rational transductions and their application to human language processing, in Proceedings of ARPA Human Language Technology Conference, San Francisco, CA, Morgan-Kaufmann, 1994, pp. 249-254.
26. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry: An Introduction, Texts and Monographs in Computer Science, Springer-Verlag, New York, 1988.
27. M. O. RABIN, Probabilistic automata, Inform. and Control (Shenyang), 6 (1963), pp. 230-245.
28. M. D. RILEY, A. LJOLJE, D. HINDLE, AND F. C. N. PEREIRA, The AT&T 60,000 word speech-to-text system, in Proceedings of the 4th Euro. Conf. on Speech Communication and Technology, Vol. 1, Madrid, Spain, European Speech Communication Association (ESCA), 1995, pp. 207-210.
29. E. ROCHE, Analyse Syntaxique Transformationelle du Francais par Transducteurs et Lexique-Grammaire, Ph.D. thesis, LITP-Université Paris 7, Paris, France, 1993.
30. A. SALOMAA AND M. SOITTOLA, Automata-Theoretic Aspects of Formal Power Series, Springer-Verlag, Berlin, 1978.
31. M. SILBERZTEIN, Dictionnaires électroniques et analise automatique de textes: le système INTEX, Ph.D. thesis, Masson, Paris, France, 1993.
32. A. WEBER AND R. KLEMM, Economy of description for single-valued transducers, Inform. and Comput., 118 (1995), pp. 327-340.