DFSA: A class for representing a deterministic finite state automaton without epsilon transitions.
DFSAState represents the state of a deterministic finite state automaton without epsilon transitions.
DFSATransition represents a transition in a weighted finite state transducer.
Minimization in n log n a la Hopcroft.
QuasiDeterminizer performing quasi-determinization on TransducerGraphs.
TransducerGraph represents a deterministic finite state automaton without epsilon transitions.
An arc in a finite state transducer.
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 (firstname.lastname@example.org) or Teg Grenager (email@example.com).
Stanford NLP Group