| Package | Description |
|---|---|
| marytts.cart | |
| marytts.cart.io | |
| marytts.modules |
All the modules doing the actual processing.
|
| marytts.modules.phonemiser | |
| marytts.modules.synthesis |
Internals of the synthesis module.
|
| marytts.tools.newlanguage | |
| marytts.tools.voiceimport | |
| marytts.tools.voiceimport.traintrees | |
| marytts.unitselection | |
| marytts.unitselection.data | |
| weka.classifiers.trees.j48 |
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| DecisionNode
A decision node that determines the next Node to go to in the CART.
|
| DecisionNode.Type |
| DirectedGraph
A directed graph is a layered structure of nodes, in which there are mother-daughter relationships between the node.
|
| DirectedGraphNode
A type of node that can be at the same time a decision node and a leaf node, and that can have more than one mother.
|
| LeafNode
The leaf of a CART.
|
| LeafNode.IntAndFloatArrayLeafNode |
| LeafNode.IntArrayLeafNode
An LeafNode class suitable for representing the leaves of classification trees -- the leaf is a collection of items
identified by an index number.
|
| LeafNode.LeafType |
| Node
A node for the CART or DirectedGraph.
|
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| DirectedGraph
A directed graph is a layered structure of nodes, in which there are mother-daughter relationships between the node.
|
| LeafNode
The leaf of a CART.
|
| LeafNode.LeafType |
| Node
A node for the CART or DirectedGraph.
|
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| DirectedGraph
A directed graph is a layered structure of nodes, in which there are mother-daughter relationships between the node.
|
| StringPredictionTree |
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| Class and Description |
|---|
| DirectedGraph
A directed graph is a layered structure of nodes, in which there are mother-daughter relationships between the node.
|
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| LeafNode
The leaf of a CART.
|
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| DirectedGraph
A directed graph is a layered structure of nodes, in which there are mother-daughter relationships between the node.
|
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| Class and Description |
|---|
| CART
A tree is a specific kind of directed graph in which each node can have only a single parent node.
|
| StringPredictionTree |
Copyright © 2000–2016 DFKI GmbH. All rights reserved.