Semirings, automata, languages
Semirings, automata, languages
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Digital images and formal languages
Handbook of formal languages, vol. 3
Journal of the ACM (JACM)
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Treatment of epsilon moves in subset construction
Computational Linguistics - Special issue on finite-state methods in NLP
Finite-state transducers in language and speech processing
Computational Linguistics
Extraction of epsilon-Cyclesfrom Finite-State Transducers
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
A Memory-efficient ε-Removal Algorithm for Weighted Acyclic Finite-State Automata
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
A hybrid rule/model-based finite-state framework for normalizing SMS messages
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
fsm2 - a scripting language interpreter for manipulating weighted finite-state automata
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Uniformizing rational relations for natural language applications using weighted determinization
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Bilingual random walk models for automated grammar correction of ESL author-produced text
IUNLPBEA '11 Proceedings of the 6th Workshop on Innovative Use of NLP for Building Educational Applications
Fundamenta Informaticae
| Hi-index | 0.00 |
We present a new generic Ɛ-removal algorithm for weighted automata and transducers defined over a semiring. The algorithm can be used with any semiring covered by our framework and works with any queue discipline adopted. It can be used in particular in the case of unweighted automata and transducers and weighted automata and transducers defined over the tropical semiring. It is based on a general shortest-distance algorithm that we briefly describe. We give a full description of the algorithm including its pseudocode and its running time complexity, discuss the more efficient case of acyclic automata, an on-the-fly implementation of the algorithm and an approximation algorithm in the case of the semirings not covered by our framework. We also illustrate the use of the algorithm with several semirings.