|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
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. |
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).
|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |