Examples of com.sun.speech.freetts.cart.CARTImpl

• com.sun.speech.freetts.cart.CARTImpl
  Implementation of a Classification and Regression Tree (CART) that is used more like a binary decision tree, with each node containing a decision or a final value. The decision nodes in the CART trees operate on an Item and have the following format:

   NODE feat operand value qfalse  

  Where feat is an string that represents a feature to pass to the findFeature method of an item.

  The value represents the value to be compared against the feature obtained from the item via the feat string. The operand is the operation to do the comparison. The available operands are as follows:

  • < - the feature is less than value
  • = - the feature is equal to the value
  • > - the feature is greater than the value
  • MATCHES - the feature matches the regular expression stored in value
  • IN - [[[TODO: still guessing because none of the CART's in Flite seem to use IN]]] the value is in the list defined by the feature.

  [[[TODO: provide support for the IN operator.]]]

  For < and >, this CART coerces the value and feature to float's. For =, this CART coerces the value and feature to string and checks for string equality. For MATCHES, this CART uses the value as a regular expression and compares the obtained feature to that.

  A CART is represented by an array in this implementation. The qfalse value represents the index of the array to go to if the comparison does not match. In this implementation, qtrue index is always implied, and represents the next element in the array. The root node of the CART is the first element in the array.

  The interpretations always start at the root node of the CART and continue until a final node is found. The final nodes have the following form:

   LEAF value 

  Where value represents the value of the node. Reaching a final node indicates the interpretation is over and the value of the node is the interpretation result.

Related Classes of com.sun.speech.freetts.cart.CARTImpl