JP6895037B2 - Speech recognition methods, computer programs and equipment - Google Patents

Description

The present invention relates to speech recognition methods, computer programs and devices.

A logical program that allows a character string containing a variable as a literal and a processing system thereof have been researched and developed by the inventor (Patent Documents 1 to 8). Compared to conventional PROLOG, expressions that are closer to natural language can be handled as they are as knowledge sources (rules and facts) and question sentences (literals including variables), so they can be used significantly by elementary and junior high school students and the elderly. It's getting easier.
The most effective use by the elderly is voice-based dialogue with information modules (logical programs / thinking programs) that express the personalities of actual spouses and travel guides as knowledge.
However, regarding the current technical level of speech recognition, especially for short sentence recognition patterns, the more types of such recognition patterns that must be voice-recognized, the lower the recognition quality, so the types of recognition patterns It was difficult to develop large-scale content with many. For this reason, it has been difficult to provide content that satisfies the user by relying on the voice interface.

Japanese Patent Application No. 2013-087008 Japanese Patent Application 2015-219007 Japanese Patent Application No. 2016-09327 Japanese Patent Application No. 2016-103010 Japanese Patent Application 2015-234356 Japanese Patent Application No. 2016-196069 Japanese Patent Application No. 2016-290186 Japanese Patent Application No. 2016-21006

Therefore, the problem to be solved by the present invention is to make it possible to provide a large-scale content that satisfies the user while mainly using a voice interface that even elderly people can easily handle, and many for that purpose. It is to be able to deal with the types of recognition patterns without degrading the recognition quality.

In order to solve such a problem, claim 1 of the present invention is set forth.
The way computers interact with users,
Transition of user variables, output to the user (text, voice, etc.) in response to the computer recognizing the voice or environmental sound of the user (not limited to humans; the same applies hereinafter) as a predetermined recognition pattern. For multiple information modules containing information (including information on one or more recognition patterns) for a computer to perform (images, etc.) or both.
The first information module contains information (URI, in-memory pointers, structure array indexes, etc.) that allows the computer to reference the second information module.
When the computer references the second information module based on the information to be referenced in the first information module
Provided is a method in which a computer performs voice recognition by giving priority to the information of the recognition pattern included in the second information module over the information of the recognition pattern included in the first information module.
: Here, "priority" means not only lowering the degree of agreement with the recognition pattern included in the second information module compared to the recognition pattern included in the first module, but also lowering the first It also includes completely invalidating the recognition pattern information contained in the information module (for example, deleting it from the so-called "command list" (a set of voice recognition character strings) or temporarily masking it).
> By doing this, there are a large number of types of commands (character strings) that should be voice-recognized as a system (for example, when a set of information modules that are exchanged on the Internet is uploaded by an unspecified number of users, it is time. Even if it keeps getting bigger as it goes through), it is possible to register only the character strings (commands) that need to be recognized for each context and situation of the dialogue with the user in the command list (usually the command type is As the number increases, the difference between commands becomes smaller.) It becomes easier to maintain the quality of speech recognition, which tends to be misrecognized.

In addition, claim 2 is
The computer moves between the information modules (for example, the static file or the dynamically generated file pointed to by the URI) according to the information to be referred to, and the information other than the recognition pattern information is also the information of the second information module. The method according to claim 1, which is prioritized, is provided.
: Here, for example, the rule to move the information module that can be specified by <URI> as an Internet page is "<Recognition pattern> / <Recognition pattern display condition>: # <Variable (global / local) fluctuation>;< A coding rule can be set so that a human can describe it as a production script>; move to "";", etc., so that the interpretation program of the information module interprets depending on the coding rule.
> This makes it possible to edit / execute the content by the same method / protocol as the edit upload / download display of the Internet page, and the operation of the content becomes easy.

In addition, claim 3 is
Information other than the recognition pattern information is also second until the computer calls a subroutine between information modules (for example, a static file or a dynamically generated file pointed to by URI) and returns by the information to be referred to. The method according to claim 1, wherein the information in the information module is prioritized.
: Here, for example, the rule to move the information module that can be specified by <URI> as an Internet page is "<Recognition pattern> / <Recognition pattern display condition>: # <Variable (global / local) fluctuation>;< A coding rule can be set so that a human can describe it as a production script>; call "";", etc., so that the interpretation program of the information module interprets depending on the coding rule.
> This makes it possible to edit / execute the content by the same method / protocol as the edit upload / download display of the Internet page, and the operation of the content becomes easy.
: Management of subroutine call relations can be clearly performed by a known method such as a stack array.
> This makes it possible to concisely manage the caller, which is the final transition destination after the call, as a stack array, etc., and manage hierarchically structured menu information and story control information that is organized in a pedigree. Easy to operate.

In addition, claim 4 is
The computer
The method according to claim 3, wherein voice recognition is performed using only the information of the recognition pattern included in the information module on the chain of call relations at that time of the subroutine call.
> This makes it simple to determine and control the range of expansion and contraction of the recognition pattern when it corresponds to the original recognition pattern and also to the new recognition pattern according to the progress of a more specific situation. be able to.
> Especially from the top of the hierarchy, it becomes easier to reach all pages while maintaining recognition quality.

In addition, claim 5 is
The computer
The method according to claim 4, wherein voice recognition is performed using only the information of the recognition pattern included in the information module at the tip of the chain of call relations at that time of the subroutine call.
> As a result, the recognition pattern can be changed to the one in the moved hierarchy according to the command menu etc. configured hierarchically, and the recognition pattern set can be returned to the next higher hierarchy from any state (thus, the recognition pattern set is also returned to the original). ) It is also easy to make a state transition.

In addition, claim 6 is
The method according to claim 4 or 5, wherein a fixed recognition pattern for returning the calling relationship at that time of the subroutine call is provided regardless of the information module.
: Examples of "fixed recognition pattern" include "backward", "return", and "return to original page".
> This makes it possible for the user to perform voice recognition with a sense of security that he / she can return to the original place where the situation is more suitable no matter which information module is transitioned to.

In addition, claim 7 is
The method according to claim 4 or 5, wherein a fixed recognition pattern for clearing and returning all the calling relationships at that time of the subroutine call is provided regardless of the information module.
: Examples of the destination of "clearing and returning" include a page designated as a predetermined "home" in the environment variables and registry of the application, a page accessed by specifying a URI, and the like.
: Examples of "fixed recognition pattern" include "all cancel", "return to home", "go to top", and "start over".
> This makes it possible for the user to perform voice recognition with a sense of security that he / she can return to the original regardless of which information module he / she transitions to.

In addition, claim 8 is
When the recognized pattern does not exist for a given time, the computer
The method according to claim 4 or 5, which is programmed to automatically return the call relationship at that time of the subroutine call.
> By doing this, even an unfamiliar user can naturally return to the original home menu etc. if he / she is fooled for a while, and he / she can try a different menu (that is, speak) and make his / her own. The chances of getting to the command or question you want to give will increase if you take the time.

In addition, claim 9 is
The computer
When there are many recognition patterns that need to be voice-recognized
After displaying only a part of it on the screen
The method according to any one of claims 1 to 8, wherein screen scrolling or screen switching is performed according to a predetermined recognition pattern.
: Examples of "predetermined recognition pattern" are "right" (scroll right), "left" (scroll left), "up" (scroll up), "down" (scroll down), "top" (leftmost). Or scroll to the top), "bottom" (scroll to the right or bottom again), and so on.
> This makes it easy to see all of the options only by voice recognition.

In addition, claim 10 is
The computer
The method according to claim 9, wherein only the recognition pattern that can be displayed is the target of voice recognition.
> This makes it possible to improve the recognition quality by further narrowing down the recognition patterns while covering the options.

In addition, claim 11 is
The computer
When displaying only a part of the above on the screen
The method according to claim 9 or 10, wherein screen scrolling or screen switching is performed over a plurality of groups formed by grouping things that are difficult to be confused by voice recognition.
: For grouping of things that are not easily confused by speech recognition, for example, calculate the editing distance between texts that express recognition patterns (or texts that express their phoneme sequences), and group things that are close to each other into separate groups. It can be realized in this way.
: Also, when the screen is scrolled partially (that is, only a part of the displayed recognition patterns), any of the recognition patterns that are not included in the recognition pattern set to be scrolled out and remain without being scrolled out. Priority is given to recognition patterns that are not close to the editing distance (for example, greater than or equal to a predetermined threshold) and have not yet been displayed (initial display or scroll-in) or scrolled out. Can be programmed to scroll into.
> This improves the efficiency of scrolling and screen switching.

In addition, claim 12 is
The computer
The range of recognition patterns for voice recognition,
The method according to any one of claims 1 to 11, which can be changed for each situation specified by the user by voice immediately before.
: The following shows an example of "situation in which voice is specified immediately before" (when voice is specified as "situation equal XX") and corresponding "range of recognition pattern" (set).

===
Situation equal "contact"
・ Today's work was completed successfully ・ Behind schedule ・ Ask for support ===
Situation equal "weather survey"
・ Kanazawa / Komatsu / Tokyo ===
Situation equal "current"
・ What is the time?
・ What is the dollar market?
===
> This makes it possible to narrow down the appropriate recognition pattern according to the situation and improve the recognition quality. The squeezing may be listed in advance by humans, squeezed by defining a type such as a part of speech, or dynamically squeezed using PROLOG or the like.

In addition, claim 13 is
The computer
The range of recognition patterns for voice recognition,
The description in any one of claims 1 to 12, which is changed for each sentence type or case or case value (deep case, surface case, etc.) that the user automatically guesses by voice designation or voice immediately before. Provide a method.
: The following is an example in which the person in charge of programming interviewed the company and set the information module as the "communication menu" under the "home menu".

===
(A set of recognition patterns for the "communication menu" under the "home menu" of a certain company president)
・ Type is spontaneous report ・ Type is report request ・ Type is meeting ・ Type is presentation application ・ Type is business negotiation application by email ・ Type is business negotiation application by telephone ・ Type is business negotiation application by postcard ===
The subject is (a computer automatically prompts. A set that is displayed and becomes a recognition pattern depending on the type being "business negotiation application by telephone". The person in charge sets it in the computer in advance, etc. The same applies hereinafter)
・ I ・ Secretary ・ Sales manager ・ Manufacturing manager ・ "Cancel" (used under the communication menu) → Return to the communication menu under the home ・ "All cancel" (always present in any situation / context) → Home menu Return to ---
The other party is (a set that is displayed and becomes a recognition pattern depending on the fact that the computer automatically prompts. "The type is a telephone negotiation" and "(the subject) is the sales manager")
・ ○○ Industry ・ □□ Shokai ・ △△ Ironworks －－－
The product is (a set that is displayed and becomes a recognition pattern depending on the fact that the product is automatically prompted by the computer. "The type is a business negotiation by telephone", "(the subject) is the sales manager", and "(the other party) is XX industry")
・ Raw material A
・ Product B
・ Maintenance C
===

In addition, claim 14 is
Multiple of the above information modules,
Store in relation to the actual latitude, longitude or altitude, or virtual coordinates associated with the information module.
The method according to any one of claims 1 to 13, which enables voice recognition of only the information of the recognition pattern included in the information module located within the coordinate range specified by the user.
: "Related to the information module" means, for example, in the case of an information module for interacting with an AI that resembles a resident's personality, the latitude, longitude, altitude, etc. of the resident's address, and the information module moves. In the case of an information module for interacting with a body (for example, an actual traveler or a virtual monster in a role-playing game), it is the coordinates of its current position.
> As a result, the function equivalent to "calling out loud near the place of interest" can be performed on the computer.
> In this method, the user interface can be configured so that the user can experience the feeling of a journey exploring a region or virtual space while continuously moving latitude, longitude, altitude, virtual coordinates, etc. It is advantageous and can fulfill the desire of elderly people with mobility disabilities to explore the vicinity of their hometown, dramatically improving the QOL of a wide range of people.
> Also, when configuring as multimedia content linked with walking content or adventure games (images as well as audio may be displayed), you can move forward or backward in a specific direction on latitude or longitude, or move left or right. The UI can also be configured so that the direction can be changed (30 degree unit, 45 degree unit, 90 degree unit, etc.), which can be useful for walking or giving the game itself a bulge.

In addition, claim 15 is
Multiple of the above information modules,
It is stored in relation to the hierarchical theme tags (regional hierarchy, study field hierarchy, functional field hierarchy, etc.) related to the contents of the information module.
The method according to any one of claims 1 to 14, which enables voice recognition of only the information of the recognition pattern included in the information module located under the theme tag specified by the user.
: An example of a hierarchical theme tag is shown below. In this example, when the user specifies Matsumura, the information module (or "Japan>Ishikawa>Kanazawa>Matsumura>1-chome" is located in the directory of "Japan>Ishikawa>Kanazawa>Matsumura>1-chome". Information module (or information module including the theme tag "Japan>Ishikawa>Kanazawa>Matsumura>2-chome") located in the directory of "Japan>Ishikawa>Kanazawa>Matsumura>2-chome") The recognition pattern information of is also recognized by voice at the same time.

===
Japan Tokyo Ishikawa Kanazawa Matsumura 1-2 Chome ・ ・ ・
Komatsu Hakusan ・ ・ ・
===
Study Japanese Grammar Vocabulary ・ ・ ・
Arithmetic Four Rules Arithmetic Tsurukame Arithmetic ===
Functional safety QOL improvement Safety and hygiene Self-actualization ・ ・ ・
===
> This makes it easy to specify the range of various particle sizes.

In addition, claim 16 is
The method according to any one of claims 1 to 15, wherein when the same recognition pattern is associated with a plurality of outputs performed by a computer, only one output is executed using a random number.
> As a result, the meaning of saying the same thing over and over and the depth of the content will come out, and it will be possible to encourage revisit.

In addition, claim 17 is
Give a given information module a variable with a fixed value,
When the user loads the information module, the variable and the fixed value are stored and stored.
Any one of claims 1 to 16 configured so that the variable and the fixed value can be referred to by the other information module but cannot be changed or deleted even when the other information module is preferentially referred to. The method described in the section is provided.
: For example, in a processing system using a rich client, variables, facts, and rules starting with "&&" in the information module that is the home of each user are unique to that user, so the current of that rich client. From the home information module (set as a predetermined local file in the PC) to any other information module (other local files or net pages indicated by URI), the URI (currently the highest priority information module) Etc.), and it is not added, deleted, or updated, but can be configured to be referenced only by other information modules. This can be achieved, for example, by providing a mechanism similar to a global memory area or environment variable that can be referenced only by the rich client inside or outside the rich client. When allowing rich clients to load information modules as a program list, variables that start with && and facts and rules that start with PROLOG (but only those that start with &&) always remain at the beginning of the program. You may do it.
> As a result, no matter what information module is moved to, it becomes possible to recognize and process a specific recognition pattern preferred by the user.

In addition, claim 18 is
Give a given information module a variable that specifies that it is static or global,
When the user loads the information module, the variable is declared and defined globally,
The method according to any one of claims 1 to 17, which is programmed so that the variable can be referred to, changed, or deleted from the other information module even when the other information module is referred to preferentially.
: For example, in an implementation using a rich client, variables, facts and rules starting with "&" in the information module are static or global, and the current URI of the rich client (currently the highest priority). Information module) is maintained even if it is moved to any other information module (other local files or net pages indicated by URI), and a variable with its static value (for example, & $ {money} = 100,000,000 yen) ) Can also be explicitly referenced, updated, or deleted within the new information module.
> This makes it possible to maintain values and attributes that should be maintained even when the information module is moved, and it is possible to realize adventure games with high context consistency and communication between information modules (uniform reference range). Elimination of the harmful effects of limiting to).
: In the above example, when moving to a page with close latitude / longitude by turning and moving forward, variables starting with & will remain and accumulate. Not only movements with close latitudes and longitudes, but also such transitions for the recognition pattern "Move to Tokyo by Shinkansen" to move by Shinkansen or airplane, for example, "{& $ {money} = & $ { Possession money} -21000}; VLOAD http://humanote.xyz/jploc_kkh/0234/8562/56/Tokyo Station.jpl; "

In addition, claim 19 is
The method according to any one of claims 1 to 18, wherein the computer is programmed to indicate the fact by voice or screen display each time the set of recognition patterns for voice recognition is changed.
: Here, as an example of "indicating that", you may indicate a big break as "I entered the information module (page) of the zoo (in the virtual walking game)", and "The wizard is no longer nearby. You may show the difference between the options such as "(in the virtual adventure game)" and "you can now ask questions in English (in the area walk content)", and all the options after the change (recognition pattern). (A set of) may be read aloud by the computer, and processing associated with the recognition pattern that the user says "please do it" may be performed during or immediately after the reading.
> As a result, in the case of voice, it becomes possible to communicate only by voice, and it becomes possible to communicate complicated contents more effectively even while driving.
: Obviously, the voice output here is not only the voice synthesis (reading sound) from the text dynamically generated by automatic inference, but also the local live voice (play http://hoge.jp/aa.live). And recorded audio can also be played (play http://hoge.jp/aa.mp3). This makes it possible to provide more realistic virtual adventure games and community walk contents to scenes and user groups who want to communicate only by voice.

In addition, claim 20 is
In order to make voice recognition related to the method, the computer accumulates the content received by the user and the result recognized by the recognition pattern.
Claim 1 characterized by analyzing or evaluating the user's behavior, tendency or achievement (excluding the degree of improvement in pronunciation, including the degree of digestion and the range of digestion of the study curriculum and work quotas, etc.). To the method according to any one of 19 is provided.
: Here, it is precise to accumulate the date and time (in the clock managed by the client or server) and location (URI of the information module, GPS position of the user terminal, etc.) in relation to the user's speech behavior. It is advantageous for analysis and evaluation.

In addition, claim 21 is
The invention according to any one of claims 1 to 20, which is programmed so that a set of users who are simultaneously accessing the same information module or a set of information modules having close coordinates can perform group communication by text, voice, or audio / video. Provides a method of.
> As a result, the satisfaction level of users who rely on voice, especially as virtual adventure content and walking content, can be improved by opportunities to communicate with other users and to improve the value of the content by supplementing their own information. improves.
: It is advantageous that the user identification used here shows an ID different from the normal ID.
: This group communication will be displayed naturally or played as voice to the user's rich client unless it is suppressed (unless the suppression option etc. is checked), as in the real world, even if it is not explicitly started. Is advantageous.
: However, since it must be distinguished from your own remarks for voice recognition, the voice recognition of the reserved words "start chat" and "start command" allows the computer to recognize the voice in the mode of chatting with the surrounding people. You may switch the mode and use it.
: In addition, as information modules with close coordinates, it is also possible to include those with close branches in the hierarchy of themes (regions, studies, functions).

In addition, claim 22 is
Described in any one of claims 1 to 21 in which reserved words are prepared for focusing on contents other than audio (image display, current global variable state, status text indicated by the currently referenced information module). Provides a method of.
> This makes it easy to check the output of content other than audio.

In addition, claim 23 is
A computer program for carrying out the method according to any one of claims 1 to 22 is provided.

Also. 24.
An apparatus for carrying out the method according to any one of claims 1 to 22 is provided.

It is explanatory drawing which shows the example of the reference chain (stepwise operation of a menu hierarchy) of a plurality of information modules by the method of this invention.

Some examples described below additionally implement the above-mentioned functions specific to the present invention in the embodiment of the following patent specifications (excerpts from the above-mentioned Patent Documents 1 and 6) by the same inventor. It can be carried out by. In addition, the following citations of Patent Documents 1 and 6 also include supplementary purposes in terms of feasibility and inventive step of the present person.

===
<Problems of Patent Document 1> It is possible to automatically process knowledge expressed in the form of embedding variables in natural language on a computer in the same way as PROLOG, and comprehensive deduction and solution search (automatic unification processing) at the predicate logic level. , Automatic derivation processing, backward inference for that, backtracking).
Make full use of the advantage that variables are not tied to the case structure, speed up processing, and display the results in an easy-to-read manner for proof and learning.
<Solutions for Patent Document 1 (Overview)>
When a human inputs a "fact", "rule" or "goal" in PROLOG, the constant part and the variable part of the content corresponding to "literal" in PROLOG are input to the computer separately by the character type, delimiter or escape character.
The computer treats variables as being able to straddle boundaries such as the main part and predicate of a sentence, and performs automatic unification processing, automatic derivation processing, or both of the sentences included in the input.
The pattern, which is a statement that can contain variables, and the constant character string, which is a statement that does not contain variables, are unified, and the longest matching solution of the variable that first appears in the pattern is obtained, and the character string of the longest matching solution is obtained. For each new pattern that can be created by substituting the process of scraping from the back until it becomes an empty character, each state of the solution of the scraping process that was the premise that the new pattern can be created is stored in the same way recursively. Repeat until there are no variables, and combine the states of each intermediate solution that was unified when there are no variables to obtain the answer for each unification.
Detects whether the fixed character string in the pattern is included in the character string in the process of removing the longest matching solution, and speeds up.
Pattern-to-pattern unification is accelerated by focusing on the matching of the beginning and end of words. A concrete method of full search is also provided.
<Solutions for Patent Document 1 (full text, but some additions / corrections so as not to be confused with the present invention)>
(0009)
The present invention has been made in view of such a problem, and claim 1 of Patent Document 1 is set forth in claim 1.
A method in which a computer automatically performs some or all of the functions of the logical programming language PROLOG.
When a human inputs a "fact", "rule" or "goal" in PROLOG, the constant part and variable part of the content corresponding to "literal" in PROLOG (hereinafter referred to as "sentence") are character types, delimiters or escape characters. Input to the computer separately by
The above "facts", "rules" or Performing automatic unification processing, automatic derivation processing, or both of the sentences included in the input of "goal",
Provide a processing method characterized by.
Here, "human beings input the constant part and the variable part into the computer by distinguishing them by the character type, the delimita or the escape character" means that the human beings input in the input field of the application software (processing system) according to the present invention. Input directly after the command prompt (with or without a front-end processor, etc.), copy-paste or cut-paste from an Internet browser, text editing software, etc., or a text file that has been input and saved separately. Etc. are included in reading, quoting, referencing, etc.
In addition, "the computer treats variables as being able to straddle the main part, predicate, subject, predicate, object, complement, conjunctive modifier, conjunctive modifier, or sentence boundary of a sentence" means Japanese, etc. It can only straddle the boundaries (explicit delimiters) of case structures with explicit delimiters (including those that correspond to the hierarchical structure of parsing results and semantic analysis results) via prepositions such as assistants and English. Instead, it can straddle the boundaries between S and V, the boundaries between V and O, the boundaries between V and C, etc. in SV format, SVO format, SVOO format, and SVOC format, such as English, and the boundaries between compound sentences and compound sentences. Includes modes that are treated as possible (conversely, there may be modes that are not treated). In these cases, as solution candidates that can be included in variables, an arbitrary sub-character string is extracted from the entire sentence or the character string that constitutes the entire sentence, ignoring the unit of delimiter by the grammatical structure as the sentence, and further, the hierarchy. The whole of compound sentences / double sentences with a typical reference structure, longer papers, etc., and any substrings of them are targeted (note that it is a case where "sentence boundaries" are treated as possible. When dealing with a set of knowledge sources (for example, reading, writing, referencing, etc., a set of knowledge sources in a file), it is necessary to separate the knowledge sources at "other than" the sentence boundary. Therefore, for example, a line feed code, a tab code, or the like can be used as such a delimiter).
As a result, knowledge and information expressed in the form of embedding variables in natural language and knowledge and information in the ordinary sentence format are unified knowledge that opens up the possibility of realistic mutual utilization between them. As a source, it becomes possible to automatically process the two without distinguishing them by a computer (overcoming the above-mentioned "difficulty A").
In order to open up the possibility of "realistic" interaction "sufficiently", automatic processing by a computer should be provided as a search processing system. 1) Convenience of search formulas (expressions that specify patterns), 2) Sufficient The precision rate (accuracy of the solution), 3) the sufficient recall rate (comprehensiveness in extracting solution candidates) must be provided, but in the present invention, the sentence is free (that is, the grammar and meaning). While allowing the embedding of variables (multiple types or multiple times) in places (not limited to delimiters) (ensuring convenience), it is basically based on PROLOG's knowledge processing procedure (and underlying knowledge interpretation policy). By following this, the risk of reduced precision (solution accuracy) that can occur due to hybrid knowledge processing procedures (and complex knowledge interpretation policies corresponding to the hybrid processing procedures) as in other processing systems is avoided. At the same time, by "treating variables as sentence main parts, predicates, subjects, predicates, objectives, complements, contiguous modifiers, adjunct modifiers, or sentences that can cross boundaries", delimited expressions in natural language ( Unjustified disagreement (regular expression) caused by the appearance of crying of specified patterns by reading points, punctuation points, parentheses, commas, periods, etc.) and modifier phrases (advocacy phrases, adjunct phrases, non-essential case expressions, etc.) Unmatching) is prevented, and a certain degree of reproducibility (comprehensiveness in extracting solution candidates) can be ensured between superficial character string expressions (between search expressions and knowledge sources) where the case structure is not specified. In addition, it is possible to perform integrated and continuous quoting / extraction (as a solution candidate to a variable) that does not easily impair the exact context (character strings before and after) of the natural language that became the source of knowledge, and in the end, its transparency. The simplicity makes it easy and easy to confirm and verify the substantial soundness of the reasoning (the validity of the grounds and the reasoning process), and gives the user a realistic sense of security that the grounds are always clear. Take full advantage of the specification that variables are not tied to case structure (and you don't have to know about case structure rules (such as the order of appearance) and you don't have to worry that the order of arguments may be wrong). Allows you to cut.
Since the first object of the present invention is Japanese (the amount of information in one character is large and there is no space between words), there are many contents in which characters are used as processing units and delimiter units. (The amount of information in one character is small, the number of characters in one sentence is large, but there is a space between words), it is possible to perform the same processing in units of words separated by spaces.
(0010)
Further, claim 2 of Patent Document 1 is
In the automatic unification process
Unification of a pattern that can contain variables (a constant part and a variable part are distinguished by a character type, a delimiter, or an escape character) and a constant character string that is a sentence that does not contain variables.
Find the longest matching solution (eg Taro and Jiro) of the variable (eg $ X) that appears first (or last) in the pattern (eg $ X and $ Y like $ Z) and find the longest matching solution. Each new pattern (example: Taro and Jiro> Taro and Jiro> Taro and Jiro>Taro>Taro>Ta> empty) that can be created by substituting the process of cutting the character string from the back (or front) to the empty string : "Taro and Jiro and $ Y like $ Z">"Taro and Jiro and $ Y like $ Z">"Taro and Jiro and $ Y like $ Z">"Taro and $ Y like $ Z""Ilike">"Thick and $ Y like $ Z">"And $ Y like $ Z"), each state of the solution of the shaving process that was the premise that the new pattern can be created ($ X = While memorizing Taro and Jiro> Taro and Jiro> Taro and>Taro>Ta> Sky)
Recursively repeat until there are no more variables,
The state of each solution that was unified when the variable disappeared (example: true ($ X = Taro and Jiro, $ Y = Saburo), true ($ X = Taro, $ Y = Jiro and Saburo)) Characterized by combining and obtaining answers for each unification (example: answer 1 = ($ X = Taro and Jiro, $ Y = Saburo), answer 2 = ($ X = Taro, $ Y = Jiro and Saburo)) The processing method according to claim 1 of Patent Document 1 is provided.
Here, "(or last)" corresponds to "(or before)", and when substituting from the variable that appears last, it means that the start of scraping must be from the front.
This makes it possible to verify the state of each solution candidate that reliably covers all possibilities from the longest matching solution to the shortest matching solution, and to provide a comprehensive answer (a set of further narrowed solution candidates). It will be possible.
(0011)
Further, claim 3 of Patent Document 1 is
The processing method according to claim 2 of Patent Document 1, which is characterized in that instead of gradually cutting until it becomes an empty string, it gradually cuts only to the shortest matching solution obtained separately.
As a result, it is possible to save the calculation of the solution search from the length less than the shortest matching solution to the "empty" character, and it may be possible to speed up the automatic processing.
(0012)
Further, claim 4 of Patent Document 1 is
When gradually scraping until it becomes an empty string
If one character C (immediately after (or immediately before)), which is a fixed character immediately after (or immediately before) the variable first appears (or last) in the pattern, is another variable and the solution is not an empty string, the variable is changed to the other variable. When the first (or last) character C) of the solution candidate assigned as the solution candidate is included in the longest matching solution,
The processing method according to claim 2 or 3 of Patent Document 1, wherein the substring from the end (or the beginning) of the character string of the longest matching solution to the first character string corresponding to the C is deleted including the C. provide.
Here, "(or last)" corresponds to "(or just before)", and when substituting from the variable that appears last, it means that the start of scraping must be from the front.
As a result, it is possible to save the enumeration of solution candidates that do not match the fixed characters immediately after (or immediately before) the variable and the search based on the solution candidates, and it may be possible to speed up the automatic processing.
(0013)
Further, claim 5 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When requesting binding information that becomes the "goal" (including "sub-goal"; the same applies hereinafter)
Any one of claims 1 to 4 of Patent Document 1 that independently obtains binding information for each sentence constituting the "goal" and returns the return value true and the intersection of the binding information when the product set is not empty. The processing method described in the section is provided.
Here, the binding information is information indicating whether or not such a solution candidate has been assigned to each variable at the same time. The binding information that indicates one binding method for each variable is "variable name 1 = value 1, variable name 2 = value 2, ..., variable name N =" by interpreting "," as an AND combination. While it can be expressed in a list format such as "value N", multiple bindings can be expressed as a set of such lists, or as a common part between multiple bindings by explicitly specifying an AND / OR combination instead of ",". It can be expressed in the form of a combination, or in the standard form of conjunctive words or the standard form of selection, which standardizes the whole of multiple bindings.
As a result, in the case of a problem form in which there are multiple patterns (sentences) to be satisfied at the same time, and variables with the same name should have the same solution among the patterns (sentences) (for example, such an AND join query from the user, When there are multiple sentences in the body part of the rule), there is less possibility that a large amount of full-text search processing will be unnecessarily repeated for each unification result of the pattern on the left side of the rule, and the body It is possible to avoid the inefficiency of depth-first search while backtracking the part (more remarkable inefficiency in the form of embedding variables in natural language), and to simplify the processing for each pattern to be satisfied at the same time. It also makes the display and verification (integrity and soundness) of the inference process easy to understand. In addition, it is possible to prevent the ordering (between sentences in the body part), which is unnecessary for the intuition required as the meaning of the rule and should not be defined, to have a side effect on the inference process.
(0014)
Further, claim 6 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When requesting the binding information that is the "goal"
Empty the existing binding information first,
The sentence set contained in the "goal" is automatically calculated for whether the sentence can be true under the application of the existing binding information and the additional binding information for the possible binding information, and the additional binding information is used as the existing binding information. While adding, the sentence is recursively reduced except for the sentence.
The processing method according to any one of claims 1 to 4 of Patent Document 1 is provided in which the existing binding information when the sentence set becomes an empty set as it can be true is used as the binding information as the "goal". To do.
Here, "recursively reduce" means that the deeper the recursion, the smaller the statement set and the more complicated the binding information (more variables are bound, and the range of bound values is narrowed down). For example, it means to realize equivalent recursive processing by a process of making a recursive call in C language or a stack structure (structure array and stack pointer, etc.) for depth priority search originally declared and defined.
This simplifies the problem of automatically processing an open question consisting of multiple patterns of AND binding that must be satisfied at the same time, expressed in the form of embedding variables in natural language, into a simpler and recursive subproblem with the same structure. Transform and facilitate the display and verification (completeness and soundness) of the inference process.
(0015)
Further, claim 7 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When unifying the non-variable pattern with the non-variable fact
The processing method according to any one of claims 1 to 6 of Patent Document 1, which returns true when the pattern and the fact match as a character string, or returns false when the pattern and the fact do not match as a character string. provide.
As a result, the search can be performed simply and quickly.
When "facts that do not include variables" include multiple sentences separated by punctuation marks. The "match as a character string" may be provided with a mode in which the character string of the pattern may match a part of the actual character string.
As a result, a plurality of pieces of information of the same type can be collectively expressed as one fact and used as a search target. It also makes it easier to express some order between multiple elements (eg, size, preciousness, antiquity, etc.).
(0016)
Further, claim 8 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When unifying the pattern that does not include variables and the head part that does not include variables in the horn clause,
When the pattern and the head portion match as a character string, the result of applying the processing method according to claim 5 or 6 of Patent Document 1 with the body portion of the horn clause as a subgoal is returned.
The processing method according to any one of claims 1 to 7 of Patent Document 1, which returns false if they do not match, is provided.
This explains the sound mechanical interpretation when the head of the rule that expresses the variable in the form of embedding it in natural language does not include the variable, the seamless, easy-to-understand, simple and unified processing mechanism, and the corresponding inference process. Can be given.
(0017)
Further, claim 9 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When unifying a pattern that does not contain variables and a horn clause that has a head that contains variables,
Obtained by processing using the pattern as the "constant character string" in the processing method according to any one of claims 2 to 4 of Patent Document 1 and using the head portion as the "pattern" in the same processing method. About each binding information
If there is a true result of processing the one applied to the body portion of the horn clause as a "subgoal" of the processing method according to claim 5 or 6 of Patent Document 1, the true value is returned or exists. Provided is the processing method according to any one of claims 1 to 8 of Patent Document 1, which returns false if not.
As a result, when the head of the rule that expresses the variable in the form of embedding it in natural language contains the variable and the pattern that invokes this rule does not contain the variable, the bound range of the variable in the body part is limited in advance, and it is true. The processing of false judgment can be speeded up.
It can also provide a sound mechanical interpretation, a seamless, easy-to-understand, simple and unified processing mechanism, and an explanation of the corresponding inference process.
(0018)
Further, claim 10 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When unifying patterns with variables and facts without variables
The result of processing using the pattern as the "pattern" in the processing method according to any one of claims 2 to 4 of Patent Document 1 and using the fact as the "constant character string" in the same processing method. return,
The processing method according to any one of claims 1 to 9 of Patent Document 1 is provided.
As a result, all solution candidates (to case variables) between patterns and (static) facts are identified and returned as "results", which is the basis for overcoming "difficulty A" above. A simple mechanism can be given, facilitating not only visualization and verification of the inference process, but also learning through the user's hands such as rule modification.
(0019)
In addition, claim 11 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When unifying the pattern containing variables and the horn clause having a head part not containing variables,
The result of processing using the pattern as the "pattern" in the processing method according to any one of claims 2 to 4 of Patent Document 1 and using the head portion as the "constant character string" in the same processing method. The binding information (C) is true, and the binding information is true when the result of processing the body portion of the horn clause as a "subgoal" of the processing method according to claim 5 or 6 is true. Return true with (C),
The processing method according to any one of claims 1 to 10 of Patent Document 1 is provided.
As a result, all solution candidates (for each variable) between the pattern containing variables and the head (static without variables) are identified and returned as "results". Therefore, the above "difficulty A" The basic mechanism for overcoming it can be simply given, facilitating not only visualization and verification of the inference process, but also learning through the user's hands such as modifying rules.
It also simply transforms into a simpler and recursive (or mutual recursion) subproblem with the same structure, facilitating the display and verification (completeness and soundness) of the inference process.
In addition, a sound mechanical interpretation when the head of the rule that expresses the variable in the form of embedding it in natural language does not include the variable, a seamless, easy-to-understand, simple and unified processing mechanism, and the inference process corresponding to these. An explanation can be given.
(0020)
Further, claim 12 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When unifying the pattern containing variables and the horn clause having a head part containing variables,
Returns false if the number of fixed characters existing in the pattern and the head, tail, or both of the head does not match.
The processing method according to any one of claims 1 to 11 of Patent Document 1 is provided.
As a result, compared to a uniform search, it is possible to clearly save a large amount of calculation and improve the processing speed.
(0021)
In addition, claim 13 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When unifying the first pattern containing variables and the horn clause having a head part containing variables,
When the pattern matches the fixed characters for the number of characters existing at the head and tail of the head part,
Each binding information obtained by binding the head portion of the horn clause with each binding information for which the result of applying the body portion of the horn clause as a "subgoal" in the processing method according to claim 5 or 6 of Patent Document 1 is true. About the second pattern
If the second pattern does not contain variables
Processing was performed using the first pattern as the "pattern" in the processing method according to any one of claims 2 to 4 of Patent Document 1 and using the second pattern as the "constant character string" in the same processing method. Returns the result,
The processing method according to any one of claims 1 to 12 is provided.
Here, "when the second pattern does not contain variables" means that in the horn clause (rule), all the variables included in the head part are also included in the body part "also", and all the variables in the body part are included. As a result of the variables being bound by constants (fixed character strings), all the variables in the head part are also bound (assigned) by constants (fixed character strings), so the variables in the head part disappear and the head part becomes a constant character string. It means that it can be regarded.
As a result, the unification of the pattern including variables and the horn clause (rule) having a head portion including variables can be mechanically and automatically performed in a flow that is easy for the user to trace by using a simple calculation model.
That is, all solution candidates (those that should be assigned to each variable of the pattern) between the pattern containing the variable and the head part that does not include the variable (by each binding information) (= constant character string) are identified and " By reducing the original more complicated problem (variable-to-variable unification) (transforming the problem) in the form of returning as a "result", the basic mechanism for overcoming the above "difficulty A" is simplified. It is made easy to express as a giving and thinking process. In addition, in this "reduction (conversion of the problem)", it is simply converted into a sub-problem with the same structure that is simpler and recursive (or mutual recursion), so that the inference process is visualized and verified (completely). It facilitates learning through the user's hands, such as modifying rules as well as (of sexuality and soundness). After all, a sound mechanical interpretation when the head of the rule that expresses the variable in the form of embedding it in natural language contains the variable, a seamless, easy-to-understand, simple and unified processing mechanism, and an explanation of the inference process corresponding to these. Can be easily given.
(0022)
In addition, claim 14 of Patent Document 1 is
The processing method according to any one of claims 1 to 13 of Patent Document 1, wherein the computer restricts the input of facts including variables.
Here, the facts including variables (knowledge sources that are not rules) include, for example, "$ X is $ X" (tautologically tautological fact) and "$ X is $ Y" (. There is no basis for truth if only the superficial sentence patterns match).
By limiting the input of these to the computer, the calculation of the automatic unification process of patterns (sentences that can contain variables) and facts (sentences that do not contain variables (= fixed character strings)) becomes simple. , High-speed answer is possible by automatic processing. It also makes it difficult to mix unfounded facts into knowledge sources.
(0023)
In addition, claim 15 of Patent Document 1 is
The rule has a form similar to the so-called horn clause, and any one of claims 1 to 14 of Patent Document 1 is characterized in that the computer restricts the head portion from including a variable that does not appear in the body portion. The processing method described is provided.
Here, "the computer restricts the head part from including variables that do not appear in the body part" means that the head part is "$ X is nice" and the body part is "$ Y is strong, $ Y is $". Even if the variables in all the sentences in the body part ($ Y and $ Z in this example) are bound (assigned), such as "Z-friendly, $ Z is a child, $ Y is smart", the variables in the head part In this example, it means that the computer restricts the input, storage, and activation of rules that leave ($ X) unbound as a source of knowledge. Such a rule leads to leaving unbound variables in the head, as in the case of facts, which tends to produce unhealthy inference results and slows down inference.
By restricting the input of such rules to the computer, the pattern (sentence that can contain variables) and the head part (sentence that does not contain variables (= fixed character string) according to claim 13 of Patent Document 1) can be combined. The calculation of the automatic unification process with (reducible) is simplified, and high-speed answering by the automatic process becomes possible. It also makes it difficult to produce unfounded inference results.
(0024)
In addition, claim 16 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
Automatic unification of patterns and heads or facts with unbound variables remaining in each other,
The processing method according to any one of claims 1 to 13 of Patent Document 1, which is performed by obtaining and returning a set of solutions which is a minimum as a fixed character string, is provided.
Here, as an example of "a set of solutions that are minimal as a fixed character string", as a result of automatic unification between "$ A is $ B" and "$ C is also $ D", {($) A = "mo", $ B = <empty>, $ C = <empty>, $ D = "is"), ($ A = empty, $ B = "also", $ C = "is", $ D = Empty)} may be provided.
This makes it possible to provide an example of a solution (especially the smallest simple example) even when there are an infinite number of solutions.
(0025)
In addition, claim 17 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
Automatic unification of patterns and heads or facts with unbound variables remaining in each other,
It is characterized by finding and returning a set of solutions that is the minimum as a character string containing variables.
The processing method according to any one of claims 1 to 13 of Patent Document 1 is provided.
Here, as an example of "a set of solutions that are minimal as a fixed character string", {($) as a result of automatic unification between "$ A is $ B" and "$ C is also $ D". A = "$ C also", $ B = <free>, $ C = <free>, $ D = "is $ B"), ($ A = <free>, $ B = "also $ D", $ It may provide two solutions such as C = "$ A is" and $ D = <freedom>)}. It is considered that the total (through the solution) of the character string length of the value that binds the variable (the value assigned to the variable) (however, if the variable is included, it is regarded as one character per occurrence of the variable) is minimized. be able to.
This makes it possible to provide a general form of a solution even when there are an infinite number of solutions.
(0026)
In addition, claim 18 of Patent Document 1 is
When the fixed characters for the number of characters that are common to the beginning and tail of each character string of the head part or fact and the pattern in which unbound variables remain are not the same.
Characterized by returning false,
The processing method according to claim 16 or 17 of Patent Document 1 is provided.
As a result, automatic search that cannot be unified can be saved, and automatic processing can be speeded up.
(0027)
In addition, claim 19 of Patent Document 1 is
When finding a set of solutions that is the minimum as a character string containing the fixed character string or variables,
Each variable contained in both character strings (the first character string and the second character string) consisting of a pattern and a head part or a fact in which unbound variables remain in each other is bound in common within each character string. And while being bound independently between strings (or, the scope for binding variables with the same name in common is only within each string (or between strings is outside the scope of the variable)).
For each variable, any substring (<empty>) of the other string (the second string for the variable in the first string, the first string for the variable in the second string) and It is characterized by finding a set of solutions that is the minimum by a full search that searches for a case where both character strings match by substituting itself (including the entire character string).
The processing method according to claim 16 or 17 of Patent Document 1 is provided.
"Or substitute yourself ..." means to substitute "$ X" itself for "$ X" in the character string, and it happens to be in the first character string or the second character string. When $ X (the scopes of each are different) is included, the first character string $ X and the second character string $ X can be distinguished (for example, "$ X1" and "$". Clearly sound calculations can also be made by substituting (as X2 ”, etc.).
As a result, it is possible to secure a certain degree of completeness of the solution set (completeness depending on the nature of the problem (pattern pair)) while ensuring soundness and halting property (finiteness of calculation).
(0028)
Further, claim 20 of Patent Document 1 is
Not the two strings themselves, which consist of patterns and heads or facts with unbound variables remaining in each other
Both character strings corresponding to the two character strings remaining after excluding the fixed characters for the number of characters that are common to the beginning and tail of each character string of the pattern and the head part or fact where unbound variables remain in each other. about,
A processing method for performing the processing according to claim 19 of Patent Document 1 is provided.
As a result, the space for the entire search can be reduced while maintaining a certain degree of completeness (in some cases, completeness) of the solution set, and the processing speed is increased.
For example, as a process of automatic unification between "Ishikawa's $ A likes $ B." And "Ishikawa's $ C also likes $ D ice cream." Delete the common part of "$ A is $ B"
And "$ C is also $ D ice cream"
Then, by full search, all the substrings of "$ C is also $ D ice" for "$ A" and "$ B" (this is a variable such as $ C and $ D ($ {... (The same applies to variables in the form of}) is 6 characters if it is 1 character, so while substituting 6 x (6 + 1) / 2 + 1 (<empty> minutes) + 1 (substringing itself) = 23 ways) , Similarly, all substrings of "$ A is $ B" for "$ C" and "$ D" respectively (since this is also 3 characters, 3 x (3 + 1) / 2 + 1 + 1 = 8 ways For all the character strings (23 x 23 x 8 x 8 ways) that can be created by substituting (existing), if both character strings match (for example, (for example)
"Moha ice cream",
"Hamo ice cream",
"$ A is ice cream",
"$ C is also ice cream",
"$ A is also $ D ice cream"
* By the way, the set of substitution sets when "$ C and $ B ice" do not match) {
($ A = "also", $ B = "ice", $ C = <empty>, $ D = "is"),
($ A = <empty>, $ B = "also ice", $ C = "is", $ D = <empty>),
($ A = "$ A", $ B = "also ice", $ C = "$ A is", $ D = <empty>),
($ A = "$ C also", $ B = "ice", $ C = "$ C", $ D = "is"),
($ A = "$ A", $ B = "also $ D ice", $ C = "$ A is", $ D = "$ D")} or a set of partial substitutions for each assignment set (eg, $ D = "$ D")} {
($ A = "also", $ B = "ice"),
($ A = <empty>, $ B = "also ice"),
($ A = "$ A", $ B = "also ice cream"),
($ A = "$ C also", $ B = "ice"),
($ A = "$ A", $ B = "also $ D ice cream")
})
Can be answered as a solution.
Note that $ A = "$ A" and $ B = "also $ D ice" can be freely $ A and $ D, and can be unified by substituting any character string there (that is,). It is possible to show that there are infinite solutions and how the constraints (regular expression form) of the infinite number of solutions (character strings) should be. (0029)
In addition, claim 21 of Patent Document 1 is
Substitute any substring (including <empty> and the entire string) of the other string for each variable, or try to find a case where both strings match. When asking
When a variable is included in the substring to be assigned to a variable, the variable contained in the substring is replaced with a new variable that did not previously exist in both strings, and the same assignment to the new variable is made. Further, the processing method according to claim 19 or 20 of Patent Document 1, which is performed recursively to search for a case where both character strings match, is provided.
As a result, it is necessary to search for a solution in which a fixed character in the own character string is reflexively assigned to a variable in the own character string via a variable in the other character string (for example, both character strings = { In the case of "$ X is $ X", "i $ Y u"}, it is necessary to be able to enumerate ($ X = "say", $ Y = "u yes") as solution candidates). The completeness of the solution candidate enumeration can be improved while maintaining the soundness. In the above example, both character strings (also called "pattern pair") = {"$ X is $ X", "i $ Y u"} to ($ X = "say", $ Y = "u yes") According to the present invention, it is possible to recursively search for the solution candidates ($ X = "i $ {Y1} u") ⇒ ($ {Y1} = <empty>) ⇒ ($ Y = "uye"). It can be shown by being able to generate branches (which are part of a search tree and can be generated in a finite number of times in the case of breadth-first search according to the present invention).
“Recursively ... full search” means, for example, a matching substitution series while performing a breadth-first search that recursively repeats each possible assignment to each variable (same as the claim of the previous patent document 1). (For example, the above ($ X = "i $ {Y1} u") ⇒ ($ {Y1} = <empty>) ⇒ ($ Y = "uye"), etc.) are listed. The first variation of the assignment is if the types of variables in both strings are 2 and 3 respectively and the length of the string is 6 and 7 characters respectively (variables are collectively counted as 1 character). 2 pieces x (7 x (7 + 1) / 2 + 1 + 1) + 3 pieces x (6 x (6 + 1) / 2 + 1 + 1) = 60 + 69 = 129 ways. When performing a breadth-first search so that the maximum depths of further branches derived from these branches are equal, a limiter (program step to compare with the upper limit value, etc.) is provided according to the number of substitutions, etc., so that each search is performed once. Can be limited to an appropriate amount of calculation (ensure of stopping and response speed that is no longer guaranteed by reflexivity). Even in the case of a depth-first search, the amount of calculation can be limited by limiting the depth, the number of substitutions, and the like. In each case, an infinite loop by self-recursive or mutual recursion is provided, and a stack structure (array of structures) that manages recursive function calls is provided, and call parameters (its substitution series) of branches that are ancestors (more root direction). (It may include the state representation of both character strings according to (assignment context)) can be avoided by comparing it with the current calling parameter. In addition, it is also possible to prun a branch that cannot be unified depending on whether or not the fixed character strings existing at the beginning and end of both character strings match the number of characters existing in common. If a solution is not found by searching for a limited amount of calculation (for example, 1 million substitutions or search depth within 20), it is found as "no solution (accuracy: 1 million substitutions and search depth within 20)". In that case, as "($ X =" say ", $ Y =" yes "), (...), ... (However, accuracy: 1 million substitutions and search depth within 20)", etc. It is also possible to answer the user while clearly indicating the search accuracy. In addition, if the entire search can be clearly performed within the limit number of substitutions and within the limit search depth (when there is completeness), "no solution (complete search completed)" or "($ X =") to that effect. It is also possible to answer the user by clearly stating ", $ Y =" Uye "), (...), ... (Completely searched)".
(0030)
In addition, claim 22 of Patent Document 1 is
As for the result of assigning to the variable, the two character strings that remain after removing the fixed characters for the number of characters that are common to the beginning and end of each character string from both are
As the "other party's character string" that is the target of "any substring of the other party's character string (including <empty> and the entire character string)", it exists at the beginning or end of the character string as the search progresses. Characterized by reducing the number of fixed characters,
The processing method according to any one of claims 19 to 21 of Patent Document 1 is provided.
As a result, the number of branches decreases as the search progresses (the more the branch goes to the tip), and the amount of calculation can be saved.
(0031)
In addition, claim 23 of Patent Document 1 is
When finding a set of solutions that is the minimum as a character string containing the fixed character string or variables,
Each variable contained in both character strings (the first character string and the second character string) consisting of a pattern and a head part or a fact in which unbound variables remain in each other is bound in common within each character string. And while being bound independently between strings (or, the scope for binding variables with the same name in common is only within each string (or between strings is outside the scope of the variable)).
It is a processing method to find a set of solutions by recursively substituting a fixed character string (including an empty string) or a character string containing a variable into each variable.
Limit the variables to be assigned to the variables at the beginning or end of the own character string whose head or tail is a fixed character.
The substitution value is a new variable or <empty> following the fixed character or fixed character string of the head if it is the head, and a fixed character or fixed character string of the tail following the new variable if it is the tail. Or <empty>
For the result of assigning to the variable, the fixed characters for the number of characters that are common to the beginning and the end of each character string are repeatedly removed from both.
The processing method according to claim 16 or 17 of Patent Document 1 is provided.
This makes it possible to significantly limit the enumeration range of solutions (without impairing the completeness of the search) by focusing on the existence of fixed characters at the beginning and tail, which enables significant computational complexity savings and speedup. Become. (0032)
In addition, claim 24 of Patent Document 1 is
When finding a set of solutions that is the minimum as a character string containing the fixed character string or variables,
Each variable contained in both character strings (the first character string and the second character string) consisting of a pattern and a head part or a fact in which unbound variables remain in each other is bound in common within each character string. And while being bound independently between strings (or, the scope for binding variables with the same name in common is only within each string (or between strings is outside the scope of the variable)).
It is a processing method to find a set of solutions by recursively substituting a fixed character string (including an empty string) into each variable.
Binds the binding information that can be created using only the fixed character types (character types excluding variable identifiers and delimiters) in both character strings that can be created by excluding the common fixed characters for the number of characters that exist at the beginning and end of each character string. The processing method according to claim 16 or 17 of Patent Document 1, which is obtained by enumerating the values in ascending order from the one having the smallest total character string length.
As a result, problems with certain properties can be efficiently reached and listed.
(0033)
Further, claim 25 of Patent Document 1 is
Based on the obtained "set of solutions that is the minimum as a character string containing variables"
The processing method according to claims 19 to 24 of Patent Document 1 is provided, in which the search is continued by the horn clause that can temporarily rewrite the variable of the horn clause with a character string including the variable.
As a result, it is calculated that the pattern and the head part of the horn clause (rule) are required to be unified (in the above example, the variable "$ C" is in the form of "$ A is". There is also a unification policy (for example, in the case of the last assignment set above) in which the constraint that it can be unified only by being bound (assigned) by a character string works), in the body part of the horn clause. It can be propagated to the search process and the search can be streamlined.
(0034)
In addition, claim 26 of Patent Document 1 is
Based on the obtained "set of solutions that is the minimum as a character string containing variables"
A set of fixed character strings that can be created by substituting each element of the set of fixed character strings defined in advance as the set of solutions of the "facts containing variables" into the variable part of the "character string containing variables". return,
The processing method according to any one of claims 19 to 25 of Patent Document 1 is provided.
As a result, a database (for example, "word equation (registered trademark)" and "VLANK (registered trademark)" that links facts containing variables (one or more) and a set of appropriate answers (or hypotheses) that can be filled in the variables (for example) It is possible to search for a solution in an efficient manner with the knowledge source in "". In addition, a large number of facts having similar sentence patterns can be efficiently managed in cooperation with the framework of the present invention.
(0035)
In addition, claim 27 of Patent Document 1 is
In the automatic unification process or the automatic derivation process
When performing automatic unification between the first pattern containing variables and the second pattern containing variables,
When the fixed characters for the number of characters existing at the beginning and tail of both patterns match, and the same variable appears only once in each pattern
Returns information that means the existence of an infinite number of solutions,
The processing method according to any one of claims 1 to 26 of Patent Document 1 is provided.
(0036)
In addition, claim 28 of Patent Document 1 is
Provided is an apparatus for carrying out the method according to any one of claims 1 to 27 of Patent Document 1.
(0037)
In addition, claim 29 of Patent Document 1 is
Provided is a computer program for causing a computer to execute the method according to any one of claims 1 to 27 of Patent Document 1.
(Effect of Invention of Patent Document 1)
(0038)
The effects of the present invention are as described above with respect to the claims of each Patent Document 1.
(Brief description of the drawings of Patent Document 1)
(0039)
(Fig. 1) Fig. 1 is an overall view of a network system in which the present invention is most effectively implemented. (Example 1)
FIG. 2 is an explanatory diagram showing a hardware configuration of a computer for carrying out the present invention. (Example 1)
FIG. 3 is an explanatory diagram showing an example of screen display in a terminal for carrying out the present invention.
(Example 1)
(Form for carrying out the invention of Patent Document 1)
(0040)
The present invention can be carried out on all kinds of computers connected / not connected to a network (cloud server, large general-purpose machine, desktop PC, notebook PC, mobile terminal, dedicated machine of the present invention), but it is general. The description will be given in a form realized by a PC connected to the Internet, which has a multitasking function and a window function.
FIG. 1 is an overall view of the network system that implements the present invention most effectively, and the content management device 1 is a content (rule or fact) handled by the user PC2 or the user / administrator PC2 in the present invention. A well-known file sharing server that accepts posts and distributes content while controlling sharing access rights and content provision priorities according to a predetermined policy may be used. The user PC2 inputs and stores the content (rules and facts) expressing the content (or content to be examined) in natural language for each user according to the method of the present invention, and stores the content (rules and facts) according to the method of the present invention. Computers, mobile terminals, etc. that process.
FIG. 2 is an explanatory diagram showing a hardware configuration of a computer used in the present invention. This is a general configuration of a computer, and a feature of the present invention is a process processed by the CPU 2e using a natural law according to the instructions and descriptions of the program 3 and the content data 4 stored in the non-volatile memory 2h. It is in the content of the above and the ideal way of the dialogue protocol (format) with the user.
FIG. 3 is an explanatory diagram showing an example of screen display in a terminal for carrying out the present invention. In the figure, in response to the question "? $ A not done" (open question format), "$ A =" is used by using the fact that "do not do anything unpleasant" in the first line of the memorized list L (not shown).
I enumerate the answers "as much as possible / 1 /" and answer "$ A = bullying / 9 /" using the fact that "do not bully" on the 9th line of the list L.
(0041)
In such an embodiment, a computer program manufactured via C ++ language or the like can cause a computer (PC or the like) to perform all possible operations. Therefore, known basic operations of computers using the laws of nature (storage / retrieval to registers, memory, and storage, four-rule operations, comparison, etc.) and general functions that have already become standard libraries for development environments, etc. (Assignment / comparison / copy to variables and N-dimensional arrays, operation / comparison / display of character strings and numerical values, operations such as list structure / queue structure / hash structure / vector type, binary search and sort operations, by regular expression The method of realizing the pattern matching operation, network communication operation, etc.) is different from the essence of the present invention (unique configuration leading to novelty and progress) and is well known to those skilled in the art, and will not be described in detail. .. On the other hand, what kind of operation order and storage method (algorithm and data structure) is used to realize the processing peculiar to the present invention by combining such general functions will be described in detail below. By providing an explanation of this algorithm, etc., an explanation of the above-mentioned problem-solving means, and an explanation of the drawings of the present invention for reference in development, a standard-level professional programmer can use standard application program development techniques ( It is possible to make a computer carry out the method of the present invention by using a GUI application integrated development environment by C ++, etc., and it is also possible to create a device or a program for this method.
(0042)
The algorithm shown below is an algorithm based on standard structured programming in which a desired "function" is newly defined using C language / C ++ language or the like and then a function is called. A processing means (program) corresponding to the solution means of the present invention while performing input / output and function separation according to the function division of each of the following functions (or by coding the function group as it is according to the specifications shown below). And a computer) can be realized.
(0043)
■ Processing algorithm specifications of knowledge list L for inquiry P
================================================== ================================================== =================
Function Q1 (P: pattern that can include variables, L: knowledge list): ★ Example 1 of Patent Document 1 of the main function common to the claims of Patent Document 1 ★
{
1. 1. Extract the content B (fact or Horn clause) of the first line of L.
However, if L is empty (if the first line could not be retrieved), a false output is output and the process ends.
2. The initial value of the variable binding information C is emptied, the following function H (P, B, C) is called, and the true (= matching) binding information (= solution set) C is output.
When true (= matched) True (yes) is output (the line number of the matched content B is also output).
If false, do nothing.
3. 3. If there is a content B'on the next line of L-Set B ← B'and move to 2.
If not ・ If true is never output in 2, false (no) is output.
・ End.
}
(0044)
■ Processing algorithm specification of knowledge list L for inquiry P (pre-fixed character string version) =============================== ================================================== ====================================
Function Q2 (P: pattern that can include variables, L: knowledge list): ★ Example 2 of the main function common to the claims of Patent Document 1 (pre-fixed character string version) ★
{
(Pre-fixed character string)
1. 1. Find the fixed character string text T with {all character strings that can be deduced only from L / the line number set of L used as the basis for deducing each character string} as each line.
Specifically, the text T obtained by merging the elements of the output series (A = solution 1 / rationale 1, A = solution 2 / rationale 2, ...) Of the above function Q1 ("$ A", L) as each line is used. Ask.
In the case of an infinite loop in the middle of the calculation, the deduction is partially omitted by the infinite loop detection function using an explicit call management stack or the like.
-For example, whether the computer is trying to confirm the authenticity of the same horn clause under the same variable binding condition while the computer is performing the confirmation of the authenticity of the horn clause under the same variable binding condition.
Manages the call management stack whose members are structures (the horn clause identifier being confirmed, the current variable binding condition),
Detect an infinite loop by linearly searching for the same combination towards the root of the stack at the time of the call.

(Since it is only a fixed character string, the solution set is obtained by a simpler method (function F) than Q1)
2. For each line t of the text T, all Cs for which the following function F (P, t, C) is true are output.
(Output of final result)

3. 3. If there is at least one C, it outputs true, otherwise it outputs false.
}
(0045)
■ Processing algorithm specification of one fact (fixed character string) or horn clause B (however, all variables included in the head also exist in the body) for inquiry P
================================================== ================================================== =================
Function H (P: pattern that can contain variables, B: one fact (fixed character string) or horn clause, C: variable binding information): ★ Of the functions used in the inventions of claims 1 to 15 of Patent Document 1. Example 1-1 of Patent Document 1 ★
{
If P does not contain a variable {
If B is a fact {
If P = B, it returns true.
Otherwise, it returns false.
}
If B is the horn clause {
When the head part of B does not contain a variable {
In the case of the head portion of P = B, the truth of the function D (body portion of B, E) is returned.
Otherwise, it returns false.
}
When the head part of B contains a variable {
For each C1 whose true F (B head, P, C1)
If there is C1 for which the result of the function D (C1 applied to the body part of B, E) is true, the true is returned.
Otherwise, it returns false.
}
}
}
If P contains a variable {
If B is a fact {
If there is a C1 for which F (P, B, C1) is true, then all such C1s are added to C and the truth is returned.
If such C1 does not exist, it returns false.
}
If B is the horn clause {
When the head part of B does not contain a variable {
If there is a C1 whose true F (P, B head, C1) and the function D (B body, E) is true, then all such C1s are added to C. Returns true.
Otherwise, it returns false.
}

When the head part of B contains a variable {
★ When implementing the invention of claim 12 of Patent Document 1 ★
// Start of speed-up device (option) When the fixed characters for the number of characters existing in the head and tail of the heads of P and B do not match {
Returns false.
}
// End of speed-up device (option)

★ Implementation of the invention of claim 13 of Patent Document 1 ★
When the fixed characters for the number of characters existing at the head and tail of the head of P and B match {
For any binding information G in E for which the result of the function D (body part of B, E) is true, the function F (the head part of P and B is bound by G (should be a fixed character string)). , C1) If there is C1 that is true
Add all such C1s to C and return true.
If such C1 does not exist, false is returned.
}
}
}
}
}
(0046)
■ Enumeration algorithm specification of solution set of body part of horn clause (or inquiry of compound sentence sharing variable)
================================================== ================================================== =================
Call example → Function D ("$ A and $ B are friends, $ A is human, $ B is human", E);
Return example ← True (E = ((A = Hanako, B = Taro), (A = Taro, B = Jiro), (A = Jiro, B = Saburo)))
================================================== ================================================== =================
Function D (J: body part (or inquiry of compound sentences sharing variables), E: solution set): ★ Example 1-2A of Patent Document 1 of the function used in the invention of claim 6 of Patent Document 1 ★
* However, the entire knowledge source L is stored in a global variable so that it can be referenced {
1. 1. Take out the first sentence M in J. Returns true if the first sentence does not exist.
2. The function Q1 (M, L) or Q2 (M, L) is called for the entire knowledge source L.
If the result is false, false is returned.
When true When M does not contain a variable
do nothing.
When M contains a variable
Stores a set C of binding information that can be taken to make M true.
* Variables that do not need to be bound to be true can be explicitly indicated.
* If a certain condition is required to make it true even though the binding value is an infinite set, that condition can be added.
3. 3. The next sentence M'in J is taken out. If it does not exist, it returns true (E = set of binding information C).
4. The function Q1 (M', L) or Q2 (M', L) is called for the entire knowledge source L.
If the result is false, false is returned.
When true When M'does not contain a variable
do nothing.
When M'contains a variable
Let the new C be the intersection of the set C'of the binding information that can be taken to make M'true and the memorized set C.
However, if the original set C is not an empty set but an intersection and becomes an empty set, false is returned.
* Variables that do not need to be bound to be true can be explicitly indicated.
* If a certain condition is required to make it true even though the binding value is an infinite set, that condition can be added.
Return to 5.3.
}

Function D2 (J: body part (or inquiry of compound sentences sharing variables), E: solution set): ★ Another Example 1-2B of Patent Document 1 of the function used in the invention of claim 6 of Patent Document 1. (The speed is increased by spreading the binding information to other statements using the recursive call of the function) ★
{
1. 1. Take out the first sentence M in J. Returns true if M does not exist.
2. Call Q1 (M, L) or Q2 (M, L) for the entire knowledge source L.
If the result is false, false is returned.
When true If M does not contain a variable If there is no sentence next to J, it returns true. If it is true, the next sentence is set as a new M and returns to 2.
When M contains a variable If there is no sentence following J, the binding information that can be taken is stored in E, and if the truth is returned, the binding information that can be taken is stored as a set C.
3. 3. Empty E and execute recursive call D2 (body part J', E'that can be bound after the next sentence of J by K) for each binding information K in the set C. If the result is true, set to E. , Add that K and E'that became true 4. Returns false if it has never been true for each K, and returns true (E) if it has never been true}

Function D3 (J: body part (or inquiry of compound sentences sharing variables), E: solution set): ★ Example 1-3 of Patent Document 1 of the function used in the invention of claim 5 of Patent Document 1.
{
1. 1. Take out the first sentence M1 in J. Returns true if the first sentence does not exist.
2. Call Q1 (M1, L) or Q2 (M1, L) for the entire knowledge source L.
If the result is false, false is returned.
When true When M1 does not contain a variable
do nothing.
When M1 contains a variable
Stores a set C1 of possible binding information.
3. 3. Similarly, C2, C3 ... Are obtained for M2, M3 ... As long as they are not false.
If it becomes false, false is returned.
4. The intersection C is obtained for the remaining C1, C2, C3 ... Cn, and true (C) is returned.
}

(0047)
■ Enumeration algorithm specification of multiple-length matching solution (s) of fact S for inquiry P
================================================== ================================================== =================
Call example → Function F ("$ A and $ B are friends", "Taro, Jiro and Saburo are friends", "");
Function F (P: pattern that can include variables, S: constant character string, C: bound information of variables): ★ Invention of claim 2 of Patent Document 1 (however, "(or last)" and "or before" Example 1-4A of Patent Document 1 of the function used in the omitted implementation example)
{
(Preparation)
1. 1. Find the number of types V of variables in P and the names N1, N2, ... Of the variables that appear in the order of appearance.

(Correspondence when P originally does not contain variables)
2. When V is 0,
⇒ When P = S, return true and finish.
⇒ When P ≠ S, return false and finish.

(output)
3. 3. When V is 1, no matter how many times N1 appears in P, there is only one solution R1 for unification of P and S.
⇒ If there is a match, the only solution is output as "C and N1 = R1", and the truth is returned and the process ends.
⇒ If there is no match, return false and finish.
* The unification itself can be performed as a match with the regular expression (if the same variable appears more than once, there is a postscript reference).

4. When V is 2 or more, the longest matching solution R1 for the variable N1 executes the recursive call F (P', S, C and N1 = R1) for P'that can fill all N1 in P ⇒ longest for N1 The solution set as a matching solution is output

5. R1'← Recursive call F (P'', S, C and N1 = R1') for P'' which can be a character string excluding the last character of R1 and all N1 in P can be filled with R1'. Execution ⇒ For N1, a solution set with solution candidate R1'excluding one character from the longest matching solution is output.

6. When R1'is one or more characters (★ When it is larger than the number of characters of the shortest matching solution in claim 3 of Patent Document 1)
⇒ Return to 5 as R1 ← R1'.
In the case of 0 characters (★ When the number of characters of the shortest matching solution in claim 3 of Patent Document 1)
Finished.
}

(0048)
Function F (P: pattern that can include variables, S: constant character string, C: variable binding information): ★ Examples 1-4B of the function used in the invention of claim 4 ★
// Function F that focused on the first character C of the fixed character string immediately after the variable first appeared in P and made a device for speeding up part 1
{
(Preparation)
1. 1. Find the number of types V of variables in P and the names N1, N2, ... Of the variables that appear in the order of appearance.

(Correspondence when P originally does not contain variables)
2. When V is 0,
⇒ When P = S, return true and finish.
⇒ When P ≠ S, return false and finish.

(output)
3. 3. When V is 1, no matter how many times N1 appears in P, there is only one solution R1 for unification of P and S.
⇒ If there is a match, the only solution is output as "C and N1 = R1", TRUE is returned, and the process ends.
⇒ If there is no match, return false and finish.

4. (Ingenuity for speeding up # 2. This process is covered in 5 or later and may be omitted. ★ This ingenuity 2 is not claimed in Patent Document 1 ★)
When V is 2 or more
The solution tried to match all variables (N1 (= N), N2, ...) In the longest match mode and all variables (N1 (= N), N2, ...) Match in the shortest match mode. When the solution is the same (N1 = R1, N2 = R2, ...) ⇒ The only solution is output as "C and N1 = R1 and N2 = R2 and ..." and ends. If you didn't
⇒ Return false and finish.
When they are not the same ⇒ Continue to 5

5. When V is 2 or more, the longest matching solution R1 for the variable N1 executes the recursive call F (P', S, C and N1 = R1) for P'that can fill all N1 in P ⇒ longest for N1 The solution set as a matching solution is output

6. When variable N1 (self) follows immediately after variable N1 in P ⇒ When another variable N2 continues to process after 7 ⇒ Process after 7 (However, 1 character C in 7 is the solution R2 of N2 The first character of)
When fixed characters continue ⇒ Process after 7

7. One character C, which is a fixed character immediately after the variable N1 first appears in P (when immediately after another variable N2, the first character C of R2) is
When it is included in the longest matching solution R1 ⇒ 1) R1'← A character string in which the substring from the end of the character string of R1 to its C is deleted ⇒ 2) All N in P with P''← R1' ⇒ 3) Execute recursive call F (P'', S, C and N1 = R1')
⇒ It should be possible to output if there is a solution that is one step shorter for N1. If it is not included in the longest matching solution R1 ⇒ For N1, the list of shorter solutions is complete, so the process ends.

8. Return to 7 as R1 ← R1'.
}
================================================== ================================================== =================
The above is an excerpt from Patent Document 1 (Japanese Patent Application No. 2014-087008).

The following is a summary excerpt from Patent Document 6 (Japanese Patent Application No. 2016-196069).
================================================== =========
Patent Document 6 is claimed as claim 1.
A computer program that has a text-to-speech function
Text (a set of character strings, which may or may not ask the order between character strings) that can be accessed from the computer program.
From a logical expression containing a question sentence that accepts a character string containing a variable as a literal and answers a character string that fills the variable so that the literal is true.
Provided is a computer program, characterized in that a character string that is an answer to the question sentence according to the logical formula is extracted or synthesized and read aloud.
: Here, "accessible text" is, for example, a set of facts written in natural language, and a rule (inference rule) that is a PROLOG horn clause using a format in which variables can be embedded in natural language as literals. It is a set of, and may or may not include a rule (rule of inference).
: "A logical expression containing a question sentence whose answer is a character string that fills a variable" may or may not include facts and rules (rules of inference) other than such question sentences. It may be an equivalent of a regular expression or a subset thereof, and may be an extension of them.
: A "rule (inference rule)" may be a production rule, a term rewriting rule, a PROLOG horn clause, etc., and is an extension of these to allow literals with variables embedded in a character string. You can.
> This is a text format that integrates logical representation and superficial natural language representation for speech synthesis (for reading function), rather than just natural language text or logical expressions. Knowledge representation can now be centrally managed, and knowledge addition, editing, deletion, etc. can be performed in general logical (declarative) / procedural programming languages (PROLOG, AWK, SQL, Perl, PHP). , C ++, JAVA (registered trademark), etc.) can be easily implemented even by elementary school students.
> Also, since a logical expression including a question sentence that uses a character string that fills a variable as the answer is used, only the character string that is the point of each answer is used, not the entire sentence or sentence that includes each answer (the common part is). It is possible to dynamically extract and synthesize (that is, according to the difference in the question sentence) (that is, not to be boring / redundant) and read aloud (only the difference part of many character strings).

(0006)
Patent Document 6 is claimed as claim 2.
The computer program according to claim 1, wherein the accessible text includes an inference rule.
: Here, the "rule of inference" allows, for example, the literal of the horn clause of PROLOG to include variables in the string, "Neighborhood is $ X: -req" http://hoge.net/JP /ISHIKAWA/KOMATSU/BIRUGAWA.jpl "; $ X;" etc. This meaning can be obtained by acquiring the BIRUGAWA.jpl file from a predetermined URL on the Internet (in this example, a site that manages folders hierarchically in the area) and connecting each line to "Neighborhood". Make the whole string true. "
> This allows you to access only the files you are interested in from the remotely updated local news on the Internet and extract only the parts you are interested in (such as "$ Y and $ Z got married") (in the case). Depending on the case, you can define a module such as reading aloud (with a new composition of texts such as "$ Y and $ Z are newlyweds") and use it dynamically as it is, or statically. It makes it easy to modify only the function of the department and reuse it, or to divert it to analysis / extraction applications in related fields.
(0007)
Patent Document 6 claims as claim 3.
The computer program according to claim 1 or 2, wherein the formula contains facts.
: Here, as a simple example of "a logical formula including facts", "" the weather is fine today "and" Taro can be absorbed in his hobby $ X "".
: In this case, "the weather is fine today" is a fact,
Text containing inference rules (eg,
"Taro can be absorbed in his hobby of fishing: -the weather is fine today;"
"Taro can be absorbed in reading as a hobby: -the weather is bad today;"
"Taro can be absorbed in his favorite work"
),
After adding this fact ("the weather is fine today"), we will seek a solution (in this case, "fishing") that can fill the "$ X" of "Taro can be absorbed in his hobby $ X".
> By doing this, you can dynamically (temporarily at the time of questioning) separate rules that can be established and rules that cannot be established, provide hints for answering question sentences in logical expressions, and expand the range of problems and solutions. It becomes possible to limit.
(0008)
Patent Document 6 is claimed as claim 4.
The computer program according to any one of claims 1 to 3, wherein the formula includes an inference rule.
: Here, the "logical formula including the inference rule" is, for example, "" Komatsu-shi small 1 arithmetic is $ X: -req "http://hoge.net/JP/ISHIKAWA/KOMATSU/ELEMENTARY/1/ARITH.jpl It may be "; $ X;", "Komatsu City $ X?", Etc.
> This makes it possible to add rules (for interpretation, rewriting, etc.) that you want to apply dynamically (temporarily at the time of question) for each question. In addition, through the truth of the interpretation, as in the case of facts, we can separate the rules that can be established from the rules that cannot be established, provide hints to answer the question sentences in the logical formula, and expand the range of problems and solutions. It becomes possible to limit or limit.
(0009)
Patent Document 6 is claimed as claim 5.
The accessible text,
The computer program according to any one of claims 1 to 4, which has a user interface for the user to select from a limited number of options (text set).
: Such an interface is a drum roll as hardware, a jog dial, a list box as software control (may be N-column format), a combo box, a radio button, etc., or a computer graphic expressed by combining them. And so on.
: The text set is, for example, a set of paths to a local file, a set of paths to a company LAN shared folder, a set of URL / URI paths to an Internet file, a pointer to a text in memory, or a combination thereof. be able to.
> This makes it possible to limit the content for use in underage education, including elementary and junior high school students. In addition, the target texts can be divided for each subject so that even lower grades and the elderly can efficiently access, edit, and manage them.
(0010)
Patent Document 6 is claimed as claim 6.
For each accessible text, the text and the corresponding set of logical expressions are associated and stored, and stored.
The computer program according to any one of claims 1 to 5, which has a user interface in which a user selects a logical expression from a set of logical expressions corresponding to the text being accessed.
: There may be one element of the "set of logical expressions" for each accessible text.
: "The formula corresponding to the text" is the formula that was asked for the text in the past, the formula that is known to be useful for the text, and it is assumed that the text is asked in the first place. It is a well-designed formula, etc. (terms, etc.).
> As a result, even users who are not accustomed to computers and logical formulas (elementary school students, elderly people, etc.) can easily have a practical dialogue with one click without an assistant.
> It is preferable to manage one or more "logical expressions corresponding to texts" by embedding one or more in accessible texts in a predetermined format. In the example below, you can make an inquiry simply by selecting from the two buttons. In the example below, ": &" means to display the head as a select button.

===
My father is 78 years old My mother is 73 years old My sister is 45 years old My sister is 43 years old My man's family is $ X years old: & My man's family is $ X years old; // First selection button My man's family is $ X: -My dad is $ X;
My man's family is $ X: -My grandfather is $ X;
My man's family is $ X: -My brother is $ X;
My man's family is $ X: -My brother is $ X;
My man's family is $ X: -My son is $ X;
My woman's family is $ X years old: & My woman's family is $ X years old; // Second selection button My man's family is $ X years old:-My mother is $ X years old ;
My man's family is $ X: -My grandmother is $ X;
My man's family is $ X: -My sister is $ X;
My man's family is $ X: -My sister is $ X;
My man's family is $ X: -My daughter is $ X;
===
: In this case, the first half of the data can be programmed to be dynamically read from an external file (by a built-in function that has similar functions to #include in C language and require_once in PHP), in which case the external file The answer can be updated according to the update (by an external news distribution company, an internal knowledge editor, an IT person in the family, etc.).
: If the accessible text is a local file (not shared), it will be a file that only you can update. In the case of a shared file or an Internet public file, the file is updated by the person in charge with each access right.
: Buttons for selection include N-column list boxes, brick-style staggered layouts, single-character labels representing buttons arranged on a flat surface or pseudo 3D, and frequency of use. The contents and summaries of the logical formulas may be described in circles of different sizes according to the above.
: For users who cannot press the mouse on the button control or who want to use it more easily, the content of the logical expression corresponding to each button may be selected by voice recognition or eye recognition (this). Elemental technologies for such recognition are no longer detailed for self-evident). Further, as long as the interface is essentially capable of selecting one from N, various methods such as a drum roll type touch type and an electroencephalogram measurement selection type can be used, not limited to the button type.
: Also, when linking with the employee's face recognition sensor, the computer should remember the buttons that are often pressed for each employee, and the contents that the administrator wants to remember for each employee (rules, expertise, latest information, etc.) By storing a logical formula that expresses English words, communication information, etc. in a computer, when an employee approaches and is recognized, the employee is informed / studied by voice without pressing a button. Etc. can be output.
: In addition, for elderly people, it can also be used to prevent forgetfulness by familiar contents (list of friends, list of relatives, list of shopping destinations, list of telephone destinations, etc.) organized by field.
: Also, at the school, the morals and rules that you want the school to comply with (list of things you should not carry, list of clothing rules, etc.), list of teachers' names you want to remember, list of familiar knowledge of the area (history of the surrounding area, etc.) It can also be used for systematic enumeration of English words, old words, chronological tables, theorems, etc. that you want to remember for each grade.
(0011)
Patent Document 6 is claimed as claim 7.
When there are multiple character strings that answer the question text that is extracted or synthesized and read aloud
The computer program according to any one of claims 1 to 6, wherein the computer program is read aloud in a random order using a random number generation algorithm.
> This makes it easy to eliminate the order between knowledge that does not need to be memorized and to recognize each as independent knowledge.
(0012)
Patent Document 6 is claimed as claim 8.
When there are multiple character strings that can be the answers to the question sentences that are extracted or synthesized and read aloud.
If you interrupt and resume reading after reading one or more strings
The computer program according to any one of claims 1 to 7, wherein a character string that has not been read aloud by the interruption is preferentially read aloud.
> This makes it possible to convey all the answers evenly and without interruption, regardless of interruption.
(0013)
Patent Document 6 claims as claim 9.
When there are multiple character strings that answer the question text that is extracted or synthesized and read aloud
Set the ratio between the plurality of character strings or the text to extract the plurality of character strings.
The computer program according to any one of claims 1 to 8, wherein the plurality of existing character strings are repeatedly read aloud at a frequency ratio according to the set ratio.
> This makes it possible to use it when memorizing what should be focused on and what should not be memorized in a well-balanced manner.
(0014)
Patent Document 6 claims that claim 10.
The text to be updated,
Automatically load from a specified location at a specified time or frequency to make the accessible text
The character string that will be the answer to the question sentence according to the prescribed logical formula,
The computer program according to any one of claims 1 to 9, wherein the computer program is automatically extracted or synthesized from the accessible text and read aloud.
> As a result, when the HTML text on the Internet updated by the news site is set as the "updated text", it is possible to check only the news filtered by the logical formula at a predetermined time and frequency.
> In addition, by combining a plurality of contents, for example, an alarm clock study & news check function can be provided.
> Also, if the text to be updated is a core business document or database column specified as an interface inside or outside the company, it is easy to create a timely automatic business document by further linking with a template engine or the like. It becomes.
(0015)
Patent Document 6 claims as claim 11.
At a given time or frequency
The character string that will be the answer to the question sentence according to the prescribed logical formula,
The computer program according to any one of claims 1 to 9, wherein the computer program is automatically extracted or synthesized from a predetermined accessible text and read aloud.
: The time or frequency of automatic reading may be specified by various methods such as daily time setting, hourly minute setting, minute and second setting, date and time designation, and day of the week designation.
> This makes it possible to repeatedly and accurately memorize knowledge that tends to be inaccurate memories such as company rules.
(0016)
Patent Document 6 claims as claim 12.
The accessible text,
It is characterized by adding according to posts from an unspecified number of users.
The computer program according to any one of claims 1 to 11 is provided.
: Posts may be handled by detecting posts on a predetermined shared folder or Internet site, or by a so-called crawler collecting posts on an unspecified Internet site.
> This makes it possible to collect, exchange, share, and mutually brush up textbooks for study and information for business / hobbies.
(0017)
Patent Document 6 is claimed as claim 13.
The accessible text,
It is characterized by editing according to posts from an unspecified number of users.
The computer program according to any one of claims 1 to 12 is provided.
: Posts may be handled by detecting updated posts edited by a predetermined shared folder or Internet site, or by a crawler collecting updated posts edited by an unspecified Internet site.
> This makes it possible to complement and check each other's study texts and business / hobby information.
(0018)
Patent Document 6 claims as claim 14.
Make the above post by clarifying the category hierarchy of the theme
The computer program according to claim 12 or 13, wherein the accessible text used for extracting or synthesizing the answer character string is narrowed down by a user or a logical expression by designating the hierarchy.
: It is preferable to post while clarifying the following contents.

-Server-File name-Title-Version number-Text content-Hierarchical classification of themes (tree-shaped theme)
: Examples of categories are as follows.

・ Regional news tree (subdivision by region)
・ Research field tree (subdivision by research field)
・ Event tree (subdivision by event field (music, recycling, sports, etc.))
(0019)
Patent Document 6 claims that claim 15.
Output the image or sound according to the character string that is the answer at the same time as the character string or instead of the character string (when dividing the function in a system consisting of multiple remote computers or when dividing the function in the same computer, send it. The computer program according to any one of claims 1 to 14, wherein the computer program is provided.
: This "voice" can be pre-recorded voice, etc. instead of dynamic synthetic voice.
: The image may be a moving image.
> This makes it possible to express a set of themed answers and the contents of the text according to the logical formula more concretely and with a sense of reality.
(0020)
Patent Document 6 is claimed as claim 16.
Only the character string (one or more) that is the answer, or the text itself (one or more combinations) that can be accessed depending on the logical formula is a terminal (smartphone may be), or application software for the terminal. Send to the address,
The computer program according to any one of claims 1 to 15, wherein the computer program is output by the terminal or the application software.
: It is advantageous that the terminal is a mobile terminal, and the character strings and texts performed in this way are used for studying in trains and clearance time, or for sharing information and knowledge in the field of business. Can be used.
> This allows more freedom to provide answers and texts in a more suitable manner.
(0021)
Patent Document 6 is claimed as claim 17.
The computer program according to claim 16, wherein the extraction, synthesis, or transmission is performed via a relaying computer.
> This makes it easier to deliver to multiple users, makes it easier to control delivery, control the delivery order of content, insert advertisements in content, and enable inexpensive provision in the advertising model. ..
> In addition, it is no longer necessary for the calling terminal to have extraction, synthesis, and voice synthesis functions using complicated logical operations, making it easier to use the calling terminal as a mobile terminal such as a smartphone, and increasing the number of posts (outgoing). It is possible to reduce power consumption and memory usage, which are especially important for mobile terminals.
> Also, by using the same user's smartphone for both outgoing and output, while enjoying reading (in the past of yourself and others), you can also enjoy the spiral of posting to the computer that relays candidates for additions and changes. Is also easy.
(0022)
Patent Document 6 claims that claim 18.
The computer program according to claim 17, wherein the relaying computer is configured to deliver to terminals of a plurality of users.
: In this case, it is possible to set to deliver only to users other than the user who made the call by marking the delivery contents.
: It can also be configured to deliver only to users who have contracted to deliver, or only to users within the limit of the number of users to deliver.
: When delivering only to the number of users within the contracted limit, and when the relaying computer delivers in response to requests from multiple terminals, in addition to authentication by ID and password, the MAC address of the terminal and others The terminal application software can be programmed to convert the combination of terminal / user attributes into a hash value (which cannot be reproduced by the interceptor) and send it, and the hash sent from the terminal to the relay computer together with the delivery request. Depending on the type of value, the relay computer can calculate how many terminals are requesting distribution (even if a common ID / password is used among users), and the number of distributions can be calculated. It can be suppressed.
> This makes it possible to deliver answers and texts to multiple users who are likely to need them in a timely manner.
(0023)
Patent Document 6 claims as claim 19.
The relaying computer
As if tracing from the content newly transmitted to the relaying computer to the content previously distributed,
For the terminal or user who requested the delivery
The computer program according to claim 17 or 18, wherein the content is transmitted.
: Here, the content means a group of contents. For example, when there are multiple solutions according to a logical expression, these multiple solutions can be combined into one content, and one news article is composed. Multiple sentences (originally the order of which is also meaningful) are combined into one content.
> This allows for faster access to new (often more important to the user) content.
(0024)
Patent Document 6 is claimed as claim 20.
When new content is sent from a related user to a computer that relays the same user ID or group channel to which the user group belongs, reset the retroactive control and go back again with the new content as the beginning. The computer program according to claim 19.
> This makes it possible to share information by reacting more sensitively to new news and the like.
(0025)
Patent Document 6 claims as claim 21.
The computer program according to any one of claims 1 to 20, wherein a logical expression including a question sentence is also output.
> This makes it possible to concisely display the meaning and position of each order in the reading order.
> In addition, it becomes easy to generate quiz-format content on a relay computer or the like and to execute quiz-format content on each terminal.
> The combination of the character string and the logical expression that is the answer is sharp and sharp, with "what is the theme" and its "answer (solution)" as the common part and the difference part (multiple in the case of multiple solutions). It is possible to convey to the final user with a small amount of communication / display / speech. If related mail delivery / contact is also carried out at the same opportunity, it will lead to saving of packet amount.
(0026)
Patent Document 6 claims as claim 22.
The computer program according to any one of claims 1 to 21, wherein the text used for deriving the output answer or a part thereof is also output.
> This makes it possible to remember and confirm not only the answer but also the rationale.
> It also leads to the development of logical thinking ability.
(0027)
Patent Document 6 is claimed as claim 23.
When there is only one type of variable (or variable area) that specifies the answer to be output (for example, when only the subject is used, such as "$ X likes Hanako" instead of "$ X likes $ Y") ,
The computer program according to any one of claims 1 to 22, wherein the item name is omitted and output is performed.
> This makes it possible to omit the cost (time, communication, electricity, memory, etc.) of transmitting variable names that do not need to be distinguished and are not essential.
(0028)
Patent Document 6 claims 24.
When the variable (or variable area) that specifies the answer to be output is other than one character of the English alphabet (for example, "$ {subject} likes $ {object}")
The computer program according to any one of claims 1 to 23, wherein the item name is output without omitting it.
> This reduces the possibility of mispositioning the answer field, which consists of multiple fields.
(0029)
Patent Document 6 claims 25.
The answer string or the accessible text itself,
From the logical formula including the question sentence,
The transmitting computer, the relaying computer, or the computer delivered from the relaying computer
Generate quiz-style content and
The computer program according to claim 21, wherein the computer program is performed on any computer.
: Here, the simplest quiz generation method is to mechanically re-create the question sentence in natural language (machine-generate the natural language) and use the "answer string" as the answer to the quiz.
: When the text used to derive the output answer or a part thereof can be referred to, it can be added as reference information of the answer, and when it cannot be referred, the accessible text (one or combination) itself can be referred to. It can also be added as reference information.
> As a result, a text that accumulates familiar information (such as Mr. Yamada's house pochi gave birth to two puppies) and a logical formula that includes familiar question sentences ("$ X gave birth to $ Y", etc.) ), You can easily and automatically generate familiar quiz questions. For example, residents of a nursing home or students of a specific class who share the user ID of the computer to be relayed can use their "inner ring material" etc. Can be continuously enjoyed as quiz content (for example, {quiz question example 1: □ gave birth to two puppies, answer: Mr. Yamada's house pocket}, etc.). In this case, the relaying computer may be provided with a WEB server function, and the generated quiz content may be rendered to the terminals in the range sharing the user ID.
: The same applies when providing fill-in-the-blank content to application software that memorizes necessary knowledge or conveys information in the screen saver format.
(0030)
Patent Document 6 claims as claim 26.
The relaying computer
Before delivery
The computer program according to claim 21, which inserts a predetermined advertisement into the content.
: For text, you can insert links to ad images and ad audio as well as ad text, and for audio and video, you can insert and synthesize them.
> This makes it possible to monetize the advertising model and provide answers and texts to general consumers at a lower cost.
(0031)
Patent Document 6 claims as 27.
The formula contains a formula for forward reasoning.
The computer program according to any one of claims 1 to 26, wherein the item that exceeds the threshold value is read aloud and then returned to the threshold value or less.
: An expression for forward reasoning is, for example, a PROLOG assert statement. A similar assert statement can be defined and executed in a processing system that allows literals in which variables are embedded in a character string. As another example of the logical formula, we introduced the certainty such as "" Wind blows in $ A region "->" Profitable tub shop in $ A region ": 0.6", and the predetermined proposition "Hokuriku region" The initial certainty of 0.2 for another proposition "Hokuriku region tub shop is profitable" is 0.68 (= 0.2 + 0.6-0.2 x 0.6) when "Kaze ga fukeba" becomes true. You may update it with. In another example, even when the certainty on the condition side is not 1.0 (true) but a predetermined threshold value of 0.5, K ← K × 0.5 and a new certainty = 0.44 (= 0.2 + 0). .3-0.2 × 0.3) may be used. In addition, forward inference may be performed by setting a plurality of propositions and literals as conditions, and the conditions may be satisfied when the certainty of each condition is equal to or higher than each predetermined threshold value.
: When the truth of a proposition is triggered, it is possible to apply the formula of forward reasoning to the proposition that is originally true when the text is newly loaded and the proposition that can be proved to be true immediately afterwards. It is possible to reset the certainty and reapply it from the beginning when there is a change (addition, deletion, etc.) in the true proposition.
: When certainty is not required (only assert statement and vice versa), the same memory configuration as in the conventional PROLOG operation can be used, but when establishing confidence, a dedicated memory area such as closed hash is provided. Is preferable. The content and certainty added by assert may be configured to be reset for each inquiry by the argument or for each session by the user.
: Further, it is preferable that the button (s) are defined so that a specific proposition can be set as true or false, with or without forward reasoning.
> This allows employees and students to strengthen and learn their judgment about the chain of influence (by a simple forward reasoning formula or a forward reasoning formula containing multiple conditions).
> In addition, it becomes easy to automatically generate news and hypotheses of its influence, and to make automatic judgment / analysis.
(0032)
Patent Document 6 claims 28.
Provided is an apparatus including the computer program according to any one of claims 1 to 27.
(0033)
Patent Document 6 claims as claim 29.
The method using the computer program according to any one of claims 1 to 27 is provided.
================================================
The above is an outline excerpt of Patent Document 6 (Japanese Patent Application No. 2016-196069).

The respective technical contents shown in the patent documents and the contents of the elemental technologies cited can also be used in the present application. However, those which are not the main points of the present invention will not be described in detail in the present specification.

An embodiment of the present invention will be described with reference to the drawings.
FIG. 1 is an explanatory diagram showing an example of a hierarchical reference chain (stepwise operation of a menu hierarchy) of a plurality of information modules according to the method of the present invention.
The computer recognizes the user's voice as a predetermined recognition pattern based on a computer program (not shown in detail for realizing the transition control) for carrying out the method according to the present invention. In response to the,
Transition the user variable (for example, when the recognition pattern "work" is recognized in the information module 1 of this example, the variable "& $ {current URI}" (not shown) is set to "002.jpl" and then the information module. (Transition the information module to be preferentially referred to 2 etc.) and
Output to the user (for example, display the text "You have moved to the work page" and synthesize the same content by voice).
After performing this transition, the computer gives priority to the recognition pattern information included in the information module 2 over the recognition pattern information included in the information module 1 to perform voice recognition. For example, in this example, when the user pronounces "manufacturing work plan", the computer determines that it corresponds to "manufacturing plan" in information module 2 instead of "work" in information module 1. The command "s" that acquires the manufacturing plan from the shared folder and displays it is being executed. In this example, the "work" recognition pattern is programmed not to be in the command list.
In this example, the reserved word "return to the previous page" (not shown) is incorporated in the rich client (execution program) that interprets and executes the information module instead of the information module, and transitions according to the user's wishes. The stack data structure (not shown) that accumulates the chain of transitions is managed so that any information module after the transition returns to the original information module before the transition and goes back further.
In this example, although not shown, when any information module is referenced, all the recognition patterns are displayed on the screen to show the user what kind of recognition pattern is assumed, and the user can use the recognition pattern. It encourages one to be pronounced as a manifestation of intention.
In another embodiment, the menu hierarchy is an actual area, a hobby field, etc., and users having similar transition routes on the hierarchy can have a group conversation using a known group conversation technique. , I try to enjoy conversations with others in similar situations. To switch the mode between conversation with another person and voice recognition based on the recognition pattern, the reserved words "to conversation mode with another person" and "to voice recognition pattern" are used as the home information module for each user (in FIG. 1). This is done by registering each of the two variables (with && at the beginning, && $ {group conversation} and && $ {speech recognition}) in the information module 1).
In another embodiment, the information module is configured to have the coordinate values related to the actual latitude, longitude, etc. and the coordinate values of the virtual world instead of the hierarchy, and the user who has transitioned to the information module having similar coordinates. It is configured so that they can talk to each other in the same way.
In another embodiment, the recognition patterns in all the information modules in the transition path from the home information module are put in the command list to enable voice recognition.
In another embodiment, it is configured to recognize only the recognition pattern currently displayed on the screen, not all, and the recognition pattern set can be totally replaced by the scroll operation.
In another embodiment, the recognition pattern as a candidate recognition pattern to be recognized at the same time as the recognition pattern set that remains without disappearing due to the partial scroll operation (that is, even if it is included in the command list for simultaneous recognition) is recognized because the editing distance is large. It is programmed to scroll in only recognition patterns that are less likely to cause quality.

Although the industrial applicability of the intelligent system and the voice recognition system to which the present invention is applied is clear, the knowledge itself is classified, organized and managed, and the managed knowledge is automatically applied to new facts (automatic). Inference), extensive search / search of the idea itself, combination / detailing / materialization of the idea, automatic sharing / dissemination / update / refinement of knowledge and research results in human beings, communities, companies and groups. Can be done.

1 Information module 1 (Example of home information module (page file))
2 Information module 2 (Example of work information module (page file))
3 Information module 3 (Example of study information module (page file))
4 Information module 4 (Example of study / IP information module (page file))

Claims (24)

The way computers interact with users,
Transition of user variables, output to the user (text, voice, etc.) in response to the computer recognizing the voice or environmental sound of the user (not limited to humans; the same applies hereinafter) as a predetermined recognition pattern. For multiple information modules containing information (including information on one or more recognition patterns) for a computer to perform (images, etc.) or both.
The first information module contains information (URI, in-memory pointers, structure array indexes, etc.) that allows the computer to reference the second information module.
When the computer references the second information module based on the information to be referenced in the first information module
A method in which a computer gives priority to the recognition pattern information contained in the second information module over the recognition pattern information contained in the first information module to perform voice recognition. The computer moves between the information modules (for example, the static file or the dynamically generated file pointed to by the URI) according to the information to be referred to, and the information other than the recognition pattern information is also the information of the second information module. The method according to claim 1, which is prioritized. Information other than the recognition pattern information is also second until the computer calls a subroutine between information modules (for example, a static file or a dynamically generated file pointed to by URI) and returns by the information to be referred to. The method according to claim 1, wherein the information in the information module is prioritized. The computer
The method according to claim 3, wherein voice recognition is performed using only the information of the recognition pattern included in the information module on the chain of call relations at that time of the subroutine call. The computer
The method according to claim 4, wherein voice recognition is performed using only the information of the recognition pattern included in the information module at the tip of the chain of call relations at that time of the subroutine call. The method according to claim 4 or 5, wherein a fixed recognition pattern for returning the calling relationship at that time of the subroutine call is provided regardless of the information module. The method according to claim 4 or 5, wherein a fixed recognition pattern for clearing and returning all the calling relationships at that time of the subroutine call is provided regardless of the information module. When the recognized pattern does not exist for a given time, the computer
The call relationship at that time of the subroutine call is automatically returned .
The method according to claim 4 or 5. The computer
When there are many recognition patterns that need to be voice-recognized
After displaying only a part of it on the screen
The method according to any one of claims 1 to 8, wherein the screen is scrolled or the screen is switched according to a predetermined recognition pattern. The computer
The method according to claim 9, wherein only the recognition pattern that can be displayed is the target of voice recognition. The computer
When displaying only a part of the above on the screen
The method according to claim 9 or 10, wherein screen scrolling or screen switching is performed across a plurality of groups formed by grouping things that are difficult to be confused by voice recognition. The computer
The range of recognition patterns for voice recognition,
The method according to any one of claims 1 to 11, which can be changed for each situation specified by the user by voice immediately before. The computer
The range of recognition patterns for voice recognition,
The description in any one of claims 1 to 12, which is changed for each sentence type or case or case value (deep case, surface case, etc.) that the user automatically guesses by voice designation or voice immediately before. Method. Multiple of the above information modules,
Store in relation to the actual latitude, longitude or altitude, or virtual coordinates associated with the information module.
The method according to any one of claims 1 to 13, which enables voice recognition of only the information of the recognition pattern included in the information module located within the coordinate range specified by the user. Multiple of the above information modules,
It is stored in relation to the hierarchical theme tags (regional hierarchy, study field hierarchy, functional field hierarchy, etc.) related to the contents of the information module.
The method according to any one of claims 1 to 14, which enables voice recognition of only the information of the recognition pattern included in the information module located under the theme tag specified by the user. The method according to any one of claims 1 to 15, wherein when the same recognition pattern is associated with a plurality of outputs performed by a computer, only one output is executed using a random number. Give a given information module a variable with a fixed value,
When the user loads the information module, the variable and the fixed value are stored and stored.
Any one of claims 1 to 16 configured so that the variable and the fixed value can be referred to by the other information module but cannot be changed or deleted even when the other information module is preferentially referred to. The method described in the section. Give a given information module a variable that specifies that it is static or global,
When the user loads the information module into the computer, the computer declares and defines the variable globally,
Even if the computer preferentially references other information modules
Computer referring to the number of the displacement from the other information module, the method according <br/> to any one of claims 1 to 17 to be able to modify or delete. Shown by the voice or screen display computer to that effect which varies the set of speech recognizing patterns,
The method according to any one of claims 1 to 18. In order to make voice recognition related to the method, the computer accumulates the content received by the user and the result recognized by the recognition pattern.
Claim 1 characterized by analyzing or evaluating the user's behavior, tendency or achievement (excluding the degree of improvement in pronunciation, including the degree of digestion and the range of digestion of the study curriculum and work quotas, etc.). The method according to any one of 19 to 19. Computers allow a set of users who are simultaneously accessing the same information module or a set of information modules with close coordinates to perform group communication by text, audio, or audio / video.
The method according to any one of claims 1 to 20. One of claims 1 to 21 in which a reserved word is prepared for the computer to focus on content other than audio (image display, current global variable state, status text indicated by the currently referenced information module). The method described in. A computer program for carrying out the method according to any one of claims 1 to 22. An apparatus for carrying out the method according to any one of claims 1 to 22.

Images