![]() |
Edinburgh Speech Tools
2.1-release
|
![]() |
Functions | |
EST_Item * | parent (const EST_Item *n) |
return parent of n | |
EST_Item * | daughter1 (const EST_Item *n) |
return first daughter of n | |
EST_Item * | daughter2 (const EST_Item *n) |
return second daughter of n | |
EST_Item * | daughtern (const EST_Item *n, int nth) |
return nth daughter of n | |
EST_Item * | daughtern (const EST_Item *n) |
return last daughter of n | |
EST_Item * | next_sibling (const EST_Item *n) |
return next sibling (sister) of n | |
EST_Item * | prev_sibling (const EST_Item *n) |
return previous sibling (sister) of n | |
EST_Item * | root (const EST_Item *n) |
return root node of treeprevious sibling (sister) of n | |
EST_Item * | parent (const EST_Item *n, const char *relname) |
return parent of n as seen from relation relname | |
EST_Item * | daughter1 (const EST_Item *n, const char *relname) |
return first daughter of n as seen from relation relname | |
EST_Item * | daughter2 (const EST_Item *n, const char *relname) |
return second daughter of n as seen from relation relname | |
EST_Item * | daughtern (const EST_Item *n, const char *relname) |
return last daughter of n as seen from relation relname | |
EST_Item * | next_sibling (const EST_Item *n, const char *relname) |
return next sibling (sister) of n as seen from relation relname | |
EST_Item * | prev_sibling (const EST_Item *n, const char *relname) |
return previous sibling (sister) of n as seen from relation relname | |
EST_Item * | root (const EST_Item *n, const char *relname) |
return root of tree of n as seen from relation relname | |
EST_Item * | first_leaf_in_tree (const EST_Item *root) |
EST_Item * | last_leaf_in_tree (const EST_Item *root) |
EST_Item * | first_leaf (const EST_Item *n) |
return the first leaf (terminal node) which is dominated by n . Note that this is different from daughter1 etc as this descends the tree to find the leftmost terminal node (it is like the transitive closure of daughter1). | |
EST_Item * | last_leaf (const EST_Item *n) |
EST_Item * | next_leaf (const EST_Item *n) |
int | num_leaves (const EST_Item *n) |
int | in_tree (const EST_Item *c, const EST_Item *t) |
return the last leaf (terminal node) which is dominated by n
. Note that this is different from daughter1 etc as this descends the tree to find the right terminal node (it is like the transitive closure of daughtern).
Definition at line 129 of file EST_Relation_tree.h.
Return next leaf in tree given n
. If n
is a terminal node, next_leaf() will return the next leaf in the tree. If n
is not terminal, this will return the leftmost terminal node dominated by n
. This will return 0 only when the last leaf in the relation has been passed.
Definition at line 138 of file EST_Relation_tree.h.
int num_leaves | ( | const EST_Item * | n | ) |
Return number of leaves (terminal nodes) under n
Definition at line 651 of file EST_Relation.cc.
Given a node t
, return true if c
is under it in a tree
Definition at line 57 of file item_aux.cc.