JP6958884B1 - Program code automatic generation system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To fundamentally change the mechanism of program development and prevent a chronic shortage of SE engineers from having a great impact on society in the near future. SOLUTION: A reception means for receiving input of text data via a voice or an input terminal, an instruction operation by analyzing the text data in a natural language, an extraction means for extracting a case component composed of a target case, and an execution operation. Search for a table, a storage means for storing the target case table, an execution action instruction corresponding to an instruction action, and an execution action target corresponding to the target case by referring to the execution action table and the target case table. By substituting the execution operation instruction and the execution operation target searched by the above search means into the means and the basic syntax of the program code, the program code for executing the execution operation specified in the execution operation instruction for the execution operation target. It is provided with a code generation means for generating the above. [Selection diagram] Fig. 2

Description

The present invention relates to an automatic program code generation system that fundamentally changes the mechanism of program development.

In recent years, technologies related to RPA (Robotic Process Automation) and the like have been attracting attention as a means for realizing work assistance such as desk work (routine work). As such a technique, for example, an information processing device of Patent Document 1 has been proposed.

The information processing device of Patent Document 1 has an acquisition unit that acquires user message information, an extraction unit that extracts task information related to the user from the acquired message information, and a task information from the extracted task information. An identification unit that identifies a person in charge and a related person, and a classification unit that classifies the task information into first task information in which the user is the person in charge, or second task information in which the user is the related person. It is characterized by including a registration unit for registering the classified first or second task information in a database, and an output unit for outputting the first or second task information with reference to the database.

Japanese Unexamined Patent Publication No. 2019-16280

By the way, in order to automatically execute a new business by a program, it is necessary to create a program. Conventionally, as a program creation process, a process of defining requirements for the new business, designing a system, coding a program code, and then testing and verifying the program code is required. Such program code was usually manually coded each time a new business was created.

However, with the rapid progress of IT in recent years, the demand for program creation continues to increase, and the shortage of IT engineers has become a serious social problem.

In addition, even one simple task in the company may have to be changed at any time depending on the situation. For example, even if you create a program so that you can automatically perform in-house work such as "send a daily report to the PC of employee XX", you have to recreate the program code if there is any change in the work. It disappears.

Although there have been such problems in the past, the more serious problem is that it is predicted that a chronic shortage of SE engineers will have a tremendous impact on society in the near future.

Therefore, the present invention has been devised in view of the above-mentioned problems, and an object of the present invention is to execute the business in order to automatically execute the business in the computer system. When generating a program code, it is extremely easy, and even if you do not have the technical skills as an SE, if you are a field person who is proficient in the work, you can easily give instructions and use a person with SE skills. It is possible to automatically generate program code without any problems, and it is possible to radically change the mechanism of program development and avoid a chronic shortage of SE engineers from having a huge impact on society in the near future. It is to provide a generation system.

The first program code automatic generation system according to the present invention is an instruction operation by a reception means that accepts input of text data via voice or an input terminal and a natural language analysis of the text data received by the reception means. And the extraction means that extracts the case component consisting of at least the target case related to this, the execution action table associated with the actual execution action instruction for the reference instruction action, and the actual execution action target for the reference target case. The storage means for storing at least the object case table associated with the data, the execution operation instruction corresponding to the extracted instruction operation, and the execution operation target corresponding to the extracted object case are stored by the storage means. By substituting the execution action instruction and the execution action target searched by the above search means into the search means searched by referring to the execution action table and the target case table and the basic syntax of the program code, the execution concerned. The operation target is provided with a code generation means for automatically generating a program code for executing the execution operation specified in the execution operation instruction, and the execution operation table has three or more stages of actual execution operation instructions for the reference instruction operation. The search means is stored in the storage means, and the search means stores the execution action instructions corresponding to the extracted instruction actions in the execution action table stored in the storage means. Search by referring to the degree of association, and in the target case table, the data of the target case for reference on the input side and the data of the execution operation target on the output side are prepared as data sets linked to each other. It is characterized by.
The second program code automatic generation system according to the present invention is an instruction operation by a reception means that accepts input of text data via voice or an input terminal and a natural language analysis of the text data received by the reception means. And the extraction means that extracts the case component consisting of at least the target case related to this, the execution action table associated with the actual execution action instruction for the reference instruction action, and the actual execution action target for the reference target case. The storage means for storing at least the object case table associated with the data, the execution operation instruction corresponding to the extracted instruction operation, and the execution operation target corresponding to the extracted object case are stored by the storage means. By substituting the execution action instruction and the execution action target searched by the above search means into the search means searched by referring to the execution action table and the target case table and the basic syntax of the program code, the execution concerned. The operation target is provided with a code generation means for automatically generating program code for executing the execution operation specified in the execution operation instruction, and the target case table has three or more stages of actual execution operation targets for the reference target case. It is associated with each other by the degree of association and is stored in the storage means, and the search means stores the execution operation target corresponding to the extracted target case in the target case table stored by the storage means. Search by referring to the degree of association, and in the execution operation table, the data of the reference instruction operation on the input side and the data of the execution operation instruction on the output side are prepared as data sets linked to each other. It is characterized by.

According to the above-mentioned invention, in order to automatically execute the business in the system on the computer side, it is extremely easy to generate the program code for executing the business, and the technical ability as SE is very easy. Even if you do not have it, if you are a person in charge of the field who is proficient in business, you can easily give instructions and automatically generate program code without human intervention with SE technology, and it is a mechanism of program development. In the near future, it will be possible to prevent a chronic shortage of SE engineers from having a tremendous impact on society.

FIG. 1 is a block diagram of the program code automatic generation system according to the first embodiment. FIG. 2 is a flowchart of a program code automatic generation system to which the present invention is applied. FIG. 3 is a diagram showing an example in which a user who installs this system sets and registers an execution destination in advance for each company. FIG. 4 is a diagram showing an example of an execution operation table. FIG. 5 is a diagram showing another example of the execution operation table shown in FIG. FIG. 6 is a diagram showing an example of an accusative case table. FIG. 7 is a diagram showing another example of the accusative table shown in FIG. FIG. 8 is a diagram showing an example of an end point case table. FIG. 9 is a diagram showing another example of the end point case table shown in FIG. FIG. 10 is a diagram for explaining a case where machine learning by artificial intelligence is used in searching the basic syntax of the program code. FIG. 11 is a diagram for explaining a method of generating a confirmation statement for confirming the input contents to the user. FIG. 12 is a diagram showing an example of an execution operation table according to the second embodiment or the fourth embodiment. FIG. 13 is a diagram showing an example of an accusative table according to the third or fourth embodiment. FIG. 14 is a diagram showing another example of the end point case table.

Hereinafter, the program code automatic generation system according to the first to fourth embodiments of the present invention will be illustrated and described with reference to the drawings.

[Embodiment 1]
(Program code automatic generation system 100)
An example of the configuration of the program code automatic generation system 100 according to the present embodiment will be described with reference to FIG. FIG. 1 is a schematic diagram showing the overall configuration of the program code automatic generation system 100 according to the present embodiment.

