Back to results
US 6,064,953 AGranted
Method for creating a disjunctive edge graph from subtrees during unification
AssigneeXerox Corporation
InventorsJohn T. Maxwell, III, Ronald M. Kaplan
Life of this patent
Estimating the term…
Loading patent…
Loading patent…
AssigneeXerox Corporation
InventorsJohn T. Maxwell, III, Ronald M. Kaplan
Estimating the term…
A method of unifying edge data structures using a processor. The method begins with creation of a first edge data structure and unifying it with a second edge data structure. If during unification any of the contexted lazy copy links associated with the second graph data structure are activated, then second graph data structure is expanded. Expansion involves first selecting a contexted lazy copy link from among the contexted lazy copy links associated with the second graph data, selecting a selected attribute from the subtree feature structure pointed to by the selected contexted lazy copy link, making a copy of the selected attribute and storing the copy of the selected attribute in the second graph data structure as a second attribute, and adding a contexted lazy copy link from the second attribute to the selected attribute value.
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:
A method for using a processor to construct a graph for an edge from a plurality of graphs associated with a corresponding plurality of subtrees in a natural language processing system, the processor implementing the method by executing instructions stored in a memory, the method comprising the steps of:
Dependencies are inferred from the claim text.