Abstract
This paper presents an algorithm for direct building of minimal acyclic subsequential transducer, which represents a finite relation given as a sorted list of words with their outputs. The algorithm constructs the minimal transducer directly - without constructing intermediate tree-like or pseudo-minimal transducers. In NLP applications our algorithm provides significantly better efficiency than the other algorithms building minimal transducer for large-scale natural language dictionaries. Some experimental comparisons are presented at the end of the paper.
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
A. Aho, J. Hopcroft, J. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, Massachutes, 1983.
J. Daciuk, S. Mihov, B. Watson, R. Watson, Incremental Construction of Minimal Acyclic Finite State Automata, Computational Linguistics, Vol. 26(1), 2000.
D. Maurel, Pseudo-minimal transducer, Theoretical Computer Science, Vol. 231(1), 129–139, 2000.
S. Mihov, Direct Building of Minimal Automaton for Given List, Annuaire de l’Université de Sofia “St. Kl. Ohridski”, Faculté de Mathématique et Informatique, volume 91, livre 1, 1998.
M. Mohri, Minimization of Sequential Transducers, Lecture Notes in Computer Science, Springer, Berlin, 1994.
M. Mohri, On Some Applications of Finite-State Automata Theory to Natural Language Processing, Natural Language Engineering, Vol. 2(1), 1–20, 1996.
M. Mohri, Finite-State Transducers in Language and Speech Processing, Computational Linguistics, Vol. 23(2), 269–311, 1997.
D. Revuz, Dictionaires et lexiques-Méthodes et algorithms, Doctoral dissertation in Computer Science, University Paris VII, Paris, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mihov, S., Maurel, D. (2001). Direct Construction of Minimal Acyclic Subsequential Transducers. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-44674-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42491-8
Online ISBN: 978-3-540-44674-3
eBook Packages: Springer Book Archive