Treatment of Epsilon Moves in Subset Construction

@article{Noord2000TreatmentOE,
  title={Treatment of Epsilon Moves in Subset Construction},
  author={Gertjan van Noord},
  journal={Computational Linguistics},
  year={2000},
  volume={26},
  pages={61-76}
}
The paper discusses the problem of determinizing finite-state automata containing large numbers of -moves. Experiments with finite-state approximations of natural language grammars often give rise to very large automata with a very large number of -moves. The paper identifies and compares a number of subset construction algorithms that treat -moves. Experiments have been performed which indicate that the algorithms differ considerably in practice, both with respect to the size of the resulting… 
Treatment of epsilon moves in subset construction
The paper discusses the problem of determinizing finite-state automata containing large numbers of c-moves. Experiments with finite-state approximations of natural language grammars often give rise
Therapy of Small Motivation on Subset Structures
Background: The finite head automata including huge number of moves which is the main propose of this study with tests on approximations of language grammar. These grammars usually arise to a huge
An efficient incremental DFA minimization algorithm
TLDR
A new Deterministic Finite Automata (DFA) minimization algorithm which may be halted at any time, yielding a partially-minimized automaton and which considers three practical and effective optimizations.
Generic epsilon -Removal Algorithm for Weighted Automata
TLDR
A new generic e-removal algorithm for weighted automata and transducers defined over a semiring based on a general shortest-distance algorithm that is used with any semiring covered by the framework and works with any queue discipline adopted.
Efficient finite-state algorithms for the application of local grammars
TLDR
An algorithm of application of local grammars having a polynomial worst-case cost is conceived and implemented and compared the performances of the different algorithms and algorithm versions in the context of an industrial natural language application provided by the enterprise Telefonica I+D.
Collapsing epsilon-Loops in Weighted Finite-State Machines
TLDR
An approach that removes e-loops without performing a full e-closure is proposed and it is shown how this can be efficiently implemented using sparse matrix operations.
The Redundancy Problem in Composition of Parallel Finite Automata and Its Optimization Method
TLDR
The redundancy problem in the Split-Join composition of parallel finite automata is researched and the condition which lead to produce redundant location and transfer is given and the equivalence of parallel infinite automata and finite Automata is proved.
Automata Implementation
TLDR
This paper deals with minimization of finite automata associated with finite languages all the words have the same length in the context of Constraint Satisfaction Problems, widely used in AI.
Generic -removal Algorithm for Weighted Automata
We present a new generic-removal algorithm for weighted automata and transducers deened over a semiring. The algorithm can be used with any semiring covered by our framework and works with any queue
Learning Nominal Regular Languages with Binders
TLDR
This dissertation investigates learning nominal automata, an extension of classical automata to alphabets featuring names, and proposes nL*, a learning algorithm on nominal regular languages with binders, which generalises Angluin's algorithm L* with respect to nominal regular Languages with Binders.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Treatment of epsilon moves in subset construction
The paper discusses the problem of determinizing finite-state automata containing large numbers of c-moves. Experiments with finite-state approximations of natural language grammars often give rise
Treatment of ε-moves in subset construction
TLDR
The paper identifies three subset construction algorithms which treat e-moves and suggests that the average number of e-Moves per state can be used to predict which algorithm is likely to perform best for a given input automaton.
Instruction Computation in Subset Construction
  • J. Johnson, D. Wood
  • Mathematics, Computer Science
    Workshop on Implementing Automata
  • 1996
TLDR
This work discusses one aspect of subset construction; namely, the computation of the instructions of the equivalent deterministic machine, and draws some conclusions within the context of INR and Grail.
Efficient approaches to subset construction
TLDR
Recommendations of subset construction are suggested based upon information about the input automaton based on a pseudo-code speci cation and a conjecture based on the density of automata.
Approximating Context-Free Grammars with a Finite-State Calculus
TLDR
A method is presented here for calculating finite-state approximations from context-free grammars that is essentially different from the algorithm introduced by Pereira and Wright (1991; 1996), is faster in some cases, and has the advantage of being open-ended and adaptable.
Finite State Machines from Feature Grammars
This paper describes the conversion of a set of feature grammar rules into a deterministic finite state machine that accepts the same language (or at least a well-defined related language). First the
Regular Approximations of CFLs: A Grammatical View
We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from existing methods of approximation in that use of a
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
TLDR
The paper discusses the regular expression operations provided by the compiler, and the possibilities to create new regular expression operators, and a number of examples taken from recent publications in the area of finite-state approaches to NLP.
FSA Utilities: A Toolbox to Manipulate Finite-State Automata
TLDR
The FSA Utilities toolbox: a collection of utilities to manipulate finite-state automata and finite- state transducers, which includes determinization, minimization, composition, complementation, intersection, Kleene dosure, etc.
Introduction to Automata Theory, Languages and Computation
TLDR
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
...
1
2
3
4
...