Method for creating a disjunctive edge graph from subtrees durin

Details Method for creating a disjunctive edge graph from subtrees durin Method for creating a disjunctive edge graph from subtrees durin

1998-06-18

2000-05-16

Isen, Forester W.

Data processing: speech signal processing, linguistics, language

Linguistics

Natural language

704 10, G06F 1727, G06F 1721

Patent

active

060649534

ABSTRACT:
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.

REFERENCES:
patent: 5438511 (1995-08-01), Maxwell, III
patent: 5727222 (1998-03-01), Maxwell, III

Affiliated with

Also associated with

Rating

Method for creating a disjunctive edge graph from subtrees durin does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for creating a disjunctive edge graph from subtrees durin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for creating a disjunctive edge graph from subtrees durin will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-267516