Simpler and more general minimization for weighted finite-state automata

Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, HLT-NAACL 2003

Volumn , Issue , 2003, Pages

  Eisner, Jason ^a  

^a Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS;

FINITE-STATE AUTOMATA; MINIMAL AUTOMATON; MINIMISATION; MINIMIZATION ALGORITHMS; NP COMPLETE; NUMBER OF STATE; SEMI-RING; SIMPLE++; THEORETICAL LIMITS;

AUTOMATA THEORY;

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

References (10)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley.
2. Jean Berstel and Christophe Reutenauer. 1988. Rational Series and their Languages. Springer-Verlag.
3. Dany Breslauer. 1996. The suffix tree of a tree and minimizing sequential transducers. Lecture Notes in Computer Science, 1075.
4. A. H. Clifford and G. B. Preston. 1967. The Algebraic Theory of Semigroups.
5. Corinna Cortes, Patrick Haffner, and Mehryar Mohri. 2002. Rational kernels. In Proceedings of NIPS, December.
6. Pierluigi Crescenzi and Viggo Kann. 1998. How to find the best approximation results—a follow-up to Garey and Johnson. ACM SIGACT News, 29(4):90–97, December.
7. Jason Eisner. 2002. Parameter estimation for probabilistic finite-state transducers. In Proc. of ACL, Philadelphia, July.
8. John Lafferty, Andrew McCallum, and Fernando Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the International Conference on Machine Learning.
9. Mehryar Mohri. 1997. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2).
10. Mehryar Mohri. 2000. Minimization algorithms for sequential transducers. Theoretical Computer Science, 324:177–201.