Abstract
Rational functions have many applications in natural language processing. Specifying them can be difficult since many of the techniques over-generalize and incorrect transformations need to be removed or avoided. Uniformization is the process of restricting a rational relation to make it single-valued while preserving its domain. One way of doing this is to use weighted determinization with an appropriate semiring to produce a subsequential transducer when this is possible. A basic algorithm using the genealogical minimum as the selection process is discussed with a motivating example.
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
Abdali, S.K., Saunders, B.D.: Transitive closure and related semiring properties via eliminants. Theoretical Computer Science 40, 257–274 (1985)
Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications, Stanford (2003), http://www.fsmbook.com
Berstel, J.: Transductions and context-free languages. Teubner, Stuttgart (1979)
Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, London (1971)
Johnson, J.H.: INR—a program for computing finite state automata. INR manual (1988), http://ginr.org
Johnson, J.H.: A unified framework for disambiguating finite transductions. Theoretical Computer Science 63, 91–111 (1989)
Lehmann, D.J.: Algebraic structures for transitive closure. Theoretical Computer Science 4(1), 59–76 (1977)
Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269–312 (1997)
Mohri, M.: Generic ε-removal algorithm for weighted automata. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 230–242. Springer, Heidelberg (2001)
Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theoretical Computer Science 231(1), 17–32 (2000)
Mohri, M.: Generic ε-removal and input ε-normalization algorithms for weighted transducers. International Journal of Foundations of Computer Science (2002)
Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, ch. 6, pp. 213–254. Springer, Berlin (2009)
Sakarovitch, J.: Elements of automata theory. Cambridge University Press, Cambridge (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Howard Johnson, J. (2011). Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-18098-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18097-2
Online ISBN: 978-3-642-18098-9
eBook Packages: Computer ScienceComputer Science (R0)