The program code automatic generation system 100 is not a mere business assistance but a fundamental change in the program development mechanism, and can prevent a chronic shortage of SE engineers from having a great impact on society in the near future.

That is, the program code automatic generation system 100 automatically generates the program code for executing the business, and thereby each business in the company (for example, delivery of mail, collection of progress of the worker, file management, file transfer). Etc.), various data processing can be performed automatically on the computer. The program code automatic generation system 100 can set the automatic generation of the program code by voice or text, and a user who does not have specialized knowledge such as a system administrator (for example, the program code automatic generation system 100). Even for users who manage their business by using them), it is possible to easily realize automatic generation of program code for causing a computer to automatically perform various business processes.

As shown in FIG. 1, for example, the program code automatic generation system 100 includes a program code automatic generation device 1, and the user may use the program code automatic generation device 1. The program code automatic generation system 100 may include a terminal 2 connected to the program code automatic generation device 1 via, for example, a communication network 4, and the user may use the program code automatic generation device 1 via the terminal 2. The program code automatic generation system 100 includes, for example, a server 3 connected to the program code automatic generation device 1 via a communication network 4, and a user can perform various information with the server 3 via the program code automatic generation device 1 or the terminal 2. Each means may be realized by sending and receiving.

<Automatic program code generator 1>
As the program code automatic generation device 1, for example, a known electronic device such as a server, a personal computer, a smartphone, a tablet terminal, or a wearable terminal is used. In the program code automatic generation system 100 of the present embodiment, the program code automatic generation device 1 is the center of the cloud server.

Although not shown, the program code automatic generation device 1 may include an acquisition unit and a calculation unit, and may include, for example, an execution unit, a storage unit, an output unit, and an intent storage unit. Each function of the program code automatic generation device 1 is realized by the CPU executing a program stored in a storage unit or the like using the RAM as a work area. In addition, a part of each function may be controlled by artificial intelligence. Here, the "artificial intelligence" may be based on any well-known artificial intelligence technology.

The acquisition unit accepts input of text data via voice or an input terminal. The acquisition unit acquires text data input from the user via, for example, the input unit of the terminal 2 or the program code automatic generation device 1. For example, when a conversational sentence is input by voice from the user via the input unit of the terminal 2 or the program code automatic generation device 1, the acquisition unit generates the conversation text from the voice using a known voice recognition technology (for example, voice recognition technology). Get the text data. As the voice recognition technology, a cloud-type voice recognition technology may be used, for example, via the communication network 4.

The calculation unit refers to the database and executes various processing operations and calculations based on the acquired text data. The arithmetic unit extracts individual components of the sentence, including verbs, nouns, and case components, by analyzing the received conversational sentence in natural language. The arithmetic unit performs a processing operation of assigning an execution operation instruction corresponding to an instruction operation extracted from the received text data, an execution operation target corresponding to the accusative case, and an execution operation destination corresponding to the end point case. This arithmetic unit executes a processing operation for determining an intent corresponding to the received text data. The arithmetic unit refers to the storage unit and extracts the basic syntax of the program code. In addition, the arithmetic unit generates the program code by substituting the assigned execution operation instruction, execution operation target, and execution operation destination into the basic syntax of the extracted program code.

The execution unit executes business processing based on the program code generated in the calculation unit. As business processing, for example, routine work such as sending an email to the person in charge based on the content and deadline of the task, work management, updating the task progress history, etc. can be mentioned, and the content that can execute the business processing information as a program on the computer is used. Be done.

The storage unit temporarily stores text data consisting of conversational sentences acquired through the acquisition unit. The text data stored in this storage unit may be read out and updated under the control of a calculation unit, an execution unit, or the like. The storage unit holds at least three tables, an execution operation table, an accusative case table, and an end point case table. Further, the storage unit may hold a code table.

The output unit outputs various information regarding the operation executed by the program code. The display data is notified so that the user can recognize it via the notification unit of the program code automatic generation device 1, the terminal 2, or the like. The output unit outputs display data or the like to the terminal 2 or the like via the I / F, and outputs display data or the like to the notification unit via the I / F.

One or two or more intents are stored in the intent storage unit. The intent may be stored in the intent storage unit in association with the information that identifies the business process. The information that identifies the business process is usually an action name described later, but the format is not limited to these. Correspondence also includes, for example, the case where the intent has information that identifies the business process.

<Terminal 2>
As the terminal 2, for example, a known electronic device such as a server, a personal computer, a smartphone, a tablet terminal, or a wearable terminal is used. The terminal 2 may have at least a part of the same configuration and functions as the program code automatic generation device 1, for example. A plurality of terminals 2 may be provided, for example, and each terminal 2 may be connected to the program code automatic generation device 1 via the communication network 4.

<Server 3>
For example, various information is stored in the server 3. Various information sent from the program code automatic generation device 1 and the like is stored in the server 3 via, for example, the communication network 4. For example, the server 3 stores the same information as the storage unit of the program code automatic generation device 1, and may transmit and receive various information to and from the program code automatic generation device 1 and the like via the communication network 4. That is, in the program code automatic generation system 100, the server 3 may be used instead of the program code automatic generation device 1 or the storage unit of the program code automatic generation device 1.

<Communication network 4>
The communication network 4 is an Internet network or the like to which the program code automatic generation device 1 is connected via a communication circuit. The communication network 4 may be composed of a so-called optical fiber communication network. Further, the communication network 4 may be realized by a known communication network such as a wireless communication network in addition to the wired communication network.

Next, the operation of the program code automatic generation system 100 to which the present invention is applied will be described.

As shown in FIG. 2, the conversational sentence is accepted in step S11. Specifically, when a conversational sentence is acquired as voice data by the acquisition unit of the program code automatic generation device 1, text data is generated using a known voice recognition technique (for example, phoneme recognition technique). Further, when the text data converted into electronic data is acquired by the acquisition unit of the program code automatic generation device 1, this is used as it is. As the text data converted into electronic data, for example, an e-mail text, an information bulletin board used inside or outside the company, or a post on various sites may be taken in as it is.

The acquisition unit of the program code automatic generation device 1 may acquire text data at each timing of input by the user, or may acquire, for example, a plurality of text data accumulated in a certain period at once. As a method of generating text data from non-text format data input via the input unit of the terminal 2 or the program code automatic generation device 1, a known technique can be used. The text data acquired in this way is temporarily stored in the storage unit of the program code automatic generation device 1.

Next, the process proceeds to step S12, and the conversational sentence as the text data acquired in S11 and temporarily stored in the storage unit of the program code automatic generation device 1 is read out and analyzed in natural language. This natural language analysis is mainly performed by the arithmetic unit of the program code automatic generation device 1. In this natural language analysis, any well-known natural language analysis technique such as morphological analysis and parsing may be used.

As a result of the natural language analysis in step S12, for example, for the text data "Register the product name, A5-7853K", the instruction consisting of "Register the accusative case consisting of the product name | A5-7853K |". Can be disassembled into movements. In addition, the text "Transfer this month's daily report of Taro Yamada to Chief Tokugawa" has the accusative case of "Taro Yamada | | this month | | overtime | time |", the end point of "Taro Yamada | It can be decomposed into the instruction operation of "|". In other words, text data can be extracted through a combination of case components consisting of the accusative case and the end point case that are related to the verb consisting of the instruction action.

Case components are noun phrases required to form sentences with verbs (instruction actions). The case in the case component is a function that selectively requests a combination of nouns or noun phrases necessary for forming a sentence according to the lexical meaning of the verb, and is called case control. The case grammar, which is the rationale for this case component, is based on a single sentence that is associated with a deep case (object case, conditional case, tool case, start point case, end point case, time case, etc.) that represents an entity. It is a theory that analyzes sentences as being. Then, it can be said that the noun (phrase) required as the deep case of the sentence by the verb is a case component necessary for supplementing the realization of the proposition by the verb. A case component is not just a noun phrase, but a noun phrase that a verb is involved in to realize its proposition. In other words, the case component is an element of nouns (including noun phrases) that are related to a verb, which can be an action start condition for realizing a proposition by a verb that defines an instructional action.

The accusative case here means the execution target of a proposition by a verb that defines an instructional action. In the case of the phrase "transfer file A", the verb "transfer" is subject to "file A" as the accusative case. The end point rating defines the place where the execution target defined by the target case is reflected, the destination to benefit from the execution target, and the destination to which the execution target is sent. In the case of the phrase "send file A to Taro Yamada", the verb "send" is subject to "file A" as the accusative case, and this is sent with Taro Yamada as the end point. This end point is "Taro Yamada".

Next, the process proceeds to step S13, and the meaning and action of the conversational sentence analyzed in natural language is determined. In step S13, a semantic action including an execution action instruction, an execution action target, an execution action destination, and the like is determined from the instruction action and the case component analyzed through natural language analysis.

First, the arithmetic unit of the program code automatic generation device 1 extracts the execution operation instruction corresponding to the extracted instruction operation, the execution operation target corresponding to the extracted target case, and the conversation sentence analyzed in the natural language in step S12. The execution operation destination corresponding to the end point case is searched by referring to each degree of association of the execution action table, the target case table, and the end point case table.

The execution operation instruction referred to here is a wording for instructing an execution operation in an actual program code, and corresponds to actual database registration, writing to a file, transfer, deletion, monitor display, and the like.

The execution operation target indicates the target for executing this execution operation instruction, and may be an invoice, a daily report, a specification file, data, an email, or the like, a product name, various events, and information. It may be (for example, working hours, inventory, etc.).

Various program codes can be completed by combining the execution operation target and the execution operation instruction.

For example, if the execution operation instruction is "transfer" and the execution operation instruction is "specification file", it is possible to create a program code called "specification file transfer" by combining these.

The execution operation destination indicates an execution destination for executing an execution operation instruction. For example, the user who installs this system may set and register the execution destination in advance for each company. For example, as shown in FIG. 3, "Taro Yamada's PC", "Tokugawa section chief's PC", "Development department's shared PC", etc. may be registered as execution operation destinations in the in-house LAN. In addition, a business partner who has crossed the internal LAN but is outside the company may also be registered as "a person in charge B of the business partner A company" via an external public communication network.

That is, before implementing the present invention, the end point case table is created, and at the time of this creation, each terminal device in the communication network (for example, "PC of Taro Yamada", "PC of Tokugawa section manager", An operation of pre-registering "a shared PC of the development unit" or the like) as an execution operation destination for each reference in the end point case table may be executed.

Next, the process proceeds to step S14, and the program code analysis for executing the conversational sentence whose meaning and action have been determined is performed. This association analysis of the program code performs an operation of extracting the basic syntax of the program code.

The specific methods of steps S13 and 14 will be described in detail later.

Next, the process proceeds to step S15, and the program code is created. In step S14, as described above, the basic syntax of the program code is merely extracted, and by substituting the target of the actual processing operation and the wording that defines each condition necessary for completing the processing operation. The program code is complete. Therefore, in step S15, the execution operation target is assigned to the execution operation destination by substituting the words defining the execution operation target, the execution operation destination, and the execution operation instruction into the basic syntax of the extracted program code. To generate the program code for executing the execution operation specified in the execution operation instruction.

In the steps S11 to S15, the program can be automatically generated based on the user's intention included in the conversational sentence received in step S11.

After the program code is completed in this way, it may be provided to the user or displayed via the notification unit of the program code automatic generation device 1, or may be displayed via the notification unit of the program code automatic generation device 1. The completed program code may be executed via. That is, according to the present invention, it is possible to execute the automatically generated program code as it is. Therefore, when included from the process from step S11, the user can automatically generate a program code incorporating the intention by issuing a conversational sentence, and the generated program code is put into execution as it is. be able to. This means that when the user speaks the action he / she wants the system to perform in a conversational sentence or inputs text data corresponding to the action, the action incorporating the intention is executed as it is based on the automatically generated program code. It becomes possible.

Next, a detailed method of program code analysis for executing the meaning / action determination of the natural language-analyzed conversational sentence in step S13 and the conversational sentence whose meaning / action has been determined in step S14 will be described.

In executing these methods, the actual execution action instruction for the reference instruction action is associated with the execution action table having three or more levels of association, and the actual execution action target for the reference target case is three. Use the target case table associated with the degree of association of the level or higher. Each of these tables is not limited to being organized in a visually recognizable table or matrix, but simply consists of trained data in which a machine learning model of artificial intelligence is stored, and a set thereof. You may be.

FIGS. 4 and 5 show an example of the execution operation table among these. In this execution operation table, it is premised that three or more levels of association between the reference instruction operation and the execution operation instruction are set in advance. It is assumed that the input data is, for example, reference instruction operations P01 to P03. For example, it is assumed that the reference instruction operation P01 is "sent", the reference instruction operation P02 is "up", the reference instruction operation P03 is "erase", and the like. The reference instruction operations P01 to P03 as such input data are linked to the execution operation instruction as output.

Such a reference instruction operation is associated with three or more stages of execution operation instructions (for example, "open file", "transfer", "print", "delete", etc.) as the output solution. They are linked to each other throughout the degree. Reference instruction actions are arranged on the left side via this degree of association, and each execution operation instruction is arranged on the right side via this degree of association. The degree of association indicates the degree of relevance to which execution operation instruction is highly related to the reference instruction operation arranged on the left side. In other words, this degree of association is an index indicating which execution action instruction is likely to be associated with each instruction action, and the accuracy in selecting the most probable execution action instruction from the instruction actions. Is shown. In the example of FIG. 4, w13 to w19 are shown as the degree of association. These w13 to w19 are shown in 10 stages as shown in Table 1 below, and the closer to 10 points, the higher the degree of relevance of each combination as an intermediate node to the execution operation instruction as an output. On the contrary, the closer to one point, the lower the degree of relevance of each combination as an intermediate node to the execution operation instruction as an output.

Such three or more levels of association w13 to w19 shown in FIG. 4 are acquired in advance. That is, in determining the actual search solution, it is shown in FIG. 5 by accumulating a past data set and analyzing and analyzing which of the processing operation and the execution operation instruction was adopted and evaluated. Create a degree of association.

For example, in the past, it is assumed that "open file" is judged to have the highest suitability as an execution operation instruction for the reference instruction operation P01 and evaluated. By collecting and analyzing such a data set, the degree of association with the reference instruction operation becomes stronger.

This analysis and analysis may be performed by artificial intelligence. In such a case, for example, in the case of the instruction operation P01, the analysis is performed based on the past data set. In the case of the instruction operation P01, if there are many cases of "opening a file", the degree of association connected to this execution operation instruction is set higher, and if there are many cases of "printing", this execution operation is performed. Set a higher degree of association that leads to the command. For example, in the example of the processing operation P01, "Open file" and "Print" are linked, but from the previous case, the degree of association of w13 that leads to "Open file" is set to 7 points, and "Print". The degree of association of w14 that leads to is set to 2 points.

Further, this degree of association may be composed of the nodes of the neural network in artificial intelligence. That is, the weighting coefficient for the output of the node of this neural network corresponds to the above-mentioned degree of association. Further, the network is not limited to a neural network, and may be composed of all decision-making factors constituting artificial intelligence.

In such a case, as shown in FIG. 5, a processing operation is input as input data, an execution operation instruction is output as output data, at least one hidden layer is provided between the input node and the output node, and the machine is provided. You may let them learn. The above-mentioned degree of association is set in either one or both of the input node and the hidden layer node, and this is the weight of each node, and the output is selected based on this. Then, when the degree of association exceeds a certain threshold value, the output may be selected.

Such a degree of association is what is called learned data in artificial intelligence. After creating such learned data, the execution operation instruction will be actually searched from the instruction operation. In such a case, the instruction operation extracted in step S12 is newly acquired. Based on the newly acquired instruction operation, the execution operation instruction corresponding to this is searched. In such a case, the degree of association shown in FIG. 4 (Table 1) acquired in advance is referred to. For example, when the newly acquired instruction operation is the same as or similar to P02, "transfer" is associated with w15 and "print" is associated with the association degree w16 via the association degree. In such a case, "transfer" with the highest degree of association is selected as the optimum solution. However, it is not essential to select the one with the highest degree of association as the optimum solution, and "print", which has the lowest degree of association but the association itself is recognized, may be selected as the optimum solution. In addition to this, it goes without saying that an output solution to which the arrows are not connected may be selected, and as long as it is based on the degree of association, it may be selected in any other priority.

At this time, the synonym dictionary may be stored in the storage unit of the program code automatic generation device 1. A synonym dictionary is a dictionary related to synonyms. In the synonym dictionary, for each one or more reference instruction operations stored in the storage unit of the program code automatic generation device 1, a word possessed by the reference instruction operation and one or more synonyms of the word are included in the synonym dictionary. Is registered. Specifically, for example, "send", "deliver", and the like may be registered in association with the reference instruction operation "transfer". Then, through this synonym dictionary, it is possible to determine whether or not the newly acquired instruction operation is similar to the reference instruction operation. If the reference instruction action is "transfer" and the newly acquired instruction action is "send", it corresponds to "deliver" because it is registered in advance as similar in the synonym dictionary. It becomes possible to judge that it should be done.

By referring to such a degree of association, it is possible to accurately determine what kind of execution operation instruction the instruction operation extracted from the text data corresponds to.

FIGS. 6 and 7 show an example in which the actual execution operation target for the reference target case uses the target case table associated with three or more levels of association.

In this accusative case table, it is premised that three or more levels of association between the reference target case and the execution operation target are set in advance. It is assumed that the input data is, for example, reference target cases P01 to P03. For example, it is assumed that the reference target case P04 is "mail at 12:00 on December 3", the reference target case P05 is "delivery note", and the reference target case P06 is "weekly report". The reference target cases P04 to P06 as such input data are connected to the execution operation target as output.

Such a reference target case is for an execution operation target as this output solution (for example, "mail received at 14:00 on December 7", "invoice", "daily report", "specification", etc.). They are linked to each other through three or more levels of linking. The reference target cases are arranged on the left side via this degree of association, and each execution operation target is arranged on the right side via this degree of association. The degree of association indicates the degree of relevance to which execution operation target is highly related to the reference target case arranged on the left side. In other words, this degree of association is an index showing what kind of accusative action object is likely to be associated with each accusative case, and the accuracy in selecting the most probable accusative action object from the accusative case. Is shown. In the example of FIG. 6, w13 to w19 are shown as the degree of association. Of course, the example of the degree of association in FIG. 7 is not necessarily the same as that in FIG.

Such three or more levels of association w13 to w19 shown in FIG. 6 are acquired in advance. That is, in determining the actual search solution, it is shown in FIG. 6 by accumulating past data sets and analyzing and analyzing which of the accusative case and the execution operation target was adopted and evaluated. Create a degree of association.

For example, it is assumed that the "invoice" is judged to have the highest suitability as the execution operation target with respect to the reference target case P04 in the past and is evaluated. By collecting and analyzing such data sets, the degree of association with the accusative case for reference becomes stronger.

This analysis and analysis may be performed by artificial intelligence. In such a case, for example, in the case of the target P04, the analysis is performed based on the past data set. In the case of accusative P04, if there are many cases of "email received at 14:00 on December 7", the degree of association connected to this execution operation target is set higher, and there are many cases of "invoice". Is set to a higher degree of association connected to this execution operation target. For example, in the example of the accusative case P04 for reference, it is linked to "Email received at 14:00 on December 7" and "Daily report", but it leads to "Email received at 14:00 on December 7" from the previous case. The degree of association of w13 is set to 7 points, and the degree of association of w14 that leads to the "daily report" is set to 2 points.

Further, this degree of association may be composed of the nodes of the neural network in artificial intelligence.

In such a case, as shown in FIG. 7, a processing operation is input as input data, an execution operation instruction is output as output data, at least one hidden layer is provided between the input node and the output node, and the machine is provided. You may let them learn. The above-mentioned degree of association is set in either one or both of the input node and the hidden layer node, and this is the weight of each node, and the output is selected based on this. Then, when the degree of association exceeds a certain threshold value, the output may be selected.

Such a degree of association is what is called learned data in artificial intelligence. After creating such learned data, we will actually search for the execution operation target from the accusative case. In such a case, the accusative case extracted in step S12 is newly acquired. Based on the newly acquired accusative case, the execution operation target corresponding to this is searched. In such a case, the degree of association shown in FIG. 6 (Table 1) acquired in advance is referred to. For example, when the newly acquired accusative case is the same as or similar to P05, the "invoice" is associated with the association degree w15 and the "daily report" is associated with the association degree w16 through the association degree. In such a case, the “invoice” with the highest degree of association is selected as the optimum solution. However, it is not essential to select the one with the highest degree of association as the optimum solution, and the "daily report", which has the lowest degree of association but the association itself is recognized, may be selected as the optimum solution. In addition to this, it goes without saying that an output solution to which the arrows are not connected may be selected, and as long as it is based on the degree of association, it may be selected in any other priority.

At this time, the synonym dictionary may be stored in the storage unit of the program code automatic generation device 1. In the synonym dictionary, a word possessed by the target case and one or more synonyms of the word are registered for each one or more reference target cases stored in the storage unit of the program code automatic generation device 1. Has been done. Specifically, for example, a "business report", a "business diary", and the like may be registered in association with the reference target case "daily report". Then, through this synonym dictionary, it is possible to determine whether or not the newly acquired accusative case is similar to the reference accusative case. If the accusative case for reference is "daily report" and the newly acquired accusative case is "business diary", it corresponds to "daily report" because it is registered in advance as similar in the synonym dictionary. It becomes possible to judge.

By referring to such a degree of association, it is possible to accurately determine what kind of execution operation target the target case extracted from the text data corresponds to.

FIGS. 8 and 9 show an example in which the actual execution operation target for the reference end point case uses the end point case table associated with three or more levels of association.

In this end point case table, it is premised that three or more levels of association between the reference end point case and the execution operation destination are set in advance. It is assumed that the input data is, for example, reference end point cases P07 to P09. For example, the reference end point rating P07 is "Taro Yamada's PC", the reference end point rating P08 is "Doi section chief's PC", and the reference end point rating P09 is "person in charge C of business partner A". And. The reference end point cases P07 to P09 as such input data are connected to the execution operation destination as the output.

Such reference end points are the execution operation destinations as this output solution (for example, "PC of Taro Yamada", "PC of Tokugawa section chief", "person in charge B of business partner A", "shared by development department". It is linked to each other through three or more levels of linking to "PC" etc.). The reference end point cases are arranged on the left side via this degree of association, and each execution operation destination is arranged on the right side via this degree of association. The degree of association indicates the degree of relevance to which execution operation destination is highly related to the reference end point case arranged on the left side. In other words, this degree of association is an index indicating what execution operation destination each end point case is likely to be associated with, and the accuracy in selecting the most probable execution operation destination from the end point case. Is shown. In the example of FIG. 8, w13 to w19 are shown as the degree of association. Of course, the example of the degree of association in FIG. 8 is not necessarily the same as that in FIGS. 4 and 6.

Such three or more levels of association w13 to w19 shown in FIG. 8 are acquired in advance. That is, in determining the actual search solution, a past data set is accumulated to determine which of the end point case and the execution operation destination is adopted and evaluated, and these are analyzed and analyzed to show in FIG. Create a degree of association.

For example, in the past, it is assumed that "the person in charge B of the business partner A" is judged to have the highest suitability for the reference end point rating P07 as the execution operation destination, and is evaluated. By collecting and analyzing such a data set, the degree of association with the reference end point case P07 becomes stronger.

This analysis and analysis may be performed by artificial intelligence. In such a case, for example, in the case of the target P07, the analysis is performed based on the past data set. In the case of the end point rating P07, if there are many cases of "Taro Yamada's PC", the degree of association connected to this execution operation destination is set higher, and there are many cases of "person in charge B of business partner A". In that case, the degree of association connected to this execution operation destination is set higher. For example, in the example of the end point rating P07 for reference, it is linked to "Taro Yamada's PC" and "Person in charge B of customer A company", but from the previous case, the connection of w13 connected to "Taro Yamada's PC". The degree is set to 7 points, and the degree of association of w14 connected to "the person in charge B of the business partner A company" is set to 2 points.

Further, this degree of association may be composed of the nodes of the neural network in artificial intelligence.

In such a case, as shown in FIG. 9, a processing operation is input as input data, an execution operation instruction is output as output data, at least one hidden layer is provided between the input node and the output node, and the machine is provided. You may let them learn. The above-mentioned degree of association is set in either one or both of the input node and the hidden layer node, and this is the weight of each node, and the output is selected based on this. Then, when the degree of association exceeds a certain threshold value, the output may be selected.

Such a degree of association is what is called learned data in artificial intelligence. After creating such learned data, we will actually search for the execution operation destination from the end point case. In such a case, the end point case extracted in step S12 is newly acquired. Based on the newly acquired end point case, the execution operation destination corresponding to this is searched. In such a case, the degree of association shown in FIG. 9 (Table 1) acquired in advance is referred to. For example, if the newly acquired end point rating is the same as or similar to P08, the "PC of Tokugawa section chief" is w15 and the "person in charge B of business partner A" is linked through the degree of association. It is associated with degree w16. In such a case, the “PC of Tokugawa section chief” with the highest degree of association is selected as the optimum solution. However, it is not essential to select the one with the highest degree of association as the optimum solution, and select "the person in charge B of business partner A" as the optimum solution, although the degree of association is low but the association itself is recognized. May be good. In addition to this, it goes without saying that an output solution to which the arrows are not connected may be selected, and as long as it is based on the degree of association, it may be selected in any other priority.

At this time, the synonym dictionary may be stored in the storage unit of the program code automatic generation device 1. In the synonym dictionary, a word possessed by the end point case and one or more synonyms of the word are registered for each one or more reference end point cases stored in the storage unit of the program code automatic generation device 1. Has been done. Through this synonym dictionary, it may be determined whether or not the newly acquired end point case is similar to the reference end point case.

By referring to such a degree of association, it is possible to accurately determine what kind of execution operation destination the end point case extracted from the text data corresponds to.

By performing the association analysis of the program code in steps S13 and 14 in this way, the execution operation instruction corresponding to the extracted instruction operation, the execution operation target corresponding to the extracted target case, and the extracted end point case The execution operation destination corresponding to is narrowed down.

Next, the details of the method of creating the program code in step S15 will be described. The program code is created by extracting the basic syntax of the highly relevant program code based on the execution operation target, the execution operation target, and the execution operation destination searched through the degree of association. Then, the execution operation target, the execution operation target, and the execution operation destination searched through the degree of association are substituted for the basic syntax of the extracted program code.

Table 2 shows an example of searching for the basic code of the program code.

The basic syntax of the program code is the prototype of the program code for actually executing various processing operations by a PC or the like. The program code can be completed by substituting the necessary wording into the basic syntax of this program code. An example of the basic syntax of the program code is "INSERT INTO registration destination VALUES {param1};", there is "INSERT" (register) as an execution operation instruction, and "registration destination" as an execution operation destination. ({Param1}) as the execution operation target has already been completed in the syntax. The program code can be completed by substituting the execution operation target, the execution operation target, and the execution operation destination that are actually searched through the degree of association with such a syntax. For example, by substituting the searched execution operation destination "Taro Yamada's PC" as the "registration destination" and substituting the searched sales data as ({param1}), "the sales data is transferred to Taro Yamada's PC". The program code "Register" can be completed.

Similarly, in the case of the text data "display the slide for presentation on the display of the conference room", the "slide for presentation" as the target case, the "display of the conference room" as the end point case, and the instruction operation. "Display" is extracted, and the execution operation target, execution operation target, and execution operation destination are searched according to each. Then, the basic syntax of the program code according to the execution operation destination is searched in the same manner.

Actually, the basic syntax of the program code is searched through the code table shown in Table 2. In the code table, the basic syntax of the program code corresponds to each other for the reference execution operation target, the reference execution operation target, and the reference execution operation destination in the same row. For example, if the reference execution operation target is "billing data" and the reference execution operation instruction is "DB reference", the basic syntax of the corresponding program code is "SELECT billing amount".

At this time, the combination of one reference execution operation target, reference execution operation target, and reference execution operation destination may correspond to the basic syntax of a plurality of program codes, and conversely, one basic syntax may correspond to a plurality of references. It may correspond to the combination of the execution operation target for reference, the execution operation target for reference, and the execution operation destination for reference.

By storing such a code table in the storage unit of the program code automatic generation device 1, it is possible to read and refer to it in the process of calculation by the calculation unit of the program code automatic generation device 1.

FIG. 10 shows an example of searching the basic syntax of the program code through machine learning by artificial intelligence for the code table. In the example of FIG. 10, a combination having a reference execution operation instruction as an input variable in the code table, a reference execution operation target, and a reference execution operation destination is input, and the basic syntax of the program code is output. Specifically, it is assumed that the input data is, for example, a reference execution operation instruction (“printer output”, “open file”, etc.), a reference execution operation target, and a reference execution operation destination. The intermediate node 61 is a combination of the reference execution operation target and the reference execution operation destination with respect to the reference execution operation instruction as such input data. Each intermediate node 61 is further connected to an output. In this output, the basic syntaxes A to E of the program code as the output solution are displayed. The basic syntax A of the program code is, for example, "SELECT billing amount FROM billing data WHERE company = {param1} AND billing month = {param2};", and the basic syntax B is, for example, "Write Line product list.dat {param1". }; ”.

Each combination (intermediate node) of the reference execution operation instruction, the reference execution operation target, and the reference execution operation destination is related to each other through three or more levels of association with the basic syntax of the program code as this output solution. It is related. The reference execution operation instruction, the reference execution operation target, and the reference execution operation destination are arranged on the left side via this degree of association, and the basic syntax is arranged on the right side via this degree of association. The degree of association indicates the degree of relevance to the basic syntax for the execution operation instructions arranged on the left side. In other words, this degree of association is an index indicating which program code basic syntax is likely to be associated with each reference execution operation instruction, reference execution operation target, and reference execution operation destination. , It shows the accuracy in selecting the most probable basic syntax of the program code from the execution operation instructions.

Such three or more levels of association w13 to w22 shown in FIG. 10 are acquired in advance. In determining the actual search solution, the past data indicating which of the reference execution operation instruction, the reference execution operation target, the reference execution operation destination, and the basic syntax of the program code in that case was suitable is used. Accumulate and analyze and analyze these to create a degree of association.

This analysis and analysis may be performed by artificial intelligence. In such a case, for example, when the reference execution operation instruction is "transfer", and the reference execution operation target and the reference execution operation destination are "sales data, Taro Yamada's PC", the program code Analyze the basic syntax from historical data. When there are many cases of basic syntax C, the degree of association leading to this basic syntax C is set higher, and when there are many cases of basic syntax E and few cases of basic syntax C, the association leading to basic syntax E is set. Set the degree high and the degree of association leading to the basic syntax C low. For example, in the example of the intermediate node 61a, the output of the basic syntax A and the basic syntax B is linked, but from the previous case, the degree of association of w13 connected to the basic syntax A is 7 points, and the association of w14 connected to the basic syntax B is set to 7. The degree is set to 2 points.

Further, the degree of association shown in FIG. 10 may be composed of the nodes of the neural network in artificial intelligence. That is, the weighting coefficient for the output of the node of this neural network corresponds to the above-mentioned degree of association. Further, the network is not limited to a neural network, and may be composed of all decision-making factors constituting artificial intelligence.

In the example of the degree of association shown in FIG. 10, the node 61b has the degree of association of the basic syntax C w15 and the degree of association of the basic syntax E w16.

Such a degree of association is what is called learned data in artificial intelligence. After creating such learned data, when actually searching for the basic syntax from now on, the above-mentioned learned data will be used. In such a case, the execution operation instruction, the execution operation target, and the execution operation destination searched in steps S13 to S14 are used.

The basic syntax of the optimum program code is searched for based on the newly acquired execution operation instruction, the execution operation target, and the execution operation destination. In such a case, the degree of association shown in FIG. 10 (Table 1) acquired in advance is referred to. For example, when the newly acquired execution operation instruction is "open file" and the execution operation target and the execution operation destination are P21, the node 61d is associated with each other through the degree of association. , This node 61d is associated with the basic syntax C by w19 and the basic syntax D by the degree of association w20. In such a case, the basic syntax C having the highest degree of association is selected as the optimum solution. However, it is not essential to select the one with the highest degree of association as the optimum solution, and the basic syntax D in which the degree of association is low but the association itself is recognized may be selected as the optimum solution. In addition to this, it goes without saying that an output solution to which the arrows are not connected may be selected, and as long as it is based on the degree of association, it may be selected in any other priority.

Further, an example of the degree of association w1 to w12 extending from the input is shown in Table 3 below.

The intermediate node 61 may be selected based on the degree of association w1 to w12 extending from this input. That is, the larger the degree of association w1 to w12, the heavier the weighting in the selection of the intermediate node 61 may be. However, the degrees of association w1 to w12 may all have the same value, and the weights in the selection of the intermediate node 61 may all be the same.

The present invention is not limited to the above-described embodiment. By searching for the execution operation target, execution operation target, and execution operation destination, and substituting the execution operation target, execution operation target, and execution operation destination into the basic syntax of the program code, the execution operation target is assigned to the execution operation destination. The case where the program code for executing the execution operation specified in the execution operation instruction is generated has been described as an example, but the present invention is not limited to this. The search for the execution operation destination may be omitted, and the program code for executing the execution operation specified in the execution operation instruction may be generated for the execution operation target.

Further, the case component to be extracted is not limited to the above-mentioned target case and end point case, and may include a start point case and a conditional case.

The starting point case defines the place where the execution target defined by the target case is generated and the start source of the execution target. In the case of the phrase "send file A from Taro Yamada", the verb "send" is subject to "file A" as the accusative case, and this is sent starting from Taro Yamada. , This starting point is "Taro Yamada".

Even when such a start point case is used, the reference end point case in the end point case table shown in FIG. 8 becomes the reference start point case, and the search is the execution operation source. That is, the start point case table in which the actual execution operation source for the reference start point case is associated with three or more levels of association is stored. Then, the text data is analyzed, and the execution operation source for the extracted start point case is searched by referring to the degree of association of the stored start point case table. Next, by substituting the searched execution operation source into the basic syntax of the program code, the execution operation specified in the execution operation instruction is performed from the execution operation source to the execution operation destination. Generate program code to execute.

The conditional case defines the conditions for executing the operation of the execution target defined by the accusative case. The conditions include when (time), how (method), when to start (operation start condition), and when to execute (operation end condition).

For example, in the case of the phrase "send file A by tomorrow", "file A" is assigned as the accusative case and "by tomorrow" is assigned as the accusative case for the verb "send". This condition is "by tomorrow".

Even when such a start point case is used, the reference end point case shown in FIG. 8 becomes the reference condition case, and the search is the execution operation condition. That is, the condition case table in which the actual execution operation conditions for the reference condition case are associated with each other with three or more levels of association is stored. Then, the text data is analyzed, and the execution operation condition for the extracted conditional case is searched by referring to the degree of association of the stored conditional case table. Next, by substituting the searched execution operation condition into the basic syntax of the program code, the execution operation target is executed for the execution operation destination as specified in the execution operation instruction based on the execution operation condition. The action will be performed.

The present invention is not limited to the above-described embodiment. For example, as shown in FIG. 11, a confirmation statement for confirming the input contents to the user is generated based on the degree of association defined in each of the execution operation table, the target case table, and the end point case table. You may. The generated confirmation text may be output by voice or image. That is, when any of the execution operation instruction, the execution operation target, and the execution operation destination cannot be appropriately specified from the input contents from the user, a confirmation statement for inquiring the user about the intention is generated again and the intention is generated. Run the process to confirm. While the execution action instruction, the execution action target, and the execution action destination as the search solution are all finite, the types of wording of the text data generated by the user are almost infinite. Therefore, depending on the instruction operation or the case component extracted from the text data generated by the user, it may not be possible to search for the execution operation instruction, the execution operation target, or the execution operation destination. Further, when the user uses a dialect, the execution operation instruction, the execution operation target, and the execution operation destination may not be narrowed down through the degree of association depending on the content of the dialect. In such a case, a confirmation statement for inquiring the user about the intention is generated again. The process is to accept re-entry of text data from the user in response to the generation of confirmation text and notification, but this process may be performed in a so-called chat format.

The confirmation statement may be generated based on the degree of association associated with the execution action instruction, the execution action target, and the execution action destination searched through the execution action table, the target case table, and the end point case table. If the execution operation instruction "open file" is searched for in the execution operation table, but the association degree w13 associated with this is 5 out of 10 grades, to be honest, it is under such a strong association degree. There is a possibility that the execution operation instruction has not been determined in, and the search solution does not capture the user's intention. That is, it is a case where the execution operation instruction, the execution operation target, and the execution operation destination cannot be narrowed down through the degree of association. In such a case, a confirmation statement is generated, the user's intention is confirmed, and re-input is accepted. Then, the solution search may be performed upsetly based on the contents of the received re-input. In this way, when the degree of association associated with the execution operation instruction, the execution operation target, and the execution operation destination is less than a certain threshold value, it is determined that the search reflecting the user's intention has not been performed. , You may want to generate a confirmation statement. This confirmation sentence may be performed by preparing a plurality of types of example sentences in advance and substituting those corresponding to the search solution into the example sentences. For example, if you want to check whether the user really intends to "transfer" the execution operation instruction, this execution operation instruction is in the ●● part of "Do you want to ●● file A?" A confirmation statement may be generated by substituting "transfer".

In addition, instead of setting such a threshold value, a confirmation statement is generated by comparing the degree of association associated with each of the execution operation instruction, the execution operation target, and the execution operation destination searched using each table. You may try to do it. When the degree of association associated with each of the searched execution operation instruction, execution operation target, and execution operation destination is compared with each other, if the degree of association associated with the searched execution operation target is the lowest, A confirmation statement for confirming the execution operation target may be generated and output.

In addition, since noise is superimposed on the user's voice, when this is incorporated into text data, there is no such wording in the synonym dictionary in the first place, and the reference instruction operation, reference target case, and reference end point are used. In some cases, it cannot be matched with the case. Even when the reference instruction operation, the reference target case, and the reference end point case cannot be collated in this way, a confirmation statement may be generated and output to the user in the same manner. For the generation of this confirmation sentence, an example sentence is created and stored for each reference instruction operation, reference target case, and reference end point case that cannot be collated, and the reference instruction operation and reference that cannot be actually collated. An example sentence may be read and output according to the target case and the reference end point case.

When the degree of association is relatively low, it is determined that the search reflecting the user's intention has not been performed, and the intention can be confirmed by generating a confirmation sentence.

[Embodiment 2]
Next, the program code automatic generation system according to the second embodiment of the present invention will be described with reference to FIG. FIG. 12 is a diagram showing an example of an execution operation table according to the second embodiment. The difference from the program code automatic generation system 100 in the above-described first embodiment is that artificial intelligence is not used mainly in the execution operation table. The explanation is omitted.

In the program code automatic generation system according to the second embodiment, in the execution operation table, for example, if the reference instruction operation P01-1 on the input side is used, the execution operation instruction on the output side is input so as to "open a file". It is different from the program code automatic generation system 100 in the first embodiment in that the data of the reference instruction operation on the side and the data of the execution operation instruction on the output side are prepared as a data set associated with each other. The execution operation table of FIG. 12 shows an example corresponding to the execution operation table of FIG. 4 in the first embodiment.

[Embodiment 3]
Next, the program code automatic generation system according to the third embodiment of the present invention will be described with reference to FIG. FIG. 13 is a diagram showing an example of the accusative case table in the third embodiment. The difference from the program code automatic generation system 100 in the above-described first embodiment is that artificial intelligence is not used mainly in the target case table. The explanation is omitted.

In the program code automatic generation system according to the third embodiment, in the target case table, for example, if the reference target case P04-1 on the input side, the execution operation target on the output side is "received at 14:00 on December 7". As described above, the program code automatic generation system 100 according to the first embodiment is that the data of the reference target case on the input side and the data of the execution operation target on the output side are prepared as a data set associated with each other. Different from. The target case table of FIG. 13 shows an example corresponding to the target case table of FIG. 6 in the first embodiment.

[Embodiment 4]
Next, the program code automatic generation system according to the fourth embodiment of the present invention will be described with reference to FIGS. 12 and 13. FIG. 12 is a diagram showing an example of an execution operation table according to the fourth embodiment. FIG. 13 is a diagram showing an example of the accusative case table in the fourth embodiment. The difference from the program code automatic generation system 100 in the above-described first embodiment is that artificial intelligence is not used mainly in the execution operation table and the target case table. Is added, and the description is omitted.

In the program code automatic generation system according to the fourth embodiment, in the execution operation table, for example, if the reference instruction operation P01-1 on the input side is used, the execution operation instruction on the output side is input so as to "open a file". The data of the reference instruction operation on the side and the data of the execution operation instruction on the output side are prepared as a data set associated with each other.

Further, in the program code automatic generation system according to the fourth embodiment, in the target case table, for example, if the reference target case P04-1 on the input side, the execution operation target on the output side is "received at 14:00 on December 7". The data of the reference target case on the input side and the data of the execution operation target on the output side are prepared as a data set associated with each other so as to be.

In the program code automatic generation system of the fourth embodiment, these are different from the program code automatic generation system 100 of the first embodiment. The execution operation table of FIG. 12 shows an example corresponding to the execution operation table of FIG. 4 in the first embodiment, and the target case table of FIG. 13 is the target case of FIG. 6 in the first embodiment. The one corresponding to the table is shown as an example.

In the first to fourth embodiments, if the end point case table using the artificial intelligence of FIG. 8 is, for example, the reference end point case P07-1 on the input side as shown in FIG. 14, the execution operation destination on the output side. Is replaced with the end point case table prepared as the data set associated with the data of the reference end point case on the input side and the data of the execution operation destination on the output side so that becomes "Taro Yamada's PC". May be carried out.

1 Program code automatic generation device 2 Terminal 3 Server 4 Communication network 61 Intermediate node 100 Program code automatic generation system

Claims (13)

A reception means that accepts text data input via voice or an input terminal,
By analyzing the text data received by the above-mentioned reception means in natural language, an instruction operation and an extraction means for extracting a case component consisting of at least the accusative case related to the instruction action,
A storage means for storing at least an execution action table associated with an actual execution action instruction for a reference instruction action and a target case table associated with an actual execution action target for a reference target case.
The execution action instruction corresponding to the extracted instruction action and the execution action target corresponding to the extracted target case are searched by referring to the execution action table and the target case table stored by the storage means. Search means to do
By substituting the execution operation instruction and the execution operation target searched by the above search means into the basic syntax of the program code, the program code for executing the execution operation specified in the execution operation instruction can be obtained. Equipped with an automatically generated code generation means
In the execution operation table, the actual execution operation instructions for the reference instruction operation are associated with each other with a degree of association of three or more levels, and are stored in the above storage means.
The search means searches for an execution action instruction corresponding to the extracted instruction action by referring to the degree of association of the execution action table stored by the storage means.
A program code automatic generation system characterized in that, in the target case table, the data of the target case for reference on the input side and the data of the execution operation target on the output side are prepared as a data set associated with each other. A reception means that accepts text data input via voice or an input terminal,
By analyzing the text data received by the above-mentioned reception means in natural language, an instruction operation and an extraction means for extracting a case component consisting of at least the accusative case related to the instruction action,
A storage means for storing at least an execution action table associated with an actual execution action instruction for a reference instruction action and a target case table associated with an actual execution action target for a reference target case.
The execution action instruction corresponding to the extracted instruction action and the execution action target corresponding to the extracted target case are searched by referring to the execution action table and the target case table stored by the storage means. Search means to do
By substituting the execution operation instruction and the execution operation target searched by the above search means into the basic syntax of the program code, the program code for executing the execution operation specified in the execution operation instruction can be obtained. Equipped with an automatically generated code generation means
In the accusative table, the actual execution operation target with respect to the reference target case is associated with each other with a degree of association of 3 or more levels, and is stored in the above storage means.
The search means searches for an execution operation target corresponding to the extracted target case by referring to the degree of association of the target case table stored by the storage means .
In execution operation table, and the input side of the reference instruction operation data, and the data of the execution operation command output side, generates automatic features and to Help program code that is provided as a data set that is associated string respectively system. The above-mentioned extraction means extracts a case component consisting of an end point case that depends on an instruction operation, and extracts the case component.
The above storage means stores the end point case table associated with the actual execution operation destination for the reference end point case, and stores the end point case.
The search means searches for the execution operation destination for the extracted end point case by referring to the end point case table stored by the storage means.
The code generating means substitutes the execution operation destination searched by the search means into the basic syntax of the program code, so that the execution operation target is executed with respect to the execution operation destination specified in the execution operation instruction. The program code automatic generation system according to claim 1 or 2, wherein the program code for executing an operation is automatically generated. The storage means stores an end point case table in which the actual execution operation destination for the reference end point case is associated with three or more levels of association.
The program code according to claim 3 , wherein the search means searches for an execution operation destination for the extracted end point case by referring to the degree of association of the end point case table stored by the storage means. Automatic generation system. The search means informs the user based on the degree of association associated with the execution action table, the target case table, the execution action instruction searched through the execution action table, the execution action target, and the execution action destination, respectively. On the other hand, a confirmation statement generation means for generating a confirmation statement for confirming the input contents, and a confirmation statement generation means
It is provided with an output means for outputting a voice or an image of the confirmation sentence generated by the above confirmation sentence generation means.
The program code automatic generation system according to claim 4 , wherein the reception means accepts re-input of text data by a user. The code generation means refers to a code table associated with the basic syntax of the program code for the combination of the reference execution operation target, the reference execution operation target, and the reference execution operation destination, and the execution operation searched by the search means. The program according to claim 4 or 5, wherein the basic syntax of a highly relevant program code is extracted based on the target, the execution operation target, and the execution operation destination, and the above substitution is performed on the extracted basic syntax. Code automatic generation system. The above code generation means creates the above code table associated with a combination of a reference execution operation target, a reference execution operation target, and a reference execution operation destination with three or more levels of association with the basic syntax of the program code. The program code automatic generation system according to claim 6, further comprising reference. The program code automatic generation system according to any one of claims 1 to 7 , further comprising a program execution means for executing the program code automatically generated by the code generation means. Each terminal device in a communication network according to any one of claims 4-7, characterized by further comprising an operation destination registration means for registering in advance as the reference for execution operation target of the endpoint rating table Program code automatic generation system. The above-mentioned extraction means extracts a case component consisting of a starting point case that is affected by the instruction operation, and extracts the case component.
The storage means stores a start point case table in which the actual execution operation source for the reference start point case is associated with three or more levels of association.
The search means searches for an execution operation source for the extracted start point case by referring to the degree of association of the start point case table stored by the storage means.
By substituting the execution operation source searched by the search means into the basic syntax of the program code, the code generation means sets the execution operation target from the execution operation source to the execution operation destination. The program code automatic generation system according to any one of claims 4 to 7 , wherein the program code for executing the execution operation specified in the above is automatically generated. The above-mentioned extraction means extracts a case component consisting of a conditional case that depends on the instruction operation, and extracts the case component.
The storage means stores a condition case table in which the actual execution operation condition with respect to the reference condition case is associated with three or more levels of association.
The search means searches for the execution operation condition for the extracted conditional case by referring to the degree of association of the conditional case table stored by the storage means.
By substituting the execution operation condition searched by the search means into the basic syntax of the program code, the code generation means sends the execution operation target to the execution operation destination based on the execution operation condition. The program code automatic generation system according to any one of claims 4 to 7 , wherein a program code for executing an execution operation specified in an operation instruction is automatically generated. The program code automatic generation system according to any one of claims 1 to 11 , wherein the storage means stores the degree of association corresponding to the weighting coefficient of each output of the node of the neural network in artificial intelligence. .. The program code automatic generation system according to claim 7 , wherein the code generation means uses the degree of association corresponding to the weighting coefficient of each output of the node of the neural network in artificial intelligence.

Images