A Memory-efficient ε-Removal Algorithm for Weighted Acyclic Finite-State Automata

Authors:
Thomas Hanneforth
Affiliations:
Institut für Linguistik, Universität Potsdam
Venue:
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Year:
2009

Citing 5
Cited 1

Semirings, automata, languages

Semirings, automata, languages
Parsing theory. Vol. 1: languages and parsing

Parsing theory. Vol. 1: languages and parsing
Introduction to Algorithms

Introduction to Algorithms
Generic epsilon -Removal Algorithm for Weighted Automata

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Generalized algorithms for constructing statistical language models

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1

Statistical language models within the algebra of weighted rational languages

Acta Cybernetica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many NLP tasks based on finite-state automata create acyclic result automata which contain a lot of ε-transitions. We propose an refinement of an existing algorithm for ε-removal with a better memory consumption behavior in many practical cases.