Abstract
In this paper, a subclass of rational relations is defined for which there is not only a global correspondence between strings of a given tuple, but also a structured correspondence between substrings. This structure is denoted in strings using postfixed inner-node markers. These relations are closed under rational operations. Some additional conditions are defined to obtain also a closure under intersection. This approach is interesting for applications where several level of analysis are relevant. An example in Natural Language Processing is given.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Koskenniemi, K.: Two-level morphology: a general computational model for word-form recognition and production. Technical Report 11, Department of General Linguistics, University of Helsinki (1983)
Sproat, R.: Morphology and Computation. The MIT Press, Cambridge, Massachusetts (1992)
Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM journal of Research and Development 9, 47–68 (1965)
Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theoretical Computer Science 108, 45–82 (1993)
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997) release (September 6, 2005) Available on http://www.grappa.univ-lille3.fr/tata
Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)
Yli-Jyrä, A.M., Koskenniemi, K.: Compiling contextual restrictions on strings into finite-state automata. In: Proceedings of the Eindhoven FASTAR Days 2004, Eindhoven, The Netherlands (September 3–4, 2004)
Mohri, M., Pereira, F.C.N., Riley, M.: Weighted finite-state transducers in speech recognition. Computer Speech and Language 16, 69–88 (2002)
Sakarovitch, J.: Éléments de theorie des automates. Éditions Vuibert (Paris, France) (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barthélemy, F. (2007). Multi-grain Relations. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-76336-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76335-2
Online ISBN: 978-3-540-76336-9
eBook Packages: Computer ScienceComputer Science (R0)