|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.cmu.sphinx.result.Node
Nodes are part of Lattices. The represent theories that words were spoken over a given time.
Method Summary | |
boolean |
equals(java.lang.Object obj)
Assumes ids are unique node identifiers |
Edge |
findEquivalentLeavingEdge(Edge edge)
Returns a leaving edge that is equivalent to the given edge. |
double |
getBackwardScore()
|
int |
getBeginTime()
Get the frame number when the word began |
java.util.List |
getChildNodes()
Get the nodes at the other ends of outgoing edges of this node. |
java.util.Collection |
getCopyOfLeavingEdges()
Returns a copy of the Edges from this Node, so that the underlying data structure will not be modified. |
Edge |
getEdgeFromNode(Node n)
given a node find the edge from that node |
Edge |
getEdgeToNode(Node n)
given a node find the edge to that node |
int |
getEndTime()
Get the frame number when the word ends |
java.util.Collection |
getEnteringEdges()
Get the Edges to this Node |
double |
getForwardScore()
|
java.lang.String |
getId()
Get the ID associated with this Node |
java.util.Collection |
getLeavingEdges()
Get the Edges from this Node |
double |
getPosterior()
|
Word |
getWord()
Get the word associated with this Node |
boolean |
hasAncestralRelationship(Node node)
Check whether this node has an ancestral relationship with another node (i.e. either this node is an ancestor of the other node, or vice versa) |
boolean |
hasEquivalentLeavingEdges(Node n)
Test if a Node has all Edges to the same Nodes and another Node. |
int |
hashCode()
|
boolean |
isAncestorOf(Node node)
Check whether this node is an ancestor of another node. |
boolean |
isEquivalent(Node other)
Returns true if the given node is equivalent to this node. |
void |
removeLeavingEdge(Edge e)
Remove an Edge to this Node |
void |
setBackwardScore(double backwardScore)
|
void |
setForwardScore(double forwardScore)
|
void |
setPosterior(double posterior)
|
java.lang.String |
toString()
Returns a description of this Node that contains the word, the start time, and the end time. |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Method Detail |
public Edge getEdgeToNode(Node n)
n
- the node of interest
null
if no edge
could be found.public Edge getEdgeFromNode(Node n)
n
- the node of interest
null
if no edge
could be found.public boolean hasEquivalentLeavingEdges(Node n)
n
- the node of interest
public java.util.Collection getEnteringEdges()
public java.util.Collection getLeavingEdges()
public java.util.Collection getCopyOfLeavingEdges()
public void removeLeavingEdge(Edge e)
e
- the edge to removepublic java.lang.String getId()
public Word getWord()
public int getBeginTime()
public int getEndTime()
public java.lang.String toString()
public double getBackwardScore()
public void setBackwardScore(double backwardScore)
backwardScore
- The backwardScore to set.public double getForwardScore()
public void setForwardScore(double forwardScore)
forwardScore
- The forwardScore to set.public double getPosterior()
public void setPosterior(double posterior)
posterior
- The node posterior probability to set.public int hashCode()
Object.hashCode()
public boolean equals(java.lang.Object obj)
Object.equals(java.lang.Object)
public java.util.List getChildNodes()
public boolean isAncestorOf(Node node)
node
- the Node to check
public boolean hasAncestralRelationship(Node node)
node
- the Node to check for a relationship
public boolean isEquivalent(Node other)
other
- the Node we're comparing to
public Edge findEquivalentLeavingEdge(Edge edge)
edge
- the Edge to compare the leaving edges of this node against
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |