METHOD FOR CONNECTING 1ST AND 2ND CLAUSES AS ONE PART OF UNIFICATION OF 1ST GRAPH WHILE USING PROCESSOR

摘要

PROBLEM TO BE SOLVED: To unify nodes each other during the unification of feature data structure so that a machine can analyze a natural language without requiring exponential functional time. SOLUTION: This method determines whether a 1st clause including plural clauses is related to a 1st graph or not and when the 1st clause is related to the 1st graph, a non-clear 3rd clause having a pointer corresponding to the 1st clause is prepared and connected with a 2nd clause. Further, this method determines whether the 2nd clause is non-clear or not and when the 2nd clause is non-clear, it is determined whether the 2nd and 3rd clauses are related to the same graph or not. When the 2nd clause is non-clear and the 2nd and 3rd clauses are related to the same graph, the 1st clause is provided by canceling the 3rd clause, a non-clear 4th clause is provided by canceling the 2nd clause, non-clear 5th clause is prepared by connecting the 1st and 4th clauses, and a non-clear 6th clause having a pointer corresponding to the 5th clause is prepared.