JPH0531188B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to an apparatus for determining temporal continuity between a certain action and another action in natural language processing.

(Prior art and its problems) Conventional natural language analysis methods, including machine translation, have generally processed single sentences. However, deep understanding of natural language cannot be achieved without context analysis that goes beyond sentences. An object of the present invention is to provide a method and apparatus for determining temporal continuity between two actions performed by a certain operator as part of context understanding.

(Means for Solving the Problems) Further, the motion continuity testing device according to the invention of the present application includes: forward verb storage means for storing an input verb word; a backward verb storage means for storing verb words; candidates for successor verbs that cancel or terminate the action indicated by each verb are registered for each verb; when a verb is input, candidates for successor verbs of the input verb are outputted; a word dictionary; a counter; comparing the value of the forward verb storage means and the value of the backward verb storage means; if they match, it is notified that the processing has been completed; if they do not match, the value of the counter is decreased by 1; If the value of the counter becomes 0, it is notified that the process is interrupted, and if it is not 0, the value of the forward verb storage means is passed to the word dictionary, and the forward verb storage means output from the word dictionary stores it. All successor verb candidates for the verb word are taken in, and each of the successor verb candidates for the verb word stored in the forward verb storage means is compared with the verb word stored in the backward verb storage means, and if they match, the process is terminated. If they do not match, the value of the counter is decremented by 1. If the value of the counter becomes 0, an interruption of the process is notified, and if the value of the counter is not 0, the successor verb candidate is passed to the word dictionary. and means to take in the output of and repeat the matching check again.

(Operation and Principle) The invention of the present application has solved the problems of the prior art by the above means. Next, the functions of the present invention will be explained with reference to the drawings. This will be explained with the following example.

``The rabbit is running.'' ``The rabbit is sleeping.'' In this example, as part of the context analysis, the rabbit is
It is necessary to clarify what movements were performed between ``running'' and ``sleeping''. FIG. 3 is a diagram graphically describing the word dictionary of the present invention. This indicates, for example, that the successor verbs that stop or end ``run'' are ``stop'', ``hit'', and ``fly''. In the method of the present invention, "running"
When we receive a verb, we first check to see if there is a ``sleep'' in its successor verbs, and if there is, we end the process, and if not, we check the successor verb of the successor verb.
That's what I do. In Figure 3, these are the verbs to advance, to lie down, to sit, to break, to fall, to hit, to fall, and to get down. This includes the verb "sleep", so the process ends here. In this example, it was confirmed that "run" and "sleep" are connected through one intermediate action, but depending on the input verb, there may be no temporal continuity between the two verbs. Therefore, in the present invention, the user can set in advance the maximum number of stages for the matching check. In the present invention, the matching check is stopped when the set maximum number of stages is exceeded.

(Example) Hereinafter, the details of the present invention will be explained with reference to Examples.

FIG. 1 is a block diagram showing a first embodiment of the invention of the present application. In FIG. 1, 1 is forward verb storage means for storing verb words, 2 is backward verb storage means for storing verb words, 4 is a counter, and 5 is for storing verbs and stopping the action indicated by each verb in units of verbs. A word dictionary 3 in which candidates for successor verbs to be terminated are registered; 3 checks whether the internally stored data matches the backward verb storage means 2; if they match, the process ends; if they do not match, a backward verb is selected from the word dictionary 5; The successor verb candidates of the data that do not match with the storage means 2 are retrieved from the word dictionary 3 and imported into the memory, and the candidates of the successor verbs of the data that do not match with the backward verb storage means 2 are again checked to see if they match or This is a searcher that repeats the matching test until it reaches the maximum number of repetition stages specified in advance.

The user first sets verbs in the forward verb storage 1 and backward verb storage 2, and sets the maximum number of steps for the coincidence check in the counter 4. The value of the forward verb store 1 in which the verb word is stored is input to the searcher 3,
There, it is compared with the value of the backward verb storage means 2 in which another verb word is stored, and if they match, the process ends normally, and if they do not match, the value of the counter 4 is subtracted by 1 and the value of the counter 4 becomes 0. If the limit number of stages has been reached, the process is interrupted, and if not, candidates for the successor verb of the verb in the forward verb storage 1 are retrieved from the word dictionary 5 and stored in the searcher 3, and the candidate of the successor verb is retrieved from the word dictionary 5. The candidates are compared one by one with the value in the backward verb storage 2, and if they match, the process ends normally. If there is no match, the value of counter 4 is decremented by 1, and if the value of counter 4 becomes 0, it is notified that the limit number of stages has been reached and the process is interrupted. If not, the successor of the successor verb candidate is The verb candidates are retrieved from the word dictionary 5 and stored in the searcher 3, and each of the successor verb candidates is again compared with the value of the backward verb storage 2 to find a match. or until a pre-specified maximum number of matching check repetition stages is reached.

Next, a second embodiment of the second invention of the present application, which is a further embodiment of the embodiment shown in FIG. 1, will be described with reference to the drawings. FIG. 2 is a block diagram showing the second embodiment. The operation continuous testing device shown in FIG.
2 and a match detector 10 that checks for a match between two inputs.
3, 104, a counter 105, which stores a verb word and a candidate for a successor verb that stops or terminates the action indicated by the verb word; Associative memory 106 that outputs candidates and associative memory 1
A constant generator 107 outputs a delimiter that is distinguishable from all the data stored in 06, and
multiplexer 108 that selects the input to 02.

The user previously stores the verb in the registers 100 and 101 and the maximum number of stages of the match check in the counter 105.

Before detailed explanation of FIG. 2, the general flow of the embodiment shown in FIG. 2 will be explained using FIG. 4. As an example of explanation, we will use the example shown in FIG. 3 in which "run" and "sleep" are semantically linked. In Figure 4,
a is the register 101 and queue 1 in FIG.
It represents 02. As the initial state of the process, "sleep" is stored in the register 101, "run" is stored in the queue 102, and the delimiter generated by the constant generator 107 in FIG. 2 is stored. Hereinafter, the constant value output from the constant generator 107 will be expressed as #. First, the first value of Q102, here "run",
is compared with the value of register 101. Since this does not match, "running" is discarded from Kyuu, and "running" is discarded from Kyuu.
A successor verb candidate is added to the end of queue 102. b shows this. Next, Kyu 1
If you check the value at the beginning of 02, it is #. Kyu 10
When the first value of 2 is #, # is added to the tail of queue 102. This is shown by c. In this way, the process of comparing the first value of queue 102 with register 101 is repeated, and each time # is detected, the search for candidates for its successor verb, starting with "run", advances by one stage. . In the example in Figure 3, # is detected twice between the connection between "run" and "sleep", but as can be seen from Figure 3, this is because the # is detected between "run" and "sleep". means that there is a distance of two steps.

Returning to the explanation of FIG. First, multiplexer 1
08 selects the value of register 100 and connects it to signal line 20
0, and the queue 102 takes in the value of the signal line 200. Next, the multiplexer 108 selects the value of the constant generator 107 and outputs it to the signal line 200, and the queue 102 takes in the value of the signal line 200. When the queue 102 stores one or more pieces of data, it outputs the oldest stored data to the signal line 202. When the value on signal line 202 is received by match detector 103, the value is discarded from queue 102. The coincidence detector 103 checks whether the value passed on the signal line 202 and # input via the signal line 203 match. If they match, the value of the counter 105 is decremented by 1 and # is output to the signal line 204. The multiplexer 108 selects the signal line 204 and outputs it to the signal line 200, and the cue 102 selects the signal line 204.
The value of 0 is taken in, but if it does not match, the signal line 20
The value of 2 is passed as is to the coincidence detector 104 via the signal line 205. When the counter 105 reaches 0, it notifies the signal line 201 that the processing has reached the limit number of times. The coincidence detector 104 compares the value of the signal line 205 with the value of the register 101 passed through the signal line 206, and if they match, outputs to the signal line 209 that the processing has ended. If they do not match, signal line 2
07, the value of the signal line 205 is output as is. The associative memory 106 uses the value of the signal line 207 as a key and outputs the corresponding value to the signal line 208, and the multiplexer 108 selects the value of the signal line 208 and outputs the corresponding value to the signal line 208.
00, and the queue 102 takes in the value of the signal line 200.

(Effects of the Invention) As explained in detail above, according to the invention of the present application, by determining the temporal continuity between a certain motion and another motion in natural language processing, complex motions in animation can be This makes it possible to realize a smooth flow of columns, and in document understanding systems, it becomes part of the context understanding function that infers content that is not explicitly stated in the input text, improving comprehension. I can do it.

[Brief explanation of the drawing]

Figure 1 is a block diagram showing a first embodiment of the invention of the present application, Figure 2 is a block diagram of a second embodiment of the second invention of the present application, and Figure 3 is a word dictionary used in the invention of the present application. FIG. 4 is a diagram illustrating the concept of processing in the embodiment of FIG. 2. In FIG. 1, 1 is a forward verb storage means, 2 is a backward verb storage means, 3 is a searcher, 4 is a counter,
5 is a word dictionary. In FIG. 2, 100,
101 is a register, 102 is a queue, 103,1
04 is a coincidence detector, 105 is a counter, 106 is an associative memory, 107 is a constant generator, 108 is a multiplexer, 200, 201, 202, 203, 2
04, 205, 206, 207, 208, 209
is a signal line.

Claims (1)

[Claims] 1. Forward verb storage means for storing an input verb word; Backward verb storage means for storing a verb word input next to the input verb word; and whether to stop the action indicated by each verb on a verb basis a word dictionary that outputs candidates for successor verbs of the input verb when a candidate for a successor verb to be terminated is registered and a verb is input; a counter; a value in the forward verb storage means and a value in the backward verb storage means. If they match, it will be notified that the process has ended; if they do not match, the value of the counter will be decremented by 1; if the value of the counter becomes 0, it will be notified that the process is interrupted; if it is not 0, the forward verb The value of the storage means is passed to the word dictionary, and all successor verb candidates of the verb word stored in the forward verb storage means outputted from the word dictionary are taken in, and the successor verb of the verb word stored in the forward verb storage means is taken in. Each of the candidates is compared with the verb word stored in the backward verb storage means, and if they match, it is notified that the processing has ended, and if they do not match, the value of the counter is decremented by 1 and the value of the counter is 0.
If the verb becomes 0, it notifies the interruption of processing, and if it is not 0, the successor verb candidate is passed to the word dictionary, the output of the word dictionary is taken in, and the matching test is repeated again.