See: Description
| Interface | Description |
|---|---|
| AutomatonCompactor |
Compacts a weighted finite automaton.
|
| AutomatonMinimizer | |
| Block<E> | |
| TransducerGraph.ArcProcessor | |
| TransducerGraph.GraphProcessor | |
| TransducerGraph.NodeProcessor |
| Class | Description |
|---|---|
| DFSA<T,S> |
DFSA: A class for representing a deterministic finite state automaton
without epsilon transitions.
|
| DFSAMinimizer |
DFSAMinimizer minimizes (unweighted) deterministic finite state
automata.
|
| DFSAState<T,S> |
DFSAState represents the state of a deterministic finite state
automaton without epsilon transitions.
|
| DFSATransition<T,S> |
DFSATransition represents a transition in a weighted finite state
transducer.
|
| ExactAutomatonMinimizer |
Minimization of a FA in n log n a la Hopcroft.
|
| FastExactAutomatonMinimizer |
Minimization in n log n a la Hopcroft.
|
| QuasiDeterminizer |
QuasiDeterminizer performing quasi-determinization on TransducerGraphs.
|
| TransducerGraph |
TransducerGraph represents a deterministic finite state automaton
without epsilon transitions.
|
| TransducerGraph.Arc<NODE,IN,OUT> |
An arc in a finite state transducer.
|
| TransducerGraph.InputSplittingProcessor | |
| TransducerGraph.NodeProcessorWrappingArcProcessor | |
| TransducerGraph.NormalizingGraphProcessor | |
| TransducerGraph.ObjectToSetNodeProcessor | |
| TransducerGraph.OutputCombiningProcessor | |
| TransducerGraph.SetToStringNodeProcessor |
Contains two implementations of finite state machines. One is DFSA, which is older and used in some of
the old parse code. The second is TransducerGraph, which represents a transducer (a generalization of a FSM) and is
used in the newer grammar compaction code currently used in the parser.
For questions contact Dan Klein (klein@cs.berkeley.edu) or Teg Grenager (grenager@stanford.edu).