Each terminal node represents a single production, and each WME list that arrives at a terminal node represents a complete set of matching WMEs for the conditions in that production.
32.
Each terminal node represents a single production, and each WME list that arrives at a terminal node represents a complete set of matching WMEs for the conditions in that production.
33.
As the data is compressed, and the decompression algorithm is not publicly known, the contents of PACTOR transmissions are unreadable to anyone without a PACTOR capable terminal node controller.
34.
In the second step, the empty terminal nodes are filled with complex symbols consisting of morphemes accompanied by syntactic and semantic features, supplied from the lexicon via lexical insertion rules.
35.
Traditionally, the computer and modem are combined in one unit, the terminal node controller ( TNC ), with a dumb terminal ( or terminal emulator ) used to input and display data.
36.
Impoverishment ( a term introduced into the theory in Bonet 1991 ) refers to a change in the feature content on a terminal node prior to Vocabulary Insertion, resulting in a less marked feature content.
37.
The root node passes each WME on to its child nodes, and each WME may then be propagated through the network, possibly being stored in intermediate memories, until it arrives at a terminal node.
38.
The numbers by every terminal node represent the payoffs to the players ( e . g . 2, 1 represents a payoff of 2 to player 1 and a payoff of 1 to player 2 ).
39.
A node X is a MWd iff X is the highest segment and X is not contained in another X . A node X is a SWd if X is a terminal node and not an MWd.
40.
The PORS language consists of two terminal nodes ( 1 and recall ), one unary operation ( store ) and one binary operation ( plus ) that together make up a parse tree that calculates a number.
