Package edu.stanford.nlp.fsm

Class Summary
DFSA<T,S> DFSA: A class for representing a deterministic finite state automaton without epsilon transitions.
DFSAState<T,S> DFSAState

Class for representing the state of a deterministic finite state automaton without epsilon transitions.

DFSATransition<T,S> (D)FSA Transition

Class for representing a transition in a weighted finite state transducer.

 



Stanford NLP Group