public SearchState getInitialState()
{
DynamicFlatLinguist.InitialState initialState = new DynamicFlatLinguist.InitialState(this.this_0);
initialState.addArc(new DynamicFlatLinguist.GrammarState(this.this_0, DynamicFlatLinguist.access_900(this.this_0).getInitialNode()));
if (DynamicFlatLinguist.access_1000(this.this_0))
{
OutOfGrammarGraph outOfGrammarGraph = new OutOfGrammarGraph(DynamicFlatLinguist.access_1100(this.this_0), DynamicFlatLinguist.access_1200(this.this_0), DynamicFlatLinguist.access_1300(this.this_0));
initialState.addArc(outOfGrammarGraph.getOutOfGrammarGraph());
}
return(initialState);
}
internal FirstBranchState(OutOfGrammarGraph outOfGrammarGraph) : base(outOfGrammarGraph)
{
ArrayList arrayList = new ArrayList();
Iterator contextIndependentUnitIterator = OutOfGrammarGraph.access_200(outOfGrammarGraph).getContextIndependentUnitIterator();
while (contextIndependentUnitIterator.hasNext())
{
Unit unit = (Unit)contextIndependentUnitIterator.next();
OutOfGrammarGraph.OogHMM oogHMM = new OutOfGrammarGraph.OogHMM(outOfGrammarGraph, unit);
arrayList.add(oogHMM);
}
this.successors = (SearchStateArc[])arrayList.toArray(new SearchStateArc[arrayList.size()]);
}
public override SearchStateArc[] getSuccessors()
{
if (this.hmmState.isExitState())
{
return(OutOfGrammarGraph.access_400(this.this_0));
}
HMMStateArc[] successors = this.hmmState.getSuccessors();
SearchStateArc[] array = new SearchStateArc[successors.Length];
for (int i = 0; i < successors.Length; i++)
{
array[i] = new OutOfGrammarGraph.OogHMMState(this.this_0, successors[i].getHMMState(), successors[i].getLogProbability());
}
return(array);
}
internal UnknownWordState(OutOfGrammarGraph outOfGrammarGraph) : base(outOfGrammarGraph)
{
this.successors = new SearchStateArc[1];
this.successors[0] = OutOfGrammarGraph.access_000(outOfGrammarGraph);
}
public override SearchStateArc[] getSuccessors()
{
return(OutOfGrammarGraph.access_500());
}
internal FinalState(OutOfGrammarGraph outOfGrammarGraph) : base(outOfGrammarGraph)
{
this.this_0 = outOfGrammarGraph;
}
internal static SearchStateArc[] access_400(OutOfGrammarGraph outOfGrammarGraph)
{
return(outOfGrammarGraph.lbsArcSet);
}
internal static float access_300(OutOfGrammarGraph outOfGrammarGraph)
{
return(outOfGrammarGraph.logPhoneInsertionProbability);
}
internal static AcousticModel access_200(OutOfGrammarGraph outOfGrammarGraph)
{
return(outOfGrammarGraph.acousticModel);
}
internal static float access_100(OutOfGrammarGraph outOfGrammarGraph)
{
return(outOfGrammarGraph.logOutOfGrammarBranchProbability);
}
public override float getLanguageProbability()
{
return(OutOfGrammarGraph.access_100(this.this_0));
}
internal LastBranchState(OutOfGrammarGraph outOfGrammarGraph) : base(outOfGrammarGraph)
{
this.successors = new SearchStateArc[2];
this.successors[0] = OutOfGrammarGraph.access_000(outOfGrammarGraph);
this.successors[1] = new OutOfGrammarGraph.FinalState(outOfGrammarGraph);
}
internal static OutOfGrammarGraph.FirstBranchState access_000(OutOfGrammarGraph outOfGrammarGraph)
{
return(outOfGrammarGraph.fbs);
}
internal OogSearchState(OutOfGrammarGraph outOfGrammarGraph)
{
this.this_0 = outOfGrammarGraph;
}
internal OogHMMState(OutOfGrammarGraph outOfGrammarGraph, HMMState hmmstate, float num) : base(outOfGrammarGraph)
{
this.hmmState = hmmstate;
this.logProbability = num;
}
public override float getInsertionProbability()
{
return(OutOfGrammarGraph.access_300(this.this_0));
}
internal OogHMM(OutOfGrammarGraph outOfGrammarGraph, Unit u) : base(outOfGrammarGraph)
{
this.hmm = OutOfGrammarGraph.access_200(outOfGrammarGraph).lookupNearestHMM(u, HMMPosition.__UNDEFINED, false);
this.successors = new SearchStateArc[1];
this.successors[0] = new OutOfGrammarGraph.OogHMMState(outOfGrammarGraph, this.hmm.getInitialState(), 0f);
}
