dragon.ml.seqmodel.model

Class CompleteModel

java.lang.Object

dragon.ml.seqmodel.model.AbstractModel

dragon.ml.seqmodel.model.CompleteModel

All Implemented Interfaces:

ModelGraph

public class CompleteModel
extends AbstractModel

Complete model graph

Copyright: Copyright (c) 2005

Company: IST, Drexel University

Version:

1.0

Author:

Davis Zhou

Field Summary

Fields inherited from class dragon.ml.seqmodel.model.AbstractModel

name, numLabels

Constructor Summary

Constructors

Constructor and Description
CompleteModel(int labelNum)
CompleteModel(int labelNum, int markovOrder)

Method Summary

Modifier and Type	Method and Description
EdgeIterator	getEdgeIterator()
int	getEdgeNum()
int	getEndState(int i) Gets the index-th ending state.
int	getEndStateNum()
int	getLabel(int state) Gets the label of the state.
int	getMarkovOrder() Gets the order of the markov chain.
int	getOriginalLabelNum() Gets the number of original unique labels no matter what order the markov chain is.
int	getStartState(int i) Gets the index-th starting state.
int	getStartStateNum()
boolean	isEndState(int i) Tests if the i-th state is an ending state
boolean	isStartState(int i) Tests if the i-th state is a starting state

Methods inherited from class dragon.ml.seqmodel.model.AbstractModel

getLabelNum, getNewModelGraph, getStateNum, mapLabelToState, mapLabelToState, mapStateToLabel, printGraph

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

CompleteModel

public CompleteModel(int labelNum)

CompleteModel

public CompleteModel(int labelNum,
                     int markovOrder)

Method Detail

getOriginalLabelNum

public int getOriginalLabelNum()

Description copied from interface: ModelGraph

Gets the number of original unique labels no matter what order the markov chain is. It is always equal to the number of labels unless markov is not the first order.

Specified by:

getOriginalLabelNum in interface ModelGraph

Overrides:

getOriginalLabelNum in class AbstractModel

Returns:

the number of original unique labels

getMarkovOrder

public int getMarkovOrder()

Description copied from interface: ModelGraph

Gets the order of the markov chain. It is always equal to one except for the complete model.

Specified by:

getMarkovOrder in interface ModelGraph

Overrides:

getMarkovOrder in class AbstractModel

Returns:

the order of the markov chain.

getLabel

public int getLabel(int state)

Description copied from interface: ModelGraph

Gets the label of the state. The label and the state should be the same except for nested models.

Parameters:

state - the index of the state

Returns:

the label of the state

getEdgeNum

public int getEdgeNum()

Returns:

the number of edges

getStartStateNum

public int getStartStateNum()

Returns:

the number of states which can serve as starting states

getEndStateNum

public int getEndStateNum()

Returns:

the number of states which can serve as ending states

getStartState

public int getStartState(int i)

Description copied from interface: ModelGraph

Gets the index-th starting state. The index is between zero and the number of starting states minor one

Parameters:

i - the index-th starting state

Returns:

the index-th starting state.

getEndState

public int getEndState(int i)

Description copied from interface: ModelGraph

Gets the index-th ending state. The index is between zero and the number of ending states minor one

Parameters:

i - the index-th ending state

Returns:

the index-th ending state.

isEndState

public boolean isEndState(int i)

Description copied from interface: ModelGraph

Tests if the i-th state is an ending state

Parameters:

i - the i-th state

Returns:

true if the i-th state is an ending state

isStartState

public boolean isStartState(int i)

Description copied from interface: ModelGraph

Tests if the i-th state is a starting state

Parameters:

i - the i-th state

Returns:

true if the i-th state is a starting state

getEdgeIterator

public EdgeIterator getEdgeIterator()

Returns:

the iterator for edges