| 11. | Now our index in the child node is the rank of the respective bit in the parent node.
|
| 12. | A degenerate tree is a tree where for each parent node, there is only one associated child node.
|
| 13. | This prevents the need to recall the parent nodes into memory, which may be expensive if the nodes are on secondary storage.
|
| 14. | Note that each parent node ( relative superordinate concept ) contains all the objects contained by its child nodes ( relative subordinate concepts ).
|
| 15. | For tree automata, transition rules are rewrite rules; and for top-down ones, the left-hand side will be parent nodes.
|
| 16. | If this is the case, the parent node should not choose this node, because it will make the score for the parent node worse.
|
| 17. | If this is the case, the parent node should not choose this node, because it will make the score for the parent node worse.
|
| 18. | Because those nodes are deleted, the SMA * also has to remember the f-cost of the best forgotten child with the parent node.
|
| 19. | Its parent nodes corresponds to a non-terminal symbol ( e . g . a noun phrase or a verb phrase ) in the rule set.
|
| 20. | A binary tree has parent nodes and child nodes, but isotopes, languages, and, delightfully, cysts, can all be mothers and daughters.
|
