| Package | Description |
|---|---|
| edu.gtts.sautrela.wfsa |
Provides classes for Markov modeling
|
| edu.gtts.sautrela.wfsa.models |
| Modifier and Type | Interface and Description |
|---|---|
interface |
DWFSA<S extends State,Y extends Symbol,T extends Transition<S,Y>>
Deterministic Weighted Finite-State Automata
|
interface |
NdWFSA<S extends State,Y extends Symbol,T extends Transition<S,Y>>
Non-Deterministic Weighted Finite-State Automata
|
class |
Path<S extends State,T extends Transition<S,?>>
A growable but non modificable List of Transitions
|
interface |
WFSA<S extends State,Y extends Symbol,T extends Transition<S,Y>>
Weighted Finite-State Automata
|
| Modifier and Type | Method and Description |
|---|---|
static <S extends State,Y extends Symbol,T extends Transition<S,Y>> |
Decoder.getPath(WFSA<S,Y,T> wfa,
java.util.List<Y> symbolList,
double beam,
int verbose)
Returns the state path or most probable state path for a given symbol list
|
static <S extends State,Y extends Symbol,T extends Transition<S,Y>> |
Util.getProb(WFSA<S,Y,T> wfa,
java.util.List<Y> obs) |
static <S extends State,Y extends Symbol,T extends Transition<S,Y>> |
Util.getProb(WFSA<S,Y,T> wfa,
java.util.List<Y> obs,
double beam) |
static <T extends Transition<?,?>> |
Util.getRandomTrans(T[] theArray) |
static <S extends State,Y extends Symbol,T extends Transition<S,Y>> |
Trainer.ML(WFSA<S,Y,T> wfa,
java.util.Collection<java.util.List<Y>> data,
Trainer.Method method,
double beam,
int verbose)
Trains a WFSA using the Maximun Likelihood criteria
|
static <S extends State,Y extends Symbol,T extends Transition<S,Y>> |
Trainer.ML(WFSA<S,Y,T> wfa,
java.util.Collection<java.util.List<Y>> data,
Trainer.Method method,
double beam,
int verbose,
double mapCount)
Trains a WFSA using the Maximun Likelihood criteria
|
static <S extends State,Y extends Symbol,T extends Transition<S,Y>> |
Util.randomSymbolList(WFSA<S,Y,T> wfa)
Generates a random non-null list of Symbols for a
WFSA. |
| Modifier and Type | Method and Description |
|---|---|
T[] |
WFSA.getTrans(S state)
Returns all possible transitions from a state.
|
T[] |
NdWFSA.getTrans(S from,
Y symbol)
Returns all possible transitions for the given source state and symbol.
|
| Modifier and Type | Method and Description |
|---|---|
static WFSA<State,Symbol,Transition<State,Symbol>> |
Util.newWFSAInstance(org.xml.sax.InputSource is)
Instantiates a WFSA using a XML description found via an
InputSource |
static WFSA<State,Symbol,Transition<State,Symbol>> |
Util.newWFSAInstance(org.xml.sax.InputSource is,
Alphabet<Symbol> alphabet)
Instantiates a WFSA using a XML description found via an
InputSource
and using an existing Alphabet. |
| Modifier and Type | Method and Description |
|---|---|
static <T extends Transition<?,?>> |
Util.getRandomTrans(T[] theArray) |
| Modifier and Type | Class and Description |
|---|---|
class |
DefaultTransition<S extends State,Y extends Symbol> |
class |
LMM.xTransition |
| Modifier and Type | Method and Description |
|---|---|
Transition<edu.gtts.sautrela.wfsa.models.CHMM.State,edu.gtts.sautrela.wfsa.models.CHMM.Symbol> |
CHMM.getRandomTrans(edu.gtts.sautrela.wfsa.models.CHMM.State from) |
Transition<edu.gtts.sautrela.wfsa.models.CHMM.State,edu.gtts.sautrela.wfsa.models.CHMM.Symbol>[] |
CHMM.getTrans(edu.gtts.sautrela.wfsa.models.CHMM.State from) |
Transition<edu.gtts.sautrela.wfsa.models.CHMM.State,edu.gtts.sautrela.wfsa.models.CHMM.Symbol>[] |
CHMM.getTrans(edu.gtts.sautrela.wfsa.models.CHMM.State from,
edu.gtts.sautrela.wfsa.models.CHMM.Symbol symbol) |
| Modifier and Type | Method and Description |
|---|---|
int |
DefaultTransition.compareTo(Transition<S,Y> t)
Inverse probability order is used when comparing two transitions.
|
void |
CHMM.incrementTrainCount(Transition<edu.gtts.sautrela.wfsa.models.CHMM.State,edu.gtts.sautrela.wfsa.models.CHMM.Symbol> t,
double count) |