JP3037776B2 - Term decomposition device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a term decomposing device for decomposing an input word input as a system specification into units capable of recognizing the specification.

[0002]

2. Description of the Related Art Recently, in order to generate a program that meets the requirements of a target system, for example, a process control system, system requirements are input as system specifications and based on the contents expressed in the input specifications. A program automatic generation device that automatically generates a program by using the program has been developed. In order to analyze the system specifications, the automatic program generation device uses a term decomposition device that decomposes input words input as system specifications into units that can be easily understood as specifications. FIG. 6 shows a configuration example of such a term decomposition apparatus.

The term decomposition apparatus 1 includes a term dictionary 2 in which terms to be decomposed are registered in advance. When an input word 3 describing system specifications is received from a higher-level processing system, a term registered in the term dictionary 2 is received. According to the following. This decomposition process reads the input word 3 in order from the first character,
A word that matches the read partial character string is searched from the term dictionary 2 and decomposed for each longest character string. The decomposed term is returned to an upper processing system as an output word 4 together with the attribute of the term. The specific operation of the term decomposition device 1 will be described with reference to FIG.

[0004] When the term decomposition device 1 receives the input word 3-1 of “advance intermediate position” from a higher-level processing system, it searches the term dictionary 2 for a word that matches the partial character string from the beginning. The longest term is selected from the searched character strings (terms) and cut out from the input word 3-1. In the case shown in the figure, "forward" is selected and cut out from "forward intermediate position", and a character string search T from the term dictionary 2 is further performed on the remaining character string "intermediate position". As a result, the "advance intermediate position" is decomposed into "advance" + "intermediate position", and is combined with the respective attributes {operation} and {position} to form upper words as output words 4-1 and 4-2. Is returned to the processing system.

The term decomposition apparatus 1 has only a function of faithfully decomposing the input words 3 in accordance with the terms registered in the term dictionary 2. It is necessary to register all the words with the term in the word dictionary 2.

However, there are an enormous number of terms used in the system specifications, and an extremely large amount of labor is required to register and manage all the terms in the term dictionary 2. For example, for the basic term "forward", there are combinations such as "forward", "forward position", "forward detection", "forward command", and likewise, for "reverse", There are combinations such as “during retreat”, “retreat position”, “retreat detection”, and “retreat command”. In the conventional term decomposition apparatus 1, all of these combinations must be registered in the term dictionary 2.

[0007] Further, when a certain term to be decomposed and another term partially including the term are registered in the term dictionary 2, they are read in spite of the fact that they should be decomposed into the other terms. However, if a substring accidentally matches the shorter term, there is a problem that it cannot be correctly decomposed. For example, if the input word 3 is “forward intermediate position”,
If “forward”, “in progress”, and “intermediate position” are registered in the term dictionary 2, the combination to be decomposed is “forward”
In fact, despite being at the “intermediate position”, it is actually decomposed into “forward” + “intermediate position”.

In order to prevent such inaccurate term decomposition, it is conceivable to use a parsing apparatus developed for a translation machine or the like. In general, the mechanism is complicated and large-scale, and preparing data for incorporation into an automatic program generation device such as a term decomposition device requires a great deal of labor and is not realistic.

[0009]

As described above, the conventional term decomposer has to register an enormous number of terms in a term dictionary, requires a great deal of labor, and cannot decompose input words accurately. There was a possibility.

[0010] The present invention has been made in view of the above circumstances, and can significantly reduce the number of terms to be registered in the term dictionary, reduce labor, and accurately decompose input words. It is an object of the present invention to provide a term decomposition apparatus which can improve the reliability of the apparatus.

[0011]

In order to achieve the above object, the present invention comprises a term dictionary in which terms used for expressing a system specification according to a request of a target system and attributes thereof are stored, A system specification expressed by combining the terms is given as an input word, and a term decomposing device that decomposes the input word into predetermined units based on the term dictionary defines an arrangement rule of terms that must not be decomposed. A decomposition prohibition pattern storing means in which the decomposition prohibition pattern is stored, and an arrangement rule of a term which includes the term array defined by the decomposition prohibition pattern but can be decomposed by being combined with a predetermined term is defined. Decomposable pattern storage means storing a decomposable pattern, and decomposing means for decomposing the input word with reference to the decomposition prohibition pattern and the decomposable pattern. It was Bei configuration.

[0012]

According to the present invention, by taking the above measures, terms that can be decomposed according to the term dictionary are extracted from the input words that have been input, and then the terms are determined based on the decomposition prohibition pattern and the decomposable pattern. It is determined whether the term extracted from the dictionary is decomposable, and is decomposed only if the term is decomposable. Therefore, only a basic term is registered in the term dictionary, and a character string partially including a basic term that modifies the basic term is used as a decomposition prohibition pattern and a decomposable pattern. By registering in the decomposable pattern storage means, it is possible to deal with any input word and to decompose accurately, and the number of registered terms is greatly reduced.

[0013]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, a term decomposition apparatus according to one embodiment of the present invention will be described.

FIG. 1 shows a term decomposition apparatus 1 according to one embodiment.
0 functional blocks are shown. In this embodiment,
This is an example in which the term decomposition device 10 is used for an automatic program generation device.

The term decomposition apparatus 10 includes an apparatus main body 11 for executing a term decomposition process described later,
, A term dictionary 11, a disintegration prohibition pattern storage unit 12, and a decomposable pattern storage unit 13 which are respectively connected to the system.

The apparatus main body 11 is supplied with an input word to be decomposed from the high-level processing system 15 and operates to return the decomposed term as an output word to the high-level processing system 15 based on the flowcharts shown in FIGS. . In the term dictionary 12, basic terms used in the system specifications are registered together with their attributes.

The disintegration prohibition pattern storage means 13 is provided in FIG.
As shown in (a), an arrangement rule that cannot be decomposed by the first element, the second element, and the third element, that is, a decomposition prohibition pattern is determined, and the attribute is registered for each decomposition prohibition pattern. For example, <STRING>,
If "Medium" is registered, <STRING> and "Medium"
Shall not be disassembled. Where <STRING
> Indicates only a simple character string that does not specify a specific word, so this one decomposition prohibition pattern specifies the prohibition of decomposing multiple terms such as "move forward" and "march" Will be. Therefore, the terms included in the decomposition prohibition pattern are deleted from the registration in the term dictionary 12. Such a decomposition prohibition pattern is defined for a specific term that may be erroneously decomposed, and is stored in a pattern as shown in FIG.

The decomposable pattern storage means 14 is provided in FIG.
As shown in (b), it is composed of a front element and a rear element,
An arrangement rule that can be decomposed, that is, a decomposition prohibition pattern is included in a part of the character string, but a decomposable pattern is defined. For example, if <intermediate> follows <STRING>, then <STRING>
+ “Medium” corresponds to the above decomposition prohibition pattern, but “Medium”
If "interval" comes immediately after "<STRING>" and "medium"
Can be disassembled. Such decomposable patterns are also determined corresponding to the decomposition prohibition patterns.

That is, <STRING> + “medium” or <STRING
Even a term that is not registered in the term dictionary 12 such as> + “intermediate” can be decomposed by using the above-mentioned decomposition prohibition pattern and decomposable pattern. Therefore, the number of terms registered in the term dictionary 12 is reduced.

The high-level processing system 15 receives the system specifications from the system specification input means 16 and decomposes the terms determined to need to be analyzed in terms of their meaning in creating a program as terminology. Give to device 10. Further, it receives the terms and their attributes that have been programmatically decomposed by the term decomposer 10 and outputs a program 17. Next, the operation of the present embodiment configured as described above will be described.

When the input word is received from the high-level processing system 15, the term decomposition device 10 decomposes the input word into units of specific meaningful terms in accordance with the terms registered in the term dictionary 12. These decomposed terms are returned to the high-level processing system 15 as output words together with the attributes of the terms. At this time, the device main body 11 decomposes the input word with reference to the decomposition prohibition pattern and the decomposable pattern, and
The terms that are not registered are also decomposed in the same way as the registered terms.

FIG. 3 is a flowchart showing the term decomposition processing in the apparatus main body 11. When the input word changed from the higher-level processing system 15 or in the term decomposition device 10 is provided, the device main body 11 determines the character string length (step C1) and determines whether the character string length is greater than 0. Performs input word decomposition processing.

In the decomposition process of the input word, first, it is searched whether or not a character string completely matching the input word is defined in the term dictionary 12 (step C2).
The input word and the attribute added to the word are set as one of the output words, and the decomposition process ends (step P3).

In the search in step C2, if not defined, the input word is read one character at a time from the beginning, a word matching the partial character string is searched from the term dictionary 12, and the longest word among the corresponding words is searched. The character string is set as an output word candidate (step P1).

If the output word candidate cannot be determined in step P1, the input word is set as one of the output words with the attribute undecided, and the disassembly process is terminated (step P3). If the output word candidate can be determined,
Decompose terms based on decomposition prohibition patterns and decomposable patterns, determine output words, cut out the character strings from input words, and at the same time secure the attributes added to the character strings, and leave the remaining character strings As a new input word (step P
2).

When the decomposition process is completed in this way, the output words determined so far and the attributes added to those words are put together and returned to the higher-level processing system 15 that called up the term decomposition process ( Step P4). Step P2 above
FIG. 4 shows the details of the processing in.

When the process in step P2 is started, first, the length of the character string which is the output word candidate determined in step P1 or changed in the present process step P2, and the character string of the input word Compare the lengths (Step C
4) If they are equal, the output word candidate is cut out from the input word as one of the output words, the added attribute is secured, and the process is terminated with the remaining character strings as new input words (step P6). ).

If the character string of the output word candidate is shorter in step C4, the character string which is the output word candidate is the character string defined by the decomposition prohibition pattern stored in the decomposition prohibition pattern storage means 13. Is determined (step C5). If not, an output word candidate is cut out from the input word as one of the output words, the added attribute is secured, and the remaining characters are obtained. The process ends with the column as a new input word (step P6).

If the pattern corresponds to the decomposition prohibition pattern in step C5, the character string which is a candidate for an output word is further defined by the character string pattern defined by the decomposable pattern stored in the decomposable pattern storage means 14. Is determined (step C6). If the pattern does not correspond to a decomposable pattern, the character string of the portion corresponding to the decomposition prohibition pattern is set as a new output word candidate, and its attribute is registered in the decomposition prohibition pattern. The disassembly process is prohibited because the attribute is regarded as the attribute (step P5).

If the pattern corresponds to the decomposable pattern in step C6, the length of the character string corresponding to the decomposable pattern is compared with the length of the character string corresponding to the decomposable pattern (step C7). If the length of the corresponding character string is longer, the character string of the part corresponding to the decomposition prohibition pattern is set as a candidate for a new output word, and the attribute is regarded as an attribute registered in the decomposition prohibition pattern. (Step P5). If the length of the character string corresponding to the decomposable pattern is longer, the output word candidate is cut out from the input word as one of the output words, and the remaining character strings are used as new input words, and the decomposition process ends. Step P6). For example, a case where the “forward intermediate position” is decomposed as an input word will be described with reference to FIG.

When the term decomposition device 10 receives the word “forward intermediate position” as the input word 20 from the host processing system 15, it first searches whether or not the word “forward intermediate position” is registered in the term dictionary 12. . In the example of FIG. 7, since the word is not registered, the process proceeds to step P1, and a search is made as to whether a word that matches the partial character string from the head of the “forward intermediate position” is registered in the term dictionary 12. In this example,
The term “forward” is searched from the term dictionary 12.

This “advance” is compared with a decomposition prohibition pattern as an output word candidate. At this time, since “middle” follows “forward”, it corresponds to <STRING> + “medium” defined as a decomposition prohibition pattern. Furthermore, comparison with a decomposable pattern is performed.
Since the character string following “forward” is “middle”, it corresponds to <STRING> + “middle” defined in the decomposable pattern.

When the length of the character string corresponding to the decomposable pattern is compared with the length of the character string corresponding to the decomposable pattern, it is clear that the character string corresponding to the decomposable pattern is longer. It is decided to decompose between "forward" and "intermediate", and a set of the output word candidate "forward" and the attribute {action} registered in the term dictionary 12 is output word 2
As one of 1-1, the character string “forward” is cut out from the input word 20 “forward intermediate position”, and the remaining character string “intermediate position” is extracted.
Is a new input word 20.

Subsequently, when the new input word 20 "intermediate position" is decomposed into terms and the term dictionary 12 is searched, it is understood that the partial character string "intermediate" can be a candidate for an output word. Next, a comparison between the decomposition prohibition pattern and the decomposable pattern reveals that the pattern corresponds to <STRING> + “position” defined in the decomposition prohibition pattern.
A set of the attribute {position} registered in the decomposition prohibition pattern is defined as one of the output words (21-2).

As described above, the input word 20 of "forward intermediate position" is decomposed into two output words 21- and 21-2 of "forward" + "intermediate position". It is returned to the host processing system 15.

As described above, according to the present embodiment, the input words are decomposed with reference to the term prohibition pattern and the decomposable pattern, so that only the basic terms are stored in the term dictionary 12. By simply storing the input words, the input words not directly stored in the term dictionary 12 can be decomposed, and the number of terms to be stored can be reduced. As a result, the term dictionary 1
2 can be easily registered and managed, and labor can be reduced.

Further, since a long character string containing a word to be actually decomposed is less likely to be registered in the term dictionary 12, the long character string registered in the dictionary matches the partial character string of the input word. This is almost impossible, and even if there is such a coincidence, the decomposition is strictly prohibited by the decomposition prohibition pattern, and accurate decomposition can be performed.

It should be noted that the present invention is not limited to the above-described embodiment, but can be applied to other than an automatic program creating device as long as the application requires term decomposition of system specifications.

[0039]

As described in detail above, according to the present invention, the number of terms to be registered in the term dictionary can be greatly reduced, labor can be reduced, and input words can be accurately decomposed. A term decomposition device capable of improving the reliability of the device can be provided.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a schematic configuration of a term decomposition apparatus according to an embodiment of the present invention.

FIG. 2 is a configuration diagram of a decomposition prohibition pattern storage unit and a decomposable pattern storage unit provided in the term decomposition device according to one embodiment.

FIG. 3 is an operation explanatory diagram relating to term decomposition processing of the term decomposition device according to one embodiment;

FIG. 4 is a more detailed operation explanatory diagram of the term decomposition apparatus according to the embodiment;

FIG. 5 is a view for explaining term decomposition processing of the term decomposition apparatus according to one embodiment using specific data.

FIG. 6 is a functional block diagram of a conventional term decomposition apparatus.

FIG. 7 is an explanatory diagram of the operation of the term decomposition device shown in FIG. 6;

[Explanation of symbols]

10: Term decomposition device, 11: Term decomposition device body, 12:
Term dictionary, 13: disassembly prohibition pattern, 14: disassembly pattern, 15: host processing system, 16: system specification input means,
17 Program.

Claims (1)

(57) [Claims] 1. A system according to claim 1, further comprising: a term dictionary storing terms used for expressing a system specification corresponding to a request of a target system and attributes thereof, wherein a system specification expressed by combining said terms is used as an input word. Given, in a term decomposer that decomposes the input word into predetermined units based on the term dictionary, a decomposition prohibition pattern storage means storing a decomposition prohibition pattern that defines an arrangement rule of terms that should not be decomposed, Decomposable pattern storage means that includes a term array defined by the decomposition prohibition pattern, but stores a decomposable pattern that defines an arrangement rule of terms that can be decomposed by being combined with a predetermined term, A term decomposer for decomposing the input word with reference to the decomposable pattern and the decomposable pattern.