...work
Research reported in this paper was supported in part by Contract MDA904-92-C-5189 from the U.S. Department of Defense.
...1990).
For instance, Nagao eliminates an ownership meaning on the basis that a file-system is not a human agent. As shown in the next section, metonymy and other figurative language often overrides such constraints.
...synthesis.
Freuder's algorithm does not have this disadvantage, because all combinations of variables are created, though at great expense.
...nodes.
It should be pointed out that sometimes second order nodes are used in SS-GATHERER, if the dependency structure calls for them. Incidentally, there is nothing special about third-order nodes in SS-GATHERER, although NL constraints seem to produce them the most. It is quite possible that even higher-order nodes could be the starting point.
...consistent
If one circle has a Plan1 with the assignment <A,X> (value X assigned to variable A) and another Circle has a Plan2 with the assignment <A,Y>, then Plan1 and Plan2 are not consistent and cannot be combined.
...O(),
Combining n variables each with a possible values.
...constant
10#10, where x is the number of variables in Incoming-Non-Circles, usually 1 or at most 2, except for base circles.
...reduced
By ``fully reduced'' we mean all child variables maximized with respect to a single parent, which cannot be reduced because it connects higher up in the tree.
...b.
``Long-distance'' dependencies do exist, but are relatively rare.
...plans
The total number of plans corresponds to the total number of word senses for all the words in the sentence.

Steve Beale
Tue Oct 1 10:17:37 MDT 1996