11. Fission refers to the splitting of one terminal node into two distinct terminal nodes prior to Vocabulary Insertion. 12. Fission refers to the splitting of one terminal node into two distinct terminal nodes prior to Vocabulary Insertion. 13. A leaf node, however, is a terminal node that does not dominate other nodes in the tree. 14. This list specifies interpretive operations that realize in a semantic sense the terminal nodes of a complete syntactic derivation. 15. The phonological exponents of the feature bundle terminal nodes in the syntactic tree are listed in the Exponent List. 16. Decision trees have three types of nodes : a root node, internal nodes, and leaf or terminal nodes . 17. Each beta node outputs WME lists which are either stored in a beta memory or sent directly to a terminal node . 18. Every tree node has an operator function and every terminal node has an operand, making mathematical expressions easy to evolve and evaluate. 19. Typically this is produced by arranging the terminal nodes " downwards " on the page in order of their evolutionary divergence. 20. In some cases, terminal nodes may have more than one network address, for example, each link interface may be uniquely identified.
