| Package | Description |
|---|---|
| edu.cmu.sphinx.decoder.search | |
| edu.cmu.sphinx.decoder.search.stats | |
| edu.cmu.sphinx.result |
| Modifier and Type | Field and Description |
|---|---|
protected java.util.Map<SearchState,Token> |
WordPruningBreadthFirstSearchManager.bestTokenMap |
protected java.util.Map<SearchState,Token> |
SimpleBreadthFirstSearchManager.bestTokenMap |
protected java.util.Map<SearchState,Token> |
WordPruningBreadthFirstLookaheadSearchManager.fastMatchBestTokenMap |
protected java.util.List<Token> |
WordPruningBreadthFirstSearchManager.resultList |
protected java.util.List<Token> |
SimpleBreadthFirstSearchManager.resultList |
| Modifier and Type | Method and Description |
|---|---|
Token |
ActiveList.getBestToken()
Gets the best scoring token for this active list
|
protected Token |
WordPruningBreadthFirstSearchManager.getBestToken(SearchState state)
Gets the best token for this state
|
protected Token |
TokenHeapSearchManager.getBestToken(SearchState state) |
protected Token |
SimpleBreadthFirstSearchManager.getBestToken(SearchState state)
Gets the best token for this state
|
protected Token |
WordPruningBreadthFirstLookaheadSearchManager.getFastMatchBestToken(SearchState state) |
Token |
Token.getPredecessor()
Returns the predecessor for this token, or null if this token has no predecessors
|
protected Token |
TokenSearchManager.getResultListPredecessor(Token token)
Find the token to use as a predecessor in resultList given a candidate
predecessor.
|
protected Token |
SimpleBreadthFirstSearchManager.setBestToken(Token token,
SearchState state)
Sets the best token for a given state
|
| Modifier and Type | Method and Description |
|---|---|
java.util.List<Token> |
AlternateHypothesisManager.getAlternatePredecessors(Token token)
Returns a list of alternate predecessors for a token.
|
protected java.util.Map<SearchState,Token> |
SimpleBreadthFirstSearchManager.getBestTokenMap()
Returns the best token map.
|
java.util.List<Token> |
WordPruningBreadthFirstSearchManager.getResultList()
Returns the result list.
|
java.util.List<Token> |
SimpleBreadthFirstSearchManager.getResultList()
Returns the result list.
|
java.util.List<Token> |
ActiveList.getTokens()
Gets the list of all tokens
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
WordPruningBreadthFirstSearchManager.activeListAdd(Token token) |
void |
SimpleActiveListManager.add(Token token)
Adds the given token to the list
|
void |
ActiveListManager.add(Token token)
Adds the given token to the list
|
void |
ActiveList.add(Token token)
Adds the given token to the list, keeping track of the lowest scoring token
|
void |
AlternateHypothesisManager.addAlternatePredecessor(Token token,
Token predecessor)
Collects adds alternate predecessors for a token that would have lost because of viterbi.
|
protected boolean |
WordPruningBreadthFirstSearchManager.allowExpansion(Token t)
Determine if the given token should be expanded
|
protected void |
WordPruningBreadthFirstLookaheadSearchManager.collectFastMatchSuccessorTokens(Token token) |
protected void |
WordPruningBreadthFirstSearchManager.collectSuccessorTokens(Token token)
Collects the next set of emitting tokens from a token and accumulates
them in the active or result lists
|
protected void |
WordPruningBreadthFirstLookaheadSearchManager.collectSuccessorTokens(Token token)
Collects the next set of emitting tokens from a token and accumulates
them in the active or result lists
|
protected void |
SimpleBreadthFirstSearchManager.collectSuccessorTokens(Token token)
Collects the next set of emitting tokens from a token and accumulates them in the active or result lists
|
java.util.List<Token> |
AlternateHypothesisManager.getAlternatePredecessors(Token token)
Returns a list of alternate predecessors for a token.
|
protected Token |
TokenSearchManager.getResultListPredecessor(Token token)
Find the token to use as a predecessor in resultList given a candidate
predecessor.
|
boolean |
AlternateHypothesisManager.hasAlternatePredecessors(Token token) |
protected boolean |
WordPruningBreadthFirstSearchManager.isVisited(Token t)
Determines whether or not we've visited the state associated with this
token since the previous frame.
|
int |
Partitioner.partition(Token[] tokens,
int size,
int n)
Partitions the given array of tokens in place, so that the highest scoring n token will be at the beginning of
the array, not in any order.
|
void |
ActiveList.setBestToken(Token token)
Sets the best scoring token for this active list
|
protected void |
WordPruningBreadthFirstSearchManager.setBestToken(Token token,
SearchState state)
Sets the best token for a given state
|
protected void |
TokenHeapSearchManager.setBestToken(Token token,
SearchState state) |
protected Token |
SimpleBreadthFirstSearchManager.setBestToken(Token token,
SearchState state)
Sets the best token for a given state
|
protected void |
WordPruningBreadthFirstLookaheadSearchManager.setFastMatchBestToken(Token token,
SearchState state) |
void |
Token.update(Token predecessor,
SearchState nextState,
float logEntryScore,
float insertionProbability,
float languageProbability,
long collectTime) |
| Modifier and Type | Method and Description |
|---|---|
protected void |
SimpleBreadthFirstSearchManager.setBestTokenMap(java.util.Map<SearchState,Token> bestTokenMap)
Sets the best token Map.
|
void |
WordPruningBreadthFirstSearchManager.setResultList(java.util.List<Token> resultList)
Sets the result list.
|
| Constructor and Description |
|---|
Token(Token predecessor,
float logTotalScore,
float logAcousticScore,
float logInsertionScore,
float logLanguageScore)
Creates a Token with the given acoustic and language scores and predecessor.
|
Token(Token predecessor,
SearchState state,
float logTotalScore,
float logInsertionScore,
float logLanguageScore,
long collectTime)
Internal constructor for a token.
|
| Modifier and Type | Method and Description |
|---|---|
void |
WordTracker.add(Token t)
Adds a word history for the given token to the word tracker
|
void |
TokenTypeTracker.add(Token t)
Adds a token to this tracker.
|
void |
TokenTracker.add(Token t)
Adds a new token to the tracker
|
void |
StateHistoryTracker.add(Token t)
Adds a word history for the given token to the word tracker
|
| Modifier and Type | Method and Description |
|---|---|
Token |
Result.findToken(java.lang.String text)
Searches through the n-best list to find the the branch that matches the
given string
|
Token |
Result.getBestActiveParitalMatchingToken(java.lang.String text)
Returns the best scoring token that matches the beginning of the given
text.
|
Token |
Result.getBestActiveToken()
Returns the best scoring token in the active set
|
Token |
Result.getBestFinalToken()
Returns the best scoring final token in the result.
|
Token |
Result.getBestToken()
Returns the best scoring token in the result.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.List<Token> |
Result.findPartialMatchingTokens(java.lang.String text)
Searches through the n-best list to find the the branch that matches the
beginning of the given string
|
java.util.List<Token> |
Result.getResultTokens()
Returns a list of result tokens for this result.
|
| Constructor and Description |
|---|
Result(ActiveList activeList,
java.util.List<Token> resultList,
long collectTime,
boolean isFinal,
boolean wordTokenFirst,
boolean toCreateLattice)
Creates a result
|
Result(AlternateHypothesisManager alternateHypothesisManager,
ActiveList activeList,
java.util.List<Token> resultList,
long collectTime,
boolean isFinal,
boolean wordTokenFirst,
boolean toCreateLattice)
Creates a result
|