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 java.lang.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), Sarah Spikes (sdspikes@cs.stanford.edu) - cleanup and filling in types
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(java.lang.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 java.util.Set<DFSAState<T,S>> states()
printTrieDFSA
public static <T,S> void printTrieDFSA(DFSA<T,S> dfsa)
printAttFsmFormat
public void printAttFsmFormat(java.io.Writer w)
throws java.io.IOException
- Throws:
java.io.IOException
printTrieAsRules
public static <T,S> void printTrieAsRules(DFSA<T,S> dfsa,
java.io.Writer w)
throws java.io.IOException
- Throws:
java.io.IOException
Stanford NLP Group