Examples of GrammarArc

edu.cmu.sphinx.linguist.language.grammar.GrammarArc
Represents a single transition out of a grammar node. The grammar represented is a stochastic grammar, each transition has a probability associated with it. The probabilities are relative and are not necessarily constrained to total 1.0.
Note that all probabilities are maintained in the LogMath log base

Examples of edu.cmu.sphinx.linguist.language.grammar.GrammarArc

            GrammarArc[] nextNodes = node.getSuccessors();
            nextNodes = filter(nextNodes, nextBaseID);
            SearchStateArc[] nextArcs = new SearchStateArc[nextNodes.length];


            for (int i = 0; i < nextNodes.length; i++) {
                GrammarArc arc = nextNodes[i];
                nextArcs[i] = new GrammarState(arc.getGrammarNode(),
                        arc.getProbability(), lc, nextBaseID);
            }
            return nextArcs;
        }

View Full Code Here

Examples of edu.cmu.sphinx.linguist.language.grammar.GrammarArc

      GrammarArc[] nextNodes = node.getSuccessors();
      nextNodes = filter(nextNodes, nextBaseID);
      SearchStateArc[] nextArcs = new SearchStateArc[nextNodes.length];


      for (int i = 0; i < nextNodes.length; i++) {
        GrammarArc arc = nextNodes[i];
        nextArcs[i] = new GrammarState(arc.getGrammarNode(), arc
            .getProbability(), lc, nextBaseID);
      }
      return nextArcs;
    }

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.