Name | Description | Type | Package | Framework |
AutomatonMinimizer | Interface | edu.stanford.nlp.fsm | Stanford Parser | |
DFSA | DFSA: A class for representing a deterministic finite state automaton without epsilon transitions. | Class | edu.stanford.nlp.fsm | Stanford Parser |
DFSAState | DFSAState represents the state of a deterministic finite state automaton without epsilon transitions. | Class | edu.stanford.nlp.fsm | Stanford Parser |
DFSATransition | DFSATransition represents a transition in a weighted finite state transducer. | Class | edu.stanford.nlp.fsm | Stanford Parser |
FastExactAutomatonMinimizer | Minimization in n log n a la Hopcroft. | Class | edu.stanford.nlp.fsm | Stanford Parser |
QuasiDeterminizer | QuasiDeterminizer performing quasi-determinization on TransducerGraphs. | Class | edu.stanford.nlp.fsm | Stanford Parser |
TransducerGraph | TransducerGraph represents a deterministic finite state automaton without epsilon transitions. | Class | edu.stanford.nlp.fsm | Stanford Parser |
TransducerGraph .Arc | An arc in a finite state transducer. | Class | edu.stanford.nlp.fsm.TransducerGraph | Stanford Parser |
TransducerGraph .ArcProcessor | TransducerGraph. | Interface | edu.stanford.nlp.fsm.TransducerGraph | Stanford Parser |
TransducerGraph .GraphProcessor | Interface | edu.stanford.nlp.fsm.TransducerGraph | Stanford Parser | |
TransducerGraph .InputSplittingProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | Stanford Parser | |
TransducerGraph .NodeProcessorWrappingArcProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | Stanford Parser | |
TransducerGraph .NormalizingGraphProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | Stanford Parser | |
TransducerGraph .ObjectToSetNodeProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | Stanford Parser | |
TransducerGraph .OutputCombiningProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | Stanford Parser | |
TransducerGraph .SetToStringNodeProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | Stanford Parser | |
AutomatonMinimizer | Interface | edu.stanford.nlp.fsm | JavaNlp | |
Block | Interface | edu.stanford.nlp.fsm | JavaNlp | |
DFSA | DFSA: A class for representing a deterministic finite state automaton without epsilon transitions. | Class | edu.stanford.nlp.fsm | JavaNlp |
DFSAState | DFSAState represents the state of a deterministic finite state automaton without epsilon transitions. | Class | edu.stanford.nlp.fsm | JavaNlp |
DFSATransition | DFSATransition represents a transition in a weighted finite state transducer. | Class | edu.stanford.nlp.fsm | JavaNlp |
FastExactAutomatonMinimizer | Minimization in n log n a la Hopcroft. | Class | edu.stanford.nlp.fsm | JavaNlp |
QuasiDeterminizer | QuasiDeterminizer performing quasi-determinization on TransducerGraphs. | Class | edu.stanford.nlp.fsm | JavaNlp |
TransducerGraph | TransducerGraph represents a deterministic finite state automaton without epsilon transitions. | Class | edu.stanford.nlp.fsm | JavaNlp |
TransducerGraph .Arc | An arc in a finite state transducer. | Class | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp |
TransducerGraph .ArcProcessor | TransducerGraph. | Interface | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp |
TransducerGraph .GraphProcessor | Interface | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp | |
TransducerGraph .InputSplittingProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp | |
TransducerGraph .NodeProcessor | Interface | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp | |
TransducerGraph .NodeProcessorWrappingArcProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp | |
TransducerGraph .NormalizingGraphProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp | |
TransducerGraph .ObjectToSetNodeProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp | |
TransducerGraph .OutputCombiningProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp | |
TransducerGraph .SetToStringNodeProcessor | Class | edu.stanford.nlp.fsm.TransducerGraph | JavaNlp | |