Abstract
In this paper, we define a class of transducers closed under intersection and complementation, which are the operations used for contextual rule compilation. This class of transducers is not theoretically more powerful than the Epsilon-Free Letter Transducers most commonly used. But they are more convenient for morphological description whenever the correspondence between lexical and surface forms is not a symbol-to-symbol matching.
A complete set of operations on transducers is defined, including some operations (projection and join) which change the number of tapes of the transducers.
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
Ganchev, H., Mihov, S., Schulz, K.U.: One-letter automata: How to reduce k tapes to one. Technical Report IS-Bericht-03-133, Centrum für Informations- und Sprachverarbeitung, Universität München, Munich (Germany) (2003)
Grimley-Evans, E., Kiraz, G., Pulman, S.: Compiling a partition-based two-level formalism. In: COLING, Copenhagen, Denmark, pp. 454–459 (1996)
Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)
Kempe, A., Guingne, F., Nicart, F.: Algorithms for weighted multi-tape automata. Technical Report 2004/031, XRCE, Grenoble, France (2004)
Roche, E., Schabes, Y. (eds.): Finite-State Language Processing. Bradford Book. MIT Press, Cambridge (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barthélemy, F. (2006). Partitioning Multitape Transducers. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds) Finite-State Methods and Natural Language Processing. FSMNLP 2005. Lecture Notes in Computer Science(), vol 4002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780885_3
Download citation
DOI: https://doi.org/10.1007/11780885_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35467-3
Online ISBN: 978-3-540-35469-7
eBook Packages: Computer ScienceComputer Science (R0)