Abstract
We present a new disambiguation algorithm for finite automata and functional finite-state transducers. We give a full description of the algorithm, including a detailed pseudocode and analysis, and several illustrating examples. Our algorithm is often more efficient and the result dramatically smaller than the one obtained using determinization for finite automata or an existing disambiguation algorithm for transducers based on a construction of Schützenberger. In a variety of cases, the size of the unambiguous transducer returned by our algorithm is only linear in that of the input transducer while the transducer given by the construction of Schützenberger is exponentially larger. Our algorithm can be used effectively in many applications to make automata and transducers more efficient to use.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, J., Kari, J.: Digital image compression. In: Handbook of Weighted Automata. Springer (2009)
Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. Journal of Automata, Languages and Combinatorics 8(2), 117–144 (2003)
Allauzen, C., Mohri, M.: Finitely subsequential transducers. International Journal of Foundations of Computer Science 14(6), 983–994 (2003)
Allauzen, C., Mohri, M., Rastogi, A.: General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers. Int. J. Found. Comput. Sci. 22(4), 883–904 (2011)
Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbucher (1979)
Breuel, T.M.: The OCRopus open source OCR system. In: Proceedings of IS&T/SPIE 20th Annual Symposium (2008)
Choffrut, C.: Contributions à l’étude de quelques familles remarquables de fonctions rationnelles. Ph.D. thesis, Université Paris 7, LITP: Paris, France (1978)
Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.J.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press (1998)
Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press (1974)
Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3) (1994)
Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269–311 (1997)
Mohri, M.: Weighted automata algorithms. In: Handbook of Weighted Automata, pp. 213–254. Springer (2009)
Mohri, M., Pereira, F.C.N., Riley, M.: Speech recognition with weighted finite-state transducers. In: Handbook on Speech Processing and Speech Communication. Springer (2008)
Roche, E., Schabes, Y. (eds.): Finite-State Language Processing. MIT Press (1997)
Sakarovitch, J.: A construction on finite automata that has remained hidden. Theor. Comput. Sci. 204(1-2), 205–231 (1998)
Schützenberger, M.P.: Sur les relations rationnelles entre monoides libres. Theor. Comput. Sci. 3(2), 243–259 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohri, M. (2012). A Disambiguation Algorithm for Finite Automata and Functional Transducers. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-31606-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31605-0
Online ISBN: 978-3-642-31606-7
eBook Packages: Computer ScienceComputer Science (R0)