3. The method of claim 1, further comprising the step of repeating the associating and incorporating steps for each subtree in the plurality of subtrees.
1. A method for constructing a graph for an edge from a plurality of graphs associated with a corresponding plurality of subtrees in a natural language processing system, the method comprising the steps of: creating a first graph for the edge, wherein the first graph is empty upon creation; creating a disjunct within the first graph by producing a plurality of contexted variables representative of the plurality of graphs associated with the corresponding plurality of subtrees, wherein the disjunct has a number of disjunctions equal to the number of subtrees; associating a selected subtree graph, chosen from the plurality of graphs associated with the corresponding plurality of subtrees, with a first available disjunction in the first graph; and incorporating information derived from the selected subtree graph into the associated disjunction of the first graph.