Abstract
The algorithm that we present here is an adaptation of the automata pseudo- minimization algorithm for finite-state transducer. After giving some definitions, we give an algorithm to build a pseudominimal transducer, that has an interesting property: each recognized word has a proper element.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Church K. W. (1983) “A finite-State Parser for Use in Speech Recognition”, Proceedings of the 21st International Conference on Computational Linguistics.
Courtois B. (1992): Dictionnaire électronique des mots simples du français DELAS V07-E2, Research report ną33 of LADL, University of Paris VII.
Gross M., Perrin D.(1989): “Electronic Dictionnaries and Automata in Computationnal Linguistics”, Lecture Notes in Computer Science, 377, Springer.
Hopcroft & Ullman (1979): Introduction to Automata Theory, Languages, and Computation.
Kaplan R. M., Kay M. (1994) “Regular Models of Phonological Rule systems”, Computational Linguistics 20.
Karttunen L., Kaplan R. M., and Zaenen A. (1992): Two-level Morphology with Composition, Proceedings of the 15th International Conference on Computational Linguistics.
Laporte E. (1988): Méthodes algorithmiques et lexicales de phonétization de textes: applications au français, Doctoral dissertation (University of Paris 7), Paris.
Maurel D. (1997): “Building automaton on Schemata and Acceptability Tables”, Lecture Notes in Computer Science, vol. 1260, 72–86.
Maurel D., Belleil C., Eggert E., Piton O. (1996): “Le projet PROLEX', séminaire Représentations et Outils pour les Bases Lexicales, Morphologie Robuste de l'action Lexique du GDR-PRC CHM, Grenoble.
Maurel D., Mohri M. (1994): “French Temporal Expressions: Recognition, Parsing and Real Computation”, Reflections on the Future of text, 10th Oxford English Dictionary Conference, Waterloo, Ontario, Canada.
Mohri M. (1993): Analyse et représentation par automates de structures syntaxiques composées, Doctoral dissertation in Computer science (University of Paris VII).
Mohri M. (1994a): “Minimization of Sequential Transducers”, Lecture Notes in Computer Science, 807.
Mohri M. (1994b): Application of Local Grammars Automata an efficient Algorithm, Research Report IGM 94-16, University of Marne-la-Vallée.
Myhill J. (1957): “Finite automata and representation of events”, Fund Concepts in the Theory of Systems, Wright Air Development Center.
Pereira F., Wright R. N. (1991): “Finite-State Approximation of Phrase Structure Grammars”, Proceedings of the 29st Meeting of the Association for Computational Linguistics.
Revuz D. (1991): “Minimization of acyclic deterministic automata in linear time.”, Theorical Computer science, 181–189.
Revuz D. (1992): Dictionnaires et lexiques-Méthodes et algorithmes, Doctoral dissertation in Computer science (University of Paris VII).
Roche E. (1993): Analyse syntaxique transformationnelle du français par transducteurs et lexique-grammaires, Doctoral dissertation in Computer science (University Paris VII).
Silberztein M. (1989): Dictionnaires électroniques et reconnaissance lexicale automatique, Paris, Doctoral dissertation (University of Paris VII).
Watson B. W. (1995): Taxonomies and Toolkits of Regular Language Algorithms, Thesis Technische Universiteit Eindhoven.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maurel, D., Chauvier, L. (1998). Pseudo-minimal transducers: A transducer with proper elements. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031386
Download citation
DOI: https://doi.org/10.1007/BFb0031386
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64694-5
Online ISBN: 978-3-540-69104-4
eBook Packages: Springer Book Archive