edu.stanford.nlp.fsm
Class DFSA<T,S>
java.lang.Object
edu.stanford.nlp.fsm.DFSA<T,S>
- All Implemented Interfaces:
- Scored
public final class DFSA<T,S>
- extends Object
- implements Scored
DFSA: A class for representing a deterministic finite state automaton
without epsilon transitions.
- Author:
- Dan Klein, Michel Galley (AT&T FSM library format printing)
Field Summary |
double |
score
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
score
public double score
DFSA
public DFSA(DFSAState<T,S> initialState,
double score)
DFSA
public DFSA(DFSAState<T,S> initialState)
DFSA
public DFSA(Object dfsaID)
score
public double score()
- Specified by:
score
in interface Scored
- Returns:
- The score of this thing.
initialState
public DFSAState<T,S> initialState()
setInitialState
public void setInitialState(DFSAState<T,S> initialState)
states
public Set states()
printTrieDFSA
public static void printTrieDFSA(DFSA dfsa)
printAttFsmFormat
public void printAttFsmFormat(Writer w)
throws IOException
- Throws:
IOException
printTrieAsRules
public static void printTrieAsRules(DFSA dfsa,
Writer w)
throws IOException
- Throws:
IOException
Stanford NLP Group