A Memory-efficient ε-Removal Algorithm for Weighted Acyclic Finite-State Automata
Thomas Hanneforth · Finite-State Methods and Natural Language Processing · 2009
Many NLP tasks based on finite-state automata create acyclic result automata which contain a lot of e-transitions. We propose an refinement of an existing algorithm for e-removal with a better memory consumption behavior in many practical cases.