edu.cmu.sphinx.trainer

Interface UtteranceGraph

All Known Implementing Classes:

UtteranceHMMGraph

public interface UtteranceGraph

Interface to the UtteranceGraph, a graph of an utterance.

Method Summary

Modifier and Type	Method and Description
void	add(Graph transcriptGraph) Add a transcript graph to the current utterance graph.
Node	getFinalNode() Gets the final node in this graph
Node	getInitialNode() Gets the initial node in this graph
Node	getNode(int index) Get node at the specified position in the list.
int	indexOf(Node node) Gets the index of a particular node in the graph.
boolean	isFinalNode(Node node) Returns whether the given node is the final node in this graph.
boolean	isInitialNode(Node node) Returns whether the given node is the initial node in this graph.
int	size()
boolean	validate() Validate the graph.

Method Detail

add

void add(Graph transcriptGraph)

Add a transcript graph to the current utterance graph.

Parameters:

transcriptGraph - the transcript graph to add

size

int size()

Returns:

the size of a graph. This is the number of nodes in a graph.

getNode

Node getNode(int index)

Get node at the specified position in the list. The order is the same in which the nodes were entered.

Parameters:

index - index of item to retun

Returns:

the node

getInitialNode

Node getInitialNode()

Gets the initial node in this graph

Returns:

the initial node

getFinalNode

Node getFinalNode()

Gets the final node in this graph

Returns:

the final node

isInitialNode

boolean isInitialNode(Node node)

Returns whether the given node is the initial node in this graph.

Parameters:

node - the node we want to compare

Returns:

if true, the node is the initial node

isFinalNode

boolean isFinalNode(Node node)

Returns whether the given node is the final node in this graph.

Parameters:

node - the node we want to compare

Returns:

if true, the node is the final node

indexOf

int indexOf(Node node)

Gets the index of a particular node in the graph.

Parameters:

node - the node

Returns:

the index

validate

boolean validate()

Validate the graph. It checks out basics about the graph, such as whether all nodes have at least one incoming and outgoing edge, except for the initial and final.

Returns:

if true, graph validation passed