JP2018072784A - Voice recognition method, computer program, and device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide large-scale content that satisfies users while mainly providing a voice interface that can be easily handled by the elderly.SOLUTION: In a plurality of information modules containing information (also containing information on one or more recognition patterns) for a computer to perform one or both of transition of a user variable and output (text, voice, image, etc.) to a user in accordance with that the computer voice-recognizes user's voice as having a predetermined recognition pattern, a first information module contains information (URI, in-memory pointer, index of structure array, etc.) for the computer to refer to a second information module. When the computer refers to the second information module on the basis of the information to refer of the first information module, the computer performs voice recognition giving priority to the information on the recognition pattern contained in the second information module over the information on the recognition pattern contained in the first information module.SELECTED DRAWING: Figure 1

Description

  The present invention relates to a speech recognition method, a computer program, and an apparatus.

A logical program that allows a character string including a variable as a literal and its processing system have been researched and developed by the inventor (Patent Documents 1 to 8). This means that expressions close to natural language compared to conventional PROLOG can be used as knowledge sources (rules and facts) and question sentences (literals containing variables) as they are. It has become easier.
The most effective use when used by the elderly is a dialogue mainly using voice with an information module (logical program / thinking program) that expresses the personality of an actual spouse or travel guide as knowledge.
However, with regard to the current level of speech recognition technology, especially for short-speech recognition patterns, the more types of such recognition patterns that must be recognized, the lower the recognition quality. It has become difficult to develop large-scale content with a lot of content. 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 No. 2015-219007 Japanese Patent Application No. 2006-009327 Japanese Patent Application No. 2016-103010 Japanese Patent Application No. 2015-234356 Japanese Patent Application No. 2006-196069 Japanese Patent Application No. 2016-200618 Japanese Patent Application No. 2006-210096

  Therefore, the problem to be solved by the present invention is to be able to provide a large-scale content satisfying the user while mainly providing an audio interface that can be handled easily even by elderly people. It is to be able to cope with the types of recognition patterns without reducing the recognition quality.

In order to solve this problem, claim 1 of the present invention provides:
A way for a computer to interact with a user,
When the computer recognizes the voice or environmental sound of the user (not limited to humans, the same applies hereinafter) as a predetermined recognition pattern, the user variable transitions and the output to the user (text, voice, Multiple information modules that contain information (including information on one or more recognition patterns) for the computer to do (such as images) or both,
The first information module contains information (URI, pointer in memory, structure array index, etc.) for making the computer refer to the second information module,
When the computer refers to the second information module based on the information to be referred to in the first information module,
Provided is a method in which a computer performs speech recognition by giving priority to information on a recognition pattern included in a second information module over information on a recognition pattern included in a first information module.
: Here, “prioritize” not only lowers the matching threshold with the recognition pattern included in the second information module compared to the recognition pattern included in the first module, but also the first It also includes completely invalidating the information of the recognition pattern included in the information module (for example, deleting it from the so-called “command list” (a set of character strings for speech recognition) or temporarily masking it).
> By doing this, there are a great many types of commands (character strings) that should be recognized as speech by the system (for example, when a set of information modules exchanged over the Internet is uploaded by an unspecified number of users, Even if it continues to grow, it is possible to register only the character strings (commands) that need to be recognized for each context or situation of the dialogue with the user, etc. As the number increases, the difference between commands becomes smaller.) It is easy to maintain the quality of voice recognition that tends to be erroneously recognized.

Claim 2
The computer moves between information modules (for example, a static file or a dynamically generated file pointed to by the URI) according to the information to be referred to, and information other than the recognition pattern information also includes information of the second information module. A method as claimed in claim 1 is provided.
: Here, for example, a rule for moving an information module that can be specified by <URI> as an Internet page is “<recognition pattern> / <recognition pattern display condition>: # <variable (global / local) variation>;< It is possible to provide a coding rule such that a human script describes a production script>; moveto "";"and the like, and the information module interpretation program interprets it depending on the coding rule.
As a result, content can be edited / executed by the same manner / protocol as the edit upload / download display of the Internet page, and the operation of the content is facilitated.

In addition, claim 3
Until the computer calls a subroutine between information modules (for example, a static file or a dynamically generated file pointed to by a URI) based on the information to be referred to, information other than the recognition pattern information is also the second information. The method according to claim 1, wherein priority is given to information in the information module.
: Here, for example, a rule for moving an information module that can be specified by <URI> as an Internet page is “<recognition pattern> / <recognition pattern display condition>: # <variable (global / local) variation>;< It is possible to provide a coding rule so that a human being describes the production script>; call "";", etc., and the information module interpretation program interprets it depending on the coding rule.
As a result, content can be edited / executed by the same manner / protocol as the edit upload / download display of the Internet page, and the operation of the content is facilitated.
: Subroutine call relations can be clearly managed by a known method such as a stack arrangement.
> This makes it possible to manage the caller, which is the final transition destination after the call, in a simple manner as a stack array, etc., and to manage hierarchical menu information and tree-structured story control information. Operation becomes easy.

In addition, claim 4
Computer
The method according to claim 3, wherein speech recognition is performed using only information of recognition patterns included in an information module on a chain of call relationships at the time of the subroutine call.
> This makes it easy to determine and control the range of enlargement and reduction of the recognition pattern when dealing with the new recognition pattern corresponding to the progress of more specific situations while also supporting the original recognition pattern. be able to.
> In particular, from the top of the hierarchy, it is easy to follow all pages while maintaining the recognition quality.

In addition, claim 5
Computer
5. The method according to claim 4, wherein speech recognition is performed using only information on a recognition pattern included in an information module at a tip of a call-related chain at that time of the subroutine call.
> In this way, the recognition pattern can be changed to a moved layer according to a hierarchically configured command menu, etc., or the state can be returned to an upper level from an arbitrary state (therefore, the recognition pattern set is also restored). It is also easy to make a state transition.

In addition, claim 6
The method according to claim 4 or 5, wherein a fixed recognition pattern for returning a calling relation at the time of the subroutine calling is provided regardless of an information module.
: Examples of “fixed recognition pattern” include “return to previous”, “return”, “to original page”, and the like.
As a result, it is possible to perform voice recognition with a sense of security that the user can return to the original place where the situation is more suitable, regardless of which information module the user transitions to.

In addition, claim 7
6. The method according to claim 4, wherein a fixed recognition pattern for clearing and returning all the calling relationships at the time of the subroutine call is provided regardless of the information module.
: As an example of “return after returning”, there may be a page designated as a predetermined “home” in an environment variable or registry of the application, a page accessed by designating a URI, or the like.
: Examples of “fixed recognition pattern” include “all cancel”, “return to home”, “to top”, “redo from the beginning”, and the like.
As a result, it is possible to perform voice recognition with a sense of security that the user can return to the original information regardless of which information module is transitioned to.

In addition, claim 8
When the recognized pattern does not exist for a predetermined time,
6. A method according to claim 4 or 5, wherein the method is programmed to automatically return the current call relationship of the subroutine call.
> This makes it possible for even an unfamiliar user to return to the original home menu, etc. if he / she is fooled for a while, try a different menu from the previous one (ie, speak), and If you take the time to get the instructions and questions you want to do, you are more likely to be able to reach them.

In addition, claim 9
Computer
If there are many recognition patterns that must be recognized,
After only a part of it is displayed on the screen,
The method according to claim 1, wherein screen scrolling or screen switching is performed according to a predetermined recognition pattern.
: Examples of “predetermined recognition pattern” are “right” (right scroll), “left” (left scroll), “up” (up scroll), “down” (down scroll), “top” (leftmost) Or scroll to the top), “bottom” (re-right or scroll to the bottom), and the like.
> This makes it easy to confirm all of the options by voice recognition alone.

In addition, claim 10
Computer
The method according to claim 9, wherein only recognition patterns that can be displayed are targeted for speech recognition.
As a result, it is possible to improve recognition quality by further narrowing down recognition patterns while covering options.

In addition, claim 11
Computer
When displaying only a part of 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 confuse in voice recognition.
: Grouping things that are difficult to confuse in speech recognition is calculated by, for example, calculating the edit distance between texts that express recognition patterns (or texts that express phoneme strings), and those that are close to each other are grouped together. In this way, it can be realized.
: In addition, when performing screen scrolling partially (that is, for only a part of the displayed recognition pattern), 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 whose edit distance is not close to the recognition pattern (for example, greater than or equal to a predetermined threshold) that has not yet been displayed (initial display or scrolled in) and has not been scrolled out. Can be programmed to scroll in.
> This improves the efficiency of scrolling and screen switching.

In addition, claim 12
Computer
The range of recognition patterns for voice recognition
The method according to any one of claims 1 to 11, wherein the method can be changed for each situation that the user has designated voice immediately before.
: The following shows an example of “situation designated voice immediately before” (when voice is designated as “situation equal OO”) and corresponding “recognition pattern range” (set).

===
Situation equal "contact"
・ Today's work was completed safely.
Situation “Weather Survey”
・ Kanazawa, Komatsu, Tokyo ===
Situation equals "current"
・ What is the time?
・ What is the dollar exchange rate?
===
As a result, it is possible to reduce the recognition pattern appropriate for the situation and improve the recognition quality. The squeezing may be enumerated in advance by humans, or may be squeezed by defining a type such as part of speech, or may be squeezed dynamically using PROLOG or the like.

In addition, claim 13
Computer
The range of recognition patterns for voice recognition
It changes for every sentence type or case value or case value (deep case, surface case, etc.) that the user has made an automatic guess by voice designation or voice immediately before. Provide a method.
: The following shows an example in which an information module is set as a “communication menu” under a “home menu” by a person in charge of programming who interviewed a company.

===
(A certain company president's "Communication menu" recognition pattern set under "Home menu")
・ Type is a spontaneous report ・ Type is a report request ・ Type is a meeting ・ Type is a presentation application ・ Type is a negotiation application by telephone ・ Type is a negotiation application by telephone ・ Type is a negotiation application by postcard ===
Subject (automatically prompted by the computer. A set that is displayed and becomes a recognition pattern depending on the type being a business negotiation application by telephone. The person in charge sets the computer in advance. 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 (the computer automatically prompts. “Type is a business negotiation by phone” and “(subject is) the sales manager”)
・ ○○ Industrial ・ □□ Shokai ・ △△ Iron Works ---
Products (automatically prompted by the computer. “Type is a business negotiation by phone”, “(Subject is) Sales Manager” and “(Partner) is XX Industrial”)
・ Raw material A
・ Product B
・ Maintenance C
===

In addition, claim 14
A plurality of the information modules;
Store in relation to the actual latitude, longitude or altitude associated with the information module, or virtual coordinates;
The method according to any one of claims 1 to 13, wherein only the information of the recognition pattern included in the information module located within the coordinate range specified by the user can be recognized by voice.
: “In relation to the information module” means, for example, in the case of an information module for the information module to interact with an AI that resembles the resident personality, it is the latitude, longitude, altitude, etc. of the address of the resident, and the information module is moved 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 the current position.
As a result, a function equivalent to “call out loudly 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 sensation of a trip to explore a region or virtual space while continuously moving latitude, longitude, altitude, virtual coordinates, etc. It is advantageous, and elderly people who are unable to move can be born, and the desire to explore the neighborhood of their homes can be fulfilled, and the QOL of a wide range of people is dramatically improved.
> In addition, when constructing as multimedia content (not only audio but also images may be displayed) linked with walking contents and adventure games, a specific direction on latitude and longitude may be moved forward and backward, The UI can be configured so that the direction can be changed (30 degree unit, 45 degree unit, 90 degree unit, etc.), which can be useful for taking a walk or having a bulge in the game itself.

In addition, claim 15
A plurality of the information modules;
Store in relation to 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, wherein only a recognition pattern information included in an information module located under a theme tag designated by a user can be recognized by speech.
: An example of a hierarchical theme tag is shown below. In this example, when the user designates Matsumura, the information module (or “Japan>Ishikawa>Kanazawa>Matsumura> 1chome” theme tag arranged in the directory “Japan>Ishikawa>Kanazawa>Matsumura> 1chome”). As well as an information module located in the directory “Japan>Ishikawa>Kanazawa>Matsumura> 2-chome” (or an information module containing the theme tag “Japan>Ishikawa>Kanazawa>Matsumura> 2-chome”) This recognition pattern information is also recognized at the same time.

===
Japan Tokyo Ishikawa Kanazawa Matsumura 1-chome 2-chome ...
Komatsu Hakusan ...
===
Studying Japanese Grammar Vocabulary ...
Arithmetic Arithmetic operation Turtle calculation ===
Function Safety QOL Improvement Safety Hygiene Self-fulfillment ・ ・ ・
===
> This makes it easy to specify a range of various granularities.

In addition, claim 16
The method according to any one of claims 1 to 15, wherein only one output is performed using a random number when the same recognition pattern is associated with a plurality of outputs performed by a computer.
> This will bring out the meaning and depth of the content to speak the same thing over and over, and encourage revisiting.

In addition, claim 17
Give a given information module a variable with a fixed value,
Storing the variable and the fixed value when the user reads the information module;
The variable and the fixed value can be referred to from the other information module but cannot be changed or deleted even when the other information module is referenced preferentially. A method according to paragraph is provided.
: For example, in a processing system using a rich client, the variables, facts, and rules that begin with “&&” in the information module that is the home for each user are unique to the user, so the current of the rich client The URI (currently prioritized information module) is the home information module (set as a predetermined local file in the PC) to any other information module (other local files or netpages indicated by the URI). Etc.) and can be configured so that it is not added, deleted or updated, but is only referenced from other information modules. This can be realized, for example, by providing a mechanism similar to a global memory area or environment variable that can be referred to only by the rich client inside and outside the rich client. When a rich client can load an information module as a program list, variables that begin with && and facts and rules used in PROLOG (but only those that begin with &&) always remain at the beginning of the program. It may be.
This makes it possible to recognize and process a specific recognition pattern preferred by the user regardless of the information module to be moved.

In addition, claim 18
Give a given information module a variable that specifies static or global,
Declare and define the variable globally when the user loads the information module,
The method according to any one of claims 1 to 17, wherein the variable 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 referenced preferentially.
: For example, in a processing system using a certain rich client, variables, facts and rules beginning with “&” in the information module are static or global, and the current URI of the rich client (currently has the highest priority) The information module is maintained even if it is moved to any other information module (other local file or netpage indicated by URI), and a variable having a static value (for example, & $ {possession}) = 100000000 yen ) Can also be explicitly referenced, updated, or deleted in the new information module.
> This makes it possible to maintain values and attributes that should be maintained even if the information module is moved, and to realize communication between adventure games and information modules with high consistency of context (the reference range is uniform). Eliminating the harmful effects of restricting to
: In the above example, when moving to a page with a closer latitude / longitude by changing direction and moving forward, the variable starting with & will be accumulated. For the recognition pattern “move to Tokyo by Shinkansen” as well as movement with close latitude / longitude, for example, “{& $ {money}} = & $ { In-information module processing script such as “carrying money} −21000}; VLOAD http://humanote.xyz/jploc_kkh/0234/8562/56/Tokyo station.jpl;” can be used.

In addition, claim 19
The method according to any one of claims 1 to 18, wherein the computer is programmed so that each time the set of recognition patterns for voice recognition is changed, the fact is indicated by voice or screen display.
: Here, as an example of “indicating that”, you may indicate a big break as “entered the zoo information module (page) (in the virtual walk game)”, and “the wizard is no longer nearby. ”(In virtual adventure game)” or “You can now ask questions in English (in the local walk content)”, etc., and the difference between the options may be shown. On the other hand, the computer may read out the information, and the processing associated with the recognition pattern said by the user as “Please request it” may be performed during or immediately after the reading.
As a result, in the case of voice, it is possible to communicate only by voice, and it is possible to more effectively transmit complex contents even during driving.
: The voice output here is obviously not only the voice synthesis (reading sound) from the text dynamically generated by automatic reasoning, 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). Thereby, it becomes possible to provide a virtual adventure game and a local walk content with higher realism to scenes and user groups that want to communicate only by voice.

In addition, claim 20
The computer accumulates the content that the user uttered and the result recognized by the recognition pattern in order to make speech recognition related to the method,
2. Analyzing or evaluating user's behavior, tendency or performance (excluding the degree of pronunciation improvement. Except for excluding those, including digestion degree and digestion range of study curriculum and work quota etc.) To 19. A method according to any one of 1 to 19 is provided.
: Note that the date and time (in the clock managed by the client or server) and location (URI of the information module, GPS location of the user terminal, etc.) are also stored in association with the user's speech behavior. It is advantageous for analysis and evaluation.

In addition, claim 21
21. The program according to any one of claims 1 to 20, wherein a set of users simultaneously accessing the same information module or a set of adjacent information modules of coordinates is programmed so as to perform group communication by text, audio or audio-video. Provide a way.
> As a result, the satisfaction from users who rely on audio, especially as virtual adventure content and walk-through content, is improved through opportunities to communicate with other users, the value of the content by supplementing their own information, etc. improves.
Note that the identification of the user used here is advantageously an ID different from a normal ID.
: Even if this group communication does not start explicitly, it will be displayed naturally as a rich client's rich client or will flow as audio unless it is suppressed (unless you check the suppression option, etc.), as in the real world. Is advantageous.
: However, since it must be distinguished from your own speech for voice recognition, the voice recognition of the reserved words “start chat” and “command start” allows the computer to recognize the voice and the mode for chatting with people around you. You may make it switch and use a mode.
: Note that information modules with close coordinates can include those with close branches in the theme (region, study, function) hierarchy.

In addition, claim 22
The reserved word for each focusing on contents (image display, the state of the current global variable, the status text which the information module currently referred to which is referring now) other than an audio | voice is prepared respectively. Provide a way.
> 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. Claim 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 chain | linkage (step operation of a menu hierarchy) of the reference of several information module by the method of this invention.

In some embodiments described below, the above-described functions specific to the present invention are additionally implemented in the embodiments of the following patent specifications (excerpts from Patent Documents 1 and 6 above) by the same inventor. Can be implemented. In addition, the following citations of Patent Documents 1 and 6 include supplementary purposes for the feasibility and inventive aspects of the present inventors.

===
<Problem of Patent Document 1> It is possible to automatically process knowledge expressed in the form of embedding variables in a natural language in the same manner as PROLOG, and comprehensive deduction and solution search (automatic unification processing) at the predicate logic level , Automatic derivation process, backward reasoning, backtracking).
Make full use of the advantage that variables are not bound by case structure, speed up processing, and display results for proof and learning.
<Solution means (outline) of Patent Document 1>
When inputting “facts”, “rules”, or “goals” in PROLOG, humans input the constant part and variable part of the content corresponding to “literal” in PROLOG by distinguishing them by character type, delimiter or escape character, and input them to the computer.
The computer performs automatic unification processing, automatic derivation processing, or both of the sentence included in the input while handling the variable as being able to cross the boundary between the main part and the predicate of the sentence.
Unification of a pattern that can contain a variable and a constant character string that is a sentence that does not contain a variable, finds the longest matching solution of the variable that first appears in the pattern, and sets the character string of the longest matching solution For each new pattern created by substituting the process of cutting from the back to the empty character into the pattern, recursively in a similar manner while storing each state of the solution of the cutting process that was the premise that the new pattern was created Iterate until there are no more variables, and when there are no more variables, combine the intermediate solution states that are unified to obtain the answer for each unification.
The speed is increased by detecting whether or not the fixed character string in the pattern is included in the character string in the process of cutting the longest matching solution.
Pattern-to-pattern unification is accelerated by focusing on the coincidence of the beginning and end of the word. A specific method for full search is also provided.
<Solutions for Patent Document 1 (full text, but some corrections / corrections not to be confused with the present invention)>
(0009)
This invention is made | formed in view of this subject, Claim 1 of patent document 1 is
A method in which a computer automatically performs part or all of the functions of a logic programming language PROLOG,
When a human inputs "facts", "rules", or "goals" in PROLOG, the constant part and the variable part of the content (hereinafter referred to as "sentence") in PROLOG are referred to as the character type, delimiter or escape character. According to the input to the computer,
While the computer treats the variable as a sentence main part, predicate, subject, predicate, object, complement, conjunctive modifier, conjunctive modifier, or something that can cross sentence boundaries, the above "facts", "rules" or Performing automatic unification processing, automatic derivation processing, or both of sentences included in the input of “goal”;
A processing method is provided.
Here, “a human being inputs a constant part and a variable part into a computer by distinguishing them by a character type, a delimiter or an escape character” means that a human is in an input field of application software (processing system) according to the present invention. Input directly after command prompt (via or without front-end processor), copy paste or cut paste from internet browser or text editing software, etc. Including reading, quoting, referencing, etc.
In addition, “the computer treats variables as if they can cross the sentence main part, predicate, subject, predicate, object, complement, continuous modifier, joint modifier, or sentence boundary” It can only cross the boundaries (explicit delimiters) of case structures with explicit delimiters via prepositions such as particles and English (including those that fall under the hierarchical structure of syntax analysis results and semantic analysis results) Instead, it can cross the boundary between S and V in English, for example, SV format, SVO format, SVOO format, and SVOC format, V and O boundaries, V and C boundaries, etc. Includes a mode that is handled as possible (in contrast, there may be a mode that is not handled). In these cases, as candidate solutions that can be included in a variable, an arbitrary partial character string is extracted by ignoring the delimiter unit by the grammatical structure as a sentence from the whole sentence or the character string that constitutes the whole sentence, and the hierarchy The entire compound sentence / heavy sentence with a typical reference structure, a longer paper, etc., and any substrings of those are also targeted (note that it is treated as something that can straddle a sentence boundary, When handling a set of knowledge sources (for example, reading, writing, referencing, etc., a set of knowledge sources collectively in a file), it is necessary to separate the knowledge sources at a boundary other than the sentence boundary Therefore, for example, a line feed code or a tab code can be used as such a delimiter).
As a result, knowledge and information expressed in the form of embedding variables in natural language as well as knowledge and information in ordinary sentence format are fully integrated with the possibility of practical interoperability between them. As a source, it is possible to perform automatic processing by a computer without particularly distinguishing between the two (overcoming of the above “difficulty A”).
In order to open the possibility of “realistic” interaction “sufficiently”, automatic processing by a computer should be provided as a search processing system 1) simplicity of a search expression (expression specifying a pattern), 2) sufficient The accuracy (accuracy of the solution) and 3) sufficient reproducibility (exhaustiveness in extracting solution candidates) must be provided, but in the present invention, free (ie, grammar and meaning Basically in the PROLOG knowledge processing procedure (and the underlying knowledge interpretation policy) while allowing the embedding of variables (which may be multiple types or multiple times) in places (not limited to delimiters) By doing so, the risk of precision (solution accuracy) degradation that can be caused by hybrid knowledge processing procedures (and complex knowledge interpretation policies corresponding to the hybrid processing procedures) as in other processing systems is reduced. Avoiding natural language delimiters by handling variables as "sentences, predicates, subjects, predicates, objects, complements, collocation modifiers, collocation modifiers or sentences that can cross sentence boundaries" Unfair disagreement (regular expression) caused by crying appearance of specified patterns by expressions (reading marks, punctuation marks, parentheses, commas, periods, etc.) and modifier phrases (adjective phrases, adverb phrases, non-essential case expressions, etc.) (Unmatched), and a certain level of reproducibility (exhaustiveness in extracting solution candidates) between superficial character string expressions (between search formulas and knowledge sources) with no case structure specified. Yes. In addition, integrated and continuous citation and extraction (as candidate solutions to variables) that make it difficult to damage the exact context (character strings before and after) of the natural language that became the source of knowledge are possible. Simplicity makes it easy and easy to check and verify the substantial soundness of reasoning (the basis and justification of reasoning), and provides users with a real sense of security that the basis is always clear. Take full advantage of the specifications that variables are not bound to case structure (and you don't have to know about case structure rules (appearance order, etc., and there is no fear that the order of arguments may be wrong)) It is possible to come.
Since the present invention is primarily intended for Japanese (the amount of information for one character is large and there is no space between words), there are many contents that use characters as processing units and delimiters. (The amount of information of one character is small, the number of characters of one sentence is large, but there is a space between words), the same processing can be performed in units of words separated by spaces.
(0010)
Further, claim 2 of Patent Document 1
In the automatic unification process,
Unification of a pattern that can contain variables (constant part and variable part separated by character type, delimiter or escape character) and constant 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) Each new pattern (eg, Taro and Jiro> Taro and Next> Taro and>Taro>Taro> Sky) is substituted into the pattern by cutting the character string from the back (or front) until it becomes an empty character (example: : "Taro and Jiro and $ Y like $ Z">"Taro and next and $ Y like $ Z">"Taro and $ Y like $ Z">"Taro and $ Y like $ Z ”>“ Thick and $ Y like $ Z ”and“ and $ Y like $ Z ”), each state of the solution of the scraping process ($ X = Taro and Jiro> Taro and Next> Taro and>Taro>Tha> Sky)
Repeat recursively until there are no more variables,
The state of each intermediate solution that is unified when there are no more variables (eg, true ($ X = Taro and Jiro, $ Y = Saburo), true ($ X = Taro, $ Y = Jiro and Saburo)) Combined to obtain each unification answer (example: answer 1 = ($ X = Taro and Jiro, $ Y = Saburo), answer 2 = ($ X = Taro, $ Y = Jiro and Saburo)) A processing method according to claim 1 of Patent Document 1 is provided.
Here, “(or last)” corresponds to “(or previous)”, and means that when starting from the variable that appears last, it is necessary that the beginning of cutting be from the front.
In this way, it is possible to verify the status of each candidate solution that covers all the possibilities from the longest match solution to the shortest match solution, and to provide a comprehensive answer (a set of narrower solution candidates). It becomes possible.
(0011)
Further, claim 3 of Patent Document 1
A processing method according to claim 2 of Patent Document 1 is provided, in which, instead of gradually cutting until an empty character, only the shortest matching solution obtained separately is gradually cut.
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
When scraping gradually until it becomes an empty character,
1 character C (immediately after (or immediately before)) is another variable immediately after (or immediately before) the variable appears first (or last) in the pattern. 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, wherein the partial character string from the last (or first) of the character string of the longest matching solution to the first C is deleted including the C. provide.
Here, “(or last)” corresponds to “(or immediately preceding)”, and means that when starting from the last appearing variable, it is necessary to start from the front.
This saves enumeration of solution candidates that do not match a fixed character immediately after (or immediately before) a variable and a search based on the solution candidates, and may speed up automatic processing.
(0013)
Further, claim 5 of Patent Document 1
In the automatic unification process or automatic derivation process,
When obtaining binding information for the “goal” (including “subgoal”, the same applies hereinafter)
The binding information is obtained independently for each sentence constituting the “goal”, and the return value true and the product set are returned when the product set of the binding information 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 is assigned to each variable at the same time. Binding information indicating one binding method for each variable is obtained by interpreting “,” as an AND combination, “variable name 1 = value 1, variable name 2 = value 2,..., Variable name N = While it can be expressed in the form of a list such as “value N”, multiple binding methods can be expressed as a set of such lists, or by specifying an AND / OR combination instead of “,”. It can be expressed in the form of enclosing and the conjunction standard form or disjunctive standard form that standardizes the whole of multiple bindings.
Thereby, there are a plurality of patterns (sentences) to be satisfied at the same time, and in the case of a problem form that the same solution should enter the same name variable between patterns (sentences) (for example, such an AND join query from the user, When there is more than one sentence in the body of the rule), it is unlikely that the full-text search process for the pattern on the right side of the rule is wastefully repeated for each unification result of the pattern on the left side. 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 a natural language), and to simplify the processing for each pattern to be satisfied at the same time. In addition, display and verify the inference process (completeness and soundness) in an easy-to-understand manner. Further, it is possible to prevent the orderness (between sentences in the body part), which is unnecessary for the intuition necessary for the meaning of the rule and should not be defined, from giving side effects to the inference process.
(0014)
Further, claim 6 of Patent Document 1
In the automatic unification process or automatic derivation process,
When seeking binding information to be the “goal”,
Empty the existing binding information first,
The sentence set included in the “goal” is automatically calculated with respect to whether or not the sentence can be true under the application of the existing binding information, and additional binding information for the sentence, and the additional binding information is converted into the existing binding information. While adding this sentence, recursively reduce it,
Provided is the processing method according to any one of claims 1 to 4 of Patent Document 1, wherein the existing binding information when the sentence set becomes an empty set while being true is used as binding information that becomes a "goal". To do.
Here, “recursively reduce” means that as the recursion becomes deeper, the sentence set becomes smaller and the binding information becomes more complex (more variables are bound and the range of values to be bound is narrowed down). For example, equivalent recursive processing is realized by processing for recursively calling in C language or a stack structure for depth-first search (structure array and stack pointer, etc.) declared and defined independently.
This simplifies the problem of automatically processing open questions consisting of AND combinations of multiple patterns that should be satisfied at the same time, expressed in the form of embedding variables in natural language, into simpler and recursive partial problems with the same structure. Transform and facilitate inference process display and verification (completeness and soundness).
(0015)
Further, claim 7 of Patent Document 1
In the automatic unification process or automatic derivation process,
If you want to unify a pattern that does not contain a variable with a fact that does not contain a variable,
Return true when the pattern and fact match as a character string, or return false when the pattern and fact do not match as a character string. The processing method according to any one of claims 1 to 6 of Patent Document 1. provide.
Thereby, it can search simply and rapidly.
Note that “facts that do not include variables” include multiple sentences separated by punctuation marks. The “matching as a character string” may be provided with a mode in which the character string of the pattern may match the portion of the actual character string.
As a result, a plurality of pieces of information of the same type can be expressed together as one fact and can be searched. Moreover, it becomes easy to express some sort of order (for example, size, preciousness, oldness, etc.) between a plurality of elements.
(0016)
Further, claim 8 of Patent Document 1
In the automatic unification process or automatic derivation process,
When unifying a pattern that does not include a variable and a head that does not include a horn clause variable,
When the pattern and the head portion are matched as a character string, the result of applying the processing method according to claim 5 or 6 of Patent Document 1 using the body portion of the horn clause as a subgoal,
Return false when they do not match. A processing method according to any one of claims 1 to 7 of Patent Document 1 is provided.
As a result, sound mechanical interpretation when the head of a rule that expresses variables in a form embedded in natural language does not include variables, a seamless, easy-to-understand, simple and uniform processing mechanism, and explanation of the corresponding inference process Can be given.
(0017)
Further, claim 9 of Patent Document 1
In the automatic unification process or automatic derivation process,
When unifying a pattern that does not contain a variable and a horn clause that has a head that contains a variable,
The pattern is used as the “constant character string” in the processing method according to any one of claims 2 to 4 of Patent Document 1, and the head unit is used as the “pattern” in the processing method. For each binding information
Returns true if there is a result that is true as a result of processing as a “sub-goal” of the processing method according to claim 5 or 6 of Patent Document 1 applied to the body part of the horn clause, or exists If not, false is returned. The processing method according to any one of claims 1 to 8 of Patent Document 1 is provided.
As a result, if the head of a rule that expresses a variable in the form of embedding it in a natural language includes a variable, and the pattern that triggered this rule does not include a variable, the bound range of the variable in the body part is limited in advance, and true It is possible to speed up the process of false determination.
It can also provide a sound mechanical interpretation, a seamless, easy-to-understand, simple and uniform processing mechanism, and an explanation of the corresponding inference process.
(0018)
Further, claim 10 of Patent Document 1
In the automatic unification process or automatic derivation process,
When unifying a pattern that contains a variable with a fact that does not contain a variable,
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 processing method is as follows: return,
The processing method as described in any one of Claim 1 to 9 of patent document 1 is provided.
As a result, all the solution candidates (to the case variable) between the pattern and the (static) fact are identified and returned as “results”, so that the basics for overcoming the above “difficulty A” This makes it easy not only to visualize and verify the inference process, but also to facilitate learning through the user's hand, such as rule correction.
(0019)
Further, claim 11 of Patent Document 1
In the automatic unification process or automatic derivation process,
When unifying a pattern containing a variable and a horn clause with a head that does not contain a variable,
Results of processing using the pattern as a “pattern” in the processing method according to any one of claims 2 to 4 of Patent Document 1 and using the head unit as a “constant character string” in the processing method If there is binding information (C) that is true, and if the result of processing the body part of the horn clause as a “subgoal” of the processing method according to claim 5 or 6 is true, the binding information Return true with (C),
The processing method as described in any one of Claim 1 to 10 of patent document 1 is provided.
As a result, all the solution candidates (to each variable) between the pattern including the variable and the head (static including no variable) are identified and returned as a “result”. "The basic mechanism for overcoming can be provided simply, and not only visualization and verification of the inference process, but also learning through the user's hand, such as rule correction, is facilitated.
In addition, it is simply converted into a partial problem with the same structure that is simpler and more recursive (or mutually recursive), facilitating the display and verification (completeness and soundness) of the inference process.
In addition, a sound mechanical interpretation when the head of a rule expressing variables embedded in a natural language does not include a 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
In the automatic unification process or automatic derivation process,
When unifying a pattern containing variables and a horn clause with a head containing variables,
Returns false if the pattern does not match the number of fixed characters in the head, head or both of the head part,
The processing method as described in any one of Claim 1 to 11 of patent document 1 is provided.
As a result, the calculation amount can be significantly reduced and the processing speed can be improved as compared with the uniform search.
(0021)
Further, claim 13 of Patent Document 1
In the automatic unification process or automatic derivation process,
When unifying the first pattern containing variables and the horn clause with the head containing variables,
If the pattern and the fixed characters for the number of characters in the head and tail of the head part match,
Each obtained by constraining the head part of the horn node by each constraining information in which the result of applying the body part of the horn node as a “subgoal” in the processing method according to claim 5 or 6 of Patent Document 1 is true. For the second pattern,
If the second pattern contains no variables,
The first pattern is used as the “pattern” in the processing method according to any one of claims 2 to 4 of Patent Document 1, and the second pattern is used as the “constant character string” in the processing method. Return the result,
A processing method according to any one of claims 1 to 12 is provided.
Here, “when the second pattern does not include a variable” means that in the horn clause (rule), all the variables included in the head part are also included in the body part “all”. As a result of the variable being bound with a constant (fixed character string), all the variables in the head part are also bound (assigned) with the constant (fixed character string), so the head part variable disappears and the head part becomes a constant character string. It means that it can be considered.
As a result, unification of a pattern including a variable and a horn clause (rule) having a head including a variable can be mechanically and automatically performed by a simple calculation model in a flow that is easy for a user to trace.
That is, all the solution candidates (those that should be assigned to each variable of the pattern) between the pattern including the variable and the head portion (= constant character string) that no longer includes the variable (by each binding information) are identified. The basic mechanism for overcoming the above “Difficulty A” is simplified by reducing (transforming the problem) the original more complex problem (unification of variables vs. variables) into a form that is returned as a “result”. It is made easy to express as a thought process. In addition, in this “reduction (transformation of problem)”, since it is simply transformed into a partial problem with the same structure that is simpler and recursive (or mutually recursive), visualization and verification of the inference process (completely) (Such as sexuality and soundness) as well as learning through the user's hands, such as modifying rules. After all, sound mechanical interpretation when the head of a rule that expresses variables in the form of embedding them in natural language includes variables, seamless, easy-to-understand, simple and unified processing mechanism, and explanation of the inference process corresponding to these Can be given easily.
(0022)
Further, claim 14 of Patent Document 1
The processing method according to any one of claims 1 to 13 of Patent Document 1, wherein a computer restricts input of facts including variables.
Here, the facts including variables (knowledge sources that are not rules) are, for example, “$ X is $ X” (a fact that is tautologically true) or “$ X is $ Y” ( There is a fact that there is no reason to be true if only the superficial sentence pattern matches.
By restricting these to be input to the computer, calculation of automatic unification processing of patterns (statements that can include variables) and facts (statements that do not include variables (= fixed character strings)) is simplified. Fast response by automatic processing is possible. It also makes it difficult to mix unfounded facts into knowledge sources.
(0023)
Further, claim 15 of Patent Document 1
The rule is in the same form as a so-called horn clause, and the computer restricts that the head part includes a variable that does not appear in the body part. Claim 1 to Claim 14 characterized by the above-mentioned. A processing method as described is provided.
Here, “the computer restricts that the head part includes a variable that does 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 ($ Y and $ Z in this example) are bound (assigned) in all sentences in the body part, such as "Z-friendly, $ Z is a child, $ Y is smart" (In this example, it means that the computer restricts a rule such that $ X) remains unbound from being input, stored, or activated as a knowledge source. As in the case of the fact, such a rule leads to leaving a variable that is not bound to the head part, so that an unreasonable inference result is likely to be generated, and the inference speed is reduced.
By restricting the input of such rules to the computer, a pattern (a sentence that can include a variable) and a head part (a sentence that does not include a variable (= fixed character string) according to claim 13 of Patent Document 1) are combined. Calculation of the automatic unification process is possible, and a high-speed answer by the automatic process becomes possible. It also makes it difficult to produce unreasonable inference results.
(0024)
Further, claim 16 of Patent Document 1
In the automatic unification process or 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, wherein the processing method is performed by obtaining and returning a set of minimal solutions as a fixed character string.
Here, as an example of “a set of solutions that are minimal as fixed character strings”, as a result of automatic unification between “$ A is $ B” and “$ C is also $ D”, {($ A = ”also”, $ 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 (particularly the smallest simple example) even when an infinite number of solutions exist.
(0025)
Further, claim 17 of Patent Document 1
In the automatic unification process or automatic derivation process,
Automatic unification of patterns and heads or facts with unbound variables remaining in each other,
It is performed by obtaining and returning a minimal solution set as a character string including variables,
The processing method as described in any one of Claim 1 to 13 of patent document 1 is provided.
Here, as an example of “a set of solutions that are minimal as fixed character strings”, as a result of automatic unification between “$ A is $ B” and “$ C is also $ D”, {($ A = “$ C”, $ B = <free>, $ C = <free>, $ D = “$ B”), ($ A = <free>, $ B = “$ D”, $ C = “$ A is”, $ D = <freedom>)}, and so on. It is considered that the sum of the string length of the value that binds the variable (the value assigned to the variable) (however, if the variable is included, one character per occurrence of the variable) (through the assembly) is minimized be able to.
This makes it possible to provide a general form of a solution even when an infinite number of solutions exist.
(0026)
Further, claim 18 of Patent Document 1
If the fixed characters for the number of characters that exist in common at the beginning and tail of each character string in the pattern and the head part or the fact that the unbound variables remain in each other do not match,
It is characterized by returning false,
The processing method of Claim 16 or 17 of patent document 1 is provided.
Thereby, it is possible to save the automatic search without the possibility of unification and to speed up the automatic processing.
(0027)
Further, claim 19 of Patent Document 1
When obtaining a set of solutions that are minimal as a character string including the fixed character string or variable,
Variables included in both character strings (the first character string and the second character string) consisting of the pattern and the head part or the fact that unbound variables remain in each other are commonly bound in each character string. And while being bound independently between strings (or while the scope that binds the same name variable in common is only within each string (or between the strings is outside the scope of the variable))
For each variable, any substring (<empty>) and the other character string (the second character string for the variable in the first character string, the first character string for the variable in the second character string) (Including the entire character string), or by substituting itself and searching for a case where both character strings match, a search for a minimal solution is obtained by a full search,
The processing method of Claim 16 or 17 of patent document 1 is provided.
“Or substitute yourself” means that “$ X” itself is assigned to “$ X” in the character string, and happens to be in both the first and second character strings. When $ X (the scopes of each other are different) is included, the $ X of the first character string and the $ X of the second character string can be distinguished from each other (for example, “$ X1” and “$$”). Substantial calculations can also be done by substituting (as X2 ", etc.).
As a result, it is possible to ensure a certain level of completeness of the solution set (completeness depending on the nature of the problem (pattern pair)) while ensuring soundness and stopping properties (finiteness of calculation).
(0028)
Further, claim 20 of Patent Document 1
It is not both strings consisting of patterns and heads or facts where unbound variables remain in each other,
Both character strings corresponding to the two character strings remaining after removing the fixed characters corresponding to the number of characters existing in common at the head and tail of each character string of the pattern and the head part or the fact that the variables that remain unbound remain. 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 level 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 likes $ D ice", instead of searching for a solution as it is, Delete the common part of "$ A is $ B"
And "$ C is also $ D ice"
In addition, all the partial character strings of “$ C and $ D ice” for each of “$ A” and “$ B” by full search (this is a variable such as $ C or $ D ($ {•• .} Variable is also the same as 6 characters, so 6 × (6 + 1) / 2 + 1 (<empty> minutes) +1 (substituting itself) = 23 types) Similarly, all the partial character strings of “$ A is $ B” for each of “$ C” and “$ D” (since this is also three characters, 3 × (3 + 1) / 2 + 1 + 1 = 8 ways When all the character strings (23 × 23 × 8 × 8) that can be obtained by substituting (A) are matched (for example, (
"Momo ice",
"Hamo ice",
"$ A is also iced",
"$ C is ice cream",
"$ A is $ D ice"
* By the way, “$ C is not the same as $ B ice”))
($ 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", $ B = "ice", $ C = "$ C", $ D = "")
($ A = “$ A”, $ B = “also $ D ice”, $ C = “$ A is“, $ D = ”$ D”)} or a set of partial assignments of each assignment pair (for example, {
($ A = "" and $ B = "ice"),
($ A = <empty>, $ B = "also ice"),
($ A = “$ A”, $ B = “also ice”),
($ A = "$ C", $ B = "ice"),
($ A = "$ A", $ B = "also $ D ice")
})
Can be answered as a solution.
Note that $ A = “$ A” and $ B = “$ D ice” are free to $ A and $ D, and can be unified by substituting any character string (that is, It is possible to show that there is an infinite solution and the constraint (regular expression form) of the infinite number of solutions (character strings). (0029)
Further, claim 21 of Patent Document 1
Substitute all the substrings (including <empty> and the whole string) of the other party's character string for each variable, or try to find a case where both character strings match, and find a minimal set of solutions by full search When seeking
When a variable is included in a substring to be assigned to a variable, the same assignment to the new variable is performed while replacing the variable included in the substring with a new variable that did not exist in both strings. In addition, the processing method according to claim 19 or 20 of the patent document 1 is provided in which a full search for searching for a case where both character strings match is performed recursively thereafter.
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 partner character string (for example, both character strings = { In the case of “$ X is $ X” and “$ Y”, it is necessary to be able to enumerate solution candidates ($ X = “say”, $ Y = “Yes”)). The completeness of enumerating solution candidates can be further improved while maintaining soundness. In the above example, both character strings (also referred to as “pattern pairs”) = {“$ X is $ X”, “yes $ Y”} ($ X = “say”, $ Y = ”yes”) That the solution candidates can be listed recursively according to the present invention ($ X = ”$$ {Y1}”) → ($ {Y1} = <empty>) → ($ Y = “Yes”) It can be shown by being able to generate branches (which are part of the 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 series of substitutions that match while performing a breadth-first search that recursively repeats each possible substitution to each variable (same as the claim of the previous patent document 1). (E.g., ($ X = “yes $ {Y1}”) → ($ {Y1} = <empty>) → ($ Y = “yes”), etc.)). Variations of the first assignment are 2 and 3 variable types in both strings, respectively, and the string length is 6 and 7 characters respectively (variables are counted as 1 character) 2 × (7 × (7 + 1) / 2 + 1 + 1) + 3 × (6 × (6 + 1) / 2 + 1 + 1) = 60 + 69 = 129. When a breadth-first search is performed so that the longest depths of further branches derived from these branches are equal, a limiter based on the number of substitutions (program step for comparing with the upper limit value, etc.) is provided, so that each search is performed once. Can be limited to an appropriate amount of computation (ensuring stoppage and response speed that are no longer guaranteed by recursiveness). Even in the case of depth-first search, the amount of calculation can be limited by depth limitation, the number of substitutions, and the like. In each case, an infinite loop due to self-recursion or mutual recursion, a stack structure (array of structures) that manages recursive function calls, etc. are provided, and call parameters for the branches that are ancestors (more root direction) (its substitution series) This may be avoided by comparing the state expression of both character strings according to (assignment context) with the current call parameter. Further, depending on whether or not the fixed character strings existing at the head and tail of both character strings match the number of characters existing in common, it is possible to perform pruning of branches that cannot be unified. If no solution is found by searching for a limited amount of calculation (for example, substitution 1 million times or search depth 20 or less), it is found as “no solution (accuracy: substitution 1 million times and search depth 20 or less)”. "($ X =" say ", $ Y =" yes "), (...), ... (however, accuracy: millions of substitutions and search depth within 20)" etc. It is also possible to answer the user while specifying the search accuracy. In addition, when the full search can be clearly performed within the limited number of substitutions and within the limited search depth (when there is completeness), “no solution (all searched)” or “($ X =”) It can also be answered to the user by clearly saying “, $ Y =“ Yes ””, (...),.
(0030)
Further, claim 22 of Patent Document 1
As for the result assigned to the variable, the two character strings remaining by removing the fixed characters corresponding to the number of characters existing in common at the head and tail of each character string,
Each time the search progresses, it is present at the head or tail of the character string as the “other character string” that is the target of “any substring of the other character string (including <empty>” and the entire character string). Featuring fewer fixed characters,
The processing method as described in any one of Claims 19-21 of patent document 1 is provided.
As a result, the number of branches is reduced each time the search is advanced (as it goes to the previous branch), and the calculation amount can be saved.
(0031)
Further, claim 23 of Patent Document 1
When obtaining a set of solutions that are minimal as a character string including the fixed character string or variable,
Variables included in both character strings (the first character string and the second character string) consisting of the pattern and the head part or the fact that unbound variables remain in each other are commonly bound in each character string. And while being bound independently between strings (or while the scope that binds the same name variable in common is only within each string (or between the strings is outside the scope of the variable))
A processing method for obtaining a set of solutions by recursively assigning a fixed character string (including an empty character) or a character string including a variable to each variable,
Limit the variable to be substituted to the corresponding head or tail variable of the subject string whose head or tail is a fixed character,
The substitution value is a new variable or <empty> following the initial fixed character or fixed character string if it is the head, or the fixed character or fixed character string following the new variable if it is the tail. Or <empty>
For the result of assigning to the variable, it is repeated to remove the fixed number of characters common to the head and tail of each character string from both,
A 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 comprehensiveness of search) by focusing on the presence of fixed characters at the head and tail, enabling significant computational savings and speedup. Become. (0032)
Further, claim 24 of Patent Document 1
When obtaining a set of solutions that are minimal as a character string including the fixed character string or variable,
Variables included in both character strings (the first character string and the second character string) consisting of the pattern and the head part or the fact that unbound variables remain in each other are commonly bound in each character string. And while being bound independently between strings (or while the scope that binds the same name variable in common is only within each string (or between the strings is outside the scope of the variable))
A processing method for recursively assigning a fixed character string (including an empty character) to each variable to obtain a set of solutions,
Binds binding information that can be generated using only fixed character types (character types excluding variable identifiers and delimiters) in both character strings that can be generated by removing common fixed characters for the number of characters existing at the beginning and tail of each character string. A processing method according to claim 16 or 17 of Patent Document 1 is provided, which is obtained by listing in order from the smallest character string length of values.
As a result, problems with a certain property can be efficiently reached and enumerated.
(0033)
Further, claim 25 of Patent Document 1
Based on the calculated “a set of solutions that are minimal as strings containing variables”
A processing method according to claims 19 to 24 of Patent Document 1 is provided in which a search is continued by a horn clause that can be temporarily rewritten by a character string including the variable.
As a result, the constraint calculated in order to unify the pattern and the head part of the horn clause (rule) (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) that can be unified only by being bound (assigned) with a character string. It can be propagated to the search process, and the search can be made efficient.
(0034)
Further, claim 26 of Patent Document 1
Based on the calculated “a set of solutions that are minimal as strings containing variables”
A set of fixed character string sets made by substituting each element of the set of fixed character string sets defined in advance as a set of solution sets of the “facts including variables” to the variable portion of “character strings including variables” return,
The processing method as described in any one of Claims 19-25 of patent document 1 is provided.
Thus, a database (for example, “word equation (registered trademark)”, “VLANK (registered trademark)) that associates a fact including variable (s) and a set of appropriate answers (or hypotheses) that can be embedded in the variable. It is possible to perform a solution search efficiently linked 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)
Further, claim 27 of Patent Document 1
In the automatic unification process or automatic derivation process,
When performing automatic unification of a first pattern containing variables and a second pattern containing variables:
If the fixed characters for the number of characters in the head and tail of both patterns match and the same variable appears only once in each pattern,
Returns information indicating the existence of an infinite number of solutions,
The processing method as described in any one of Claims 1 to 26 of patent document 1 is provided.
(0036)
Further, claim 28 of Patent Document 1 is
An apparatus for performing the method according to any one of claims 1 to 27 of Patent Document 1 is provided.
(0037)
In addition, claim 29 of Patent Document 1
A computer program for causing a computer to execute the method according to any one of claims 1 to 27 of Patent Document 1 is provided.
(Effect of the invention of Patent Document 1)
(0038)
The effects of the present invention are as described above for the claims of each Patent Document 1.
(Brief description of the drawings of Patent Document 1)
(0039)
FIG. 1 is an overall view of a network system that most effectively implements the present invention. Example 1
(FIG. 2) FIG. 2 is an explanatory diagram showing the hardware configuration of a computer that implements the present invention. Example 1
(FIG. 3) FIG. 3 is an explanatory view showing an example of screen display in a terminal embodying the present invention.
Example 1
(Mode for carrying out the invention of Patent Document 1)
(0040)
The present invention can be implemented in any kind of computer (cloud server, large general-purpose machine, desktop PC, notebook PC, portable terminal, dedicated machine of the present invention) connected / not connected to the network. A description will be given of a mode realized by a PC connected to the Internet having a multitask function and a window function.
FIG. 1 is an overall view of the network system that most effectively implements the present invention. A content management apparatus 1 is used for content (rules and facts) handled by a user PC 2 or a user / manager PC 2 in the present invention. It may be a known file sharing server that accepts posts and distributes content while controlling sharing access rights and content provision priority according to a predetermined policy. For each user, the user PC 2 inputs and stores contents (rules and facts) expressing the believed contents (or contents to be examined) in a natural language according to the method of the present invention, and stores them. A computer to be processed, a portable terminal, and the like.
FIG. 2 is an explanatory diagram showing the hardware configuration of a computer used in the present invention. This is a general computer configuration, and the feature of the present invention is that the CPU 2e uses natural laws in accordance with instructions and descriptions of the program 3 and content data 4 stored in the nonvolatile memory 2h. And the way of the interaction protocol (format) with the user.
FIG. 3 is an explanatory view showing an example of screen display in a terminal embodying the present invention. In the figure, in response to the question “?? $ A do not do” (open question format), “$ A == does not do as much as possible” in the first line of the stored list L not shown.
In the same way, the answer of “1/1” as much as possible is enumerated, and similarly, “$ A = bullying / 9 /” is answered using the fact that “not bullying” in the ninth line of list L.
(0041)
In such an embodiment, the computer (manufactured by a PC, etc.) can perform all possible operations by a computer program manufactured via a C ++ language or the like. Therefore, well-known basic operations of computers using natural laws (register / memory / storage / storage, four arithmetic operations, comparison, etc.) and general functions that are already standard libraries for development environments, etc. (Assignment / comparison / copy to variables and N-dimensional arrays, manipulation / comparison / display of character strings and numerical values, operations such as list structure / queue structure / hash structure / vector type, binary search, sort operation, regular expression The method for realizing pattern matching operation, network communication operation, etc.) is different from the essence of the present invention (unique configuration leading to novelty and inventive step), and is well known to those skilled in the art, so will not be described in detail. . On the other hand, in what operation sequence and storage method (algorithm and data structure) the processing unique to the present invention is realized by combining such general functions will be described in detail below. By providing a description of this algorithm and the like, a description of the above problem solving means, and a description of the drawings of the present invention for reference of development, if a professional programmer at a standard level, a standard application program development technique ( It is clearly possible to cause a computer to implement the method of the present invention using a GUI application integrated development environment using C ++, etc., and it is also possible to create an apparatus and 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 a function call is performed. Processing means (program) corresponding to the solution means of the present invention while performing input / output and function separation according to the function sharing of each function below (or by coding a function group as it is in accordance with the specifications shown below) And a computer) can be realized.
(0043)
■ Processing algorithm specification of knowledge list L for query P
================================================== ================================================== =================
Function Q1 (P: pattern that can include variables, L: knowledge list): Example 1 of Patent Document 1 of main function common to claims of Patent Document 1
{
1. Take the contents B (facts or horn clause) of the first line of L.
However, if L is empty (if the first line could not be fetched), output false and end.
2. The initial value of the variable binding information C is emptied, and the following function H (P, B, C) is called to output true (= match) binding information (= solution set) C.
If true (= matched), true (yes) is output (the line number of the matched content B is also output).
If false, do nothing.
3. When there is a content B 'on the next line of L-B ← B' and move to 2.
If there is no-If you have never output true in step 2, output false (no).
・ End.
}
(0044)
■ Knowledge List L Processing Algorithm Specification for Query P (Pre-fixed Character String Version) =============================== ================================================== ====================================
Function Q2 (P: pattern that can include variables, L: knowledge list): Example 2 of main function common to claims of Patent Document 1 (pre-fixed character string version)
{
(Prefixed string conversion in advance)
1. A fixed character string text T having {rows of all characters that can be deduced only from L / line number set of L used as a basis for deducting each character string} is obtained.
Specifically, a text T obtained by merging the elements of the output series (A = solution 1 / foundation 1, A = solution 2 / reason 2,...) Of the function Q1 (“$ A”, L) as each line. Ask.
In the case of an infinite loop in the middle of the search, the deduction is partially omitted by the infinite loop detection function using an explicit call management stack or the like.
・ For example, whether or not the computer is checking the truth of a horn clause under a certain variable constraint condition,
Manage the call management stack whose members are the structure (the horn clause identifier being confirmed and the current variable binding condition)
When calling, an infinite loop is detected by performing a linear search for the same combination toward the root of the stack.

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

3. If there is even one C, true is output, otherwise false is output.
}
(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 the query P
================================================== ================================================== =================
Function H (P: a pattern that can include a variable, B: a fact (fixed character string) or Horn clause, C: variable binding information): ★ function used in the invention of claims 1 to 15 of Patent Document 1 Example 1-1 of Patent Document 1 ★
{
If P contains no variables {
If B is true {
Returns true if P = B.
Otherwise it returns false.
}
If B is a horn clause {
When the head of B does not contain a variable {
In the case of the head portion of P = B, the true / false of the function D (B body portion, E) is returned.
Otherwise it returns false.
}
When the head of B contains variables {
For each C1 in which F (head part of B, P, C1) is true,
Returns true if there is C1 for which the result of function D (B applied to C body part, E) is true.
Otherwise it returns false.
}
}
}
If P contains a variable {
If B is true {
If there is C1 for which F (P, B, C1) is true, add all such C1 to C and return true.
If no such C1 exists, return false.
}
If B is a horn clause {
When the head of B does not contain a variable {
If C1 with F (P, B head, C1) is true and if function D (B body, E) is true, then add all such C1 to C Returns true.
Otherwise it returns false.
}

When the head of B contains variables {
★ When implementing the invention of claim 12 of Patent Document 1 ★
// Start device for speeding up (optional) When fixed characters for P and B heads and tails do not match {
Returns false.
}
// End speed improvement (option)

★ Implementation of Claim 13 of Patent Document 1 ★
When the fixed characters corresponding to the number of characters in the head and tail of the head part of P and B match {
For any binding information G in E for which the result of function D (B body part, E) is true, function F (P, B head part bound with G (should be a fixed character string)) , C1) If C1 is true
Add all such C1s to C and return true.
Returns false if no such C1 exists.
}
}
}
}
}
(0046)
■ Specification of enumeration algorithm for solution set of body part of Horn clause (or query of heavy 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 query of shared sentence sharing variables), E: solution set): Example 1-2A of Patent Document 1 of function used in invention of Claim 6 of Patent Document 1
* However, the entire knowledge source L can be stored in a global variable and referenced.
1. Take 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, return false.
If true, M does not contain variables
do nothing.
When M contains a variable
A set C of binding information that can be taken to make M true is stored.
* Variables that do not need to be bound to be true can be explicitly indicated.
* When a certain condition is required to be true while the bound value is an infinite set, the condition can be added.
3. Take out the next sentence M ′ in J. If not, return true (E = binding information set C).
4). The function Q1 (M ′, L) or Q2 (M ′, L) is called for the entire knowledge source L.
If the result is false, return false.
If true M 'does not contain any variables
do nothing.
When M 'includes a variable
A product set of a set C ′ of binding information that can be taken to make M ′ true and a stored set C is defined as a new C.
However, when the original set C is not an empty set but a product set and becomes an empty set, false is returned.
* Variables that do not need to be bound to be true can be explicitly indicated.
* When a certain condition is required to be true while the bound value is an infinite set, the condition can be added.
Return to 5.3.
}

Function D2 (J: body part (or query of shared sentence sharing variables), E: solution set): Another embodiment 1-2B of Patent Document 1 of the function used in the invention of Claim 6 of Patent Document 1 (Through the use of recursive function calls, the binding information is propagated to other statements to increase the speed.)
{
1. Take the first sentence M in J. Returns true if M does not exist.
2. Q1 (M, L) or Q2 (M, L) is called for the entire knowledge source L.
If the result is false, return false.
When true If M does not contain a variable Return true if there is no statement following J. If it is true, return the next sentence as a new M and return to 2.
If M contains a variable If there is no statement following J, the possible binding information is stored in E, and if true is returned, the possible binding information is stored as a set C.
3. E is emptied, and for each binding information K in set C, recursive call D2 (body part J ', E' formed by binding the next sentence after J with K) is executed. 3. Add that K and E 'that became true. Returns false if each K has never been true, returns true (E) if it has never been true}

Function D3 (J: body part (or query of shared sentence sharing variable), E: solution set): Example 1-3 of Patent Document 1 of function used in invention of Claim 5 of Patent Document 1
{
1. Take the first sentence M1 in J. Returns true if the first sentence does not exist.
2. Q1 (M1, L) or Q2 (M1, L) is called for the entire knowledge source L.
If the result is false, return false.
When true M1 does not contain a variable
do nothing.
When M1 contains a variable
A set C1 of possible binding information is stored.
3. Similarly, C2, C3... Are obtained for M2, M3.
If false, return false.
4). The product set C is obtained for the remaining C1, C2, C3... Cn, and true (C) is returned.
}

(0047)
■ Enumeration algorithm specification of multi-length coincidence solution (s) of fact S for query P
================================================== ================================================== =================
Call example → Function F ("$ A and $ B are friends", "Taro and Jiro and Saburo are friends", "");
Function F (P: pattern that can contain variables, S: constant character string, C: binding information of variables): Invention of claim 2 of Patent Document 1 (however, “(or last)” and “or previous”) Example 1-4A of Patent Document 1 of Function Used in Omitted Implementation Example)
{
(Preparation)
1. The number of types V of variables in P and the names of appearing variables N1, N2,.

(Corresponding to the case where P originally does not include a variable)
2. When V is 0,
⇒ When P = S, return true and end.
⇒ If P ≠ S, return false and end.

(output)
3. When V is 1, no matter how many times N1 appears in P, there is only one solution R1 for unifying P and S.
⇒ If there is a match, output the only solution as “C and N1 = R1”, return true, and end.
⇒ If there is no match, return false and exit.
* Unification itself can be performed as a match with a regular expression (if the same variable appears more than once, there is a postscript reference)

4). When V is 2 or more Execute recursive call F (P ', S, C and N1 = R1) for P' which can fill all N1 in P with longest matching solution R1 for variable N1 ⇒ Longest for N1 A solution set that matches is output

5. R1 ′ ← R1 is a character string excluding the last character. For P ″ in which all N1s in P are filled with R1 ′, a recursive call F (P ″, S, C and N1 = R1 ′) is made. Execution ⇒ For N1, a solution set is output as a solution candidate R1 ′ obtained by removing one character from the longest matching solution

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

(0048)
Function F (P: pattern that can include a variable, S: constant character string, C: variable binding information): Example 1-4B of a function used in the invention of claim 4
// Function F with the first device for speeding up, focusing on the first character C in the fixed character string immediately after the variable first appears in P
{
(Preparation)
1. The number of types V of variables in P and the names of appearing variables N1, N2,.

(Corresponding to the case where P originally does not include a variable)
2. When V is 0,
⇒ When P = S, return true and end.
⇒ If P ≠ S, return false and end.

(output)
3. When V is 1, no matter how many times N1 appears in P, there is only one solution R1 for unifying P and S.
⇒ If there is a match, output the only solution as “C and N1 = R1”, return TRUE and end.
⇒ If there is no match, return false and exit.

4). (Device 2 for speeding up. This process may be omitted since it is covered by 5 or later. ★ This device 2 is not claimed in the patent document 1)
When V is 2 or more,
Match all the variables (N1 (= N), N2,...) In the longest match mode and match all variables (N1 (= N), N2,...) In the shortest match mode. If the solution you tried is the same (N1 = R1, N2 = R2,...) ⇒ Output the only solution as “C and N1 = R1 and N2 = R2 and. If not,
⇒ Return false and finish.
If not identical ⇒ Continue to 5

5. When V is 2 or more Execute recursive call F (P ', S, C and N1 = R1) for P' which can fill all N1 in P with longest matching solution R1 for variable N1 ⇒ Longest for N1 A solution set that matches is output

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

7). 1 character C, which is a fixed character immediately after the first appearance of variable N1 in P (the first character C of R2 when immediately after another variable N2),
When included in longest matching solution R1 ⇒ 1) Character string with partial character string deleted from the end of the character string of R1 '← R1 to that C ⇒ 2) All N in P with P''←R1' ⇒ 3) Execute recursive call F (P ″, S, C and N1 = R1 ′)
⇒ Should be output if there is a short solution for N1, if it is not included in the longest matching solution R1 ⇒ Since N1 has finished enumerating shorter solutions, it 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 an abstract excerpt from Patent Document 6 (Japanese Patent Application No. 2006-196069).
=============================================== =========
Patent Document 6 describes, as claim 1,
A computer program having a text-to-speech function,
Text accessible from the computer program (a set of character strings, which may or may not ask for the order between the character strings);
A logical expression including a question sentence that accepts a string containing a variable as a literal and answers the string that fills the variable to make the literal true,
There is provided a computer program characterized by extracting or synthesizing and reading out a character string that is an answer to the question sentence according to the logical expression.
: Here, “accessible text” is a rule (inference rule) that is a PROLOG horn clause using a set of facts described in natural language and a form in which variables can be embedded in natural language as literals, for example. And may or may not contain rules (inference rules).
: “A logical expression including a question sentence whose answer is a character string that fills a variable” may or may not include facts and rules (inference rules) other than such a question sentence. It may be an equivalent of a regular expression or a subset thereof and an extension thereof.
: The “rule (inference rule)” may be a production rule, a term rewriting rule, a PROLOG horn clause, etc., and these are expanded to a format that allows a literal with a variable embedded in a character string. It's okay.
> This makes it possible to create a text format that combines a logical expression and a surface natural language expression for speech synthesis (for reading aloud) rather than only natural language text or logical expressions. Knowledge representation can be managed centrally, and knowledge can be added, edited, deleted, etc. using general logical (declarative) / procedural programming languages (PROLOG, AWK, SQL, PERL, PHP) , C ++, JAVA (registered trademark), etc., even elementary school students who do not know can feel free to implement.
> In addition, since a logical expression including a question sentence that uses a character string that fills a variable as an answer is used, not only the entire sentence including each answer or the entire sentence but only the character string that is the point of each answer (the common part is It is possible to extract and synthesize a large number of character strings (only different parts) in a dynamic manner (that is, according to a difference in a question sentence) and read it out in a manner (so as not to be bored / redundant).

(0006)
Patent Document 6 is as claim 2,
The computer program product of claim 1, wherein the accessible text includes inference rules.
: Here, the “inference rule” allows, for example, a form including a variable in a character string as a literal of the LOG clause of PROLOG, and “a neighborhood is $ X: -req” http://hoge.net/JP /ISHIKAWA/KOMATSU/BIRUGAWA.jpl "; $ X;" etc. This meaning is obtained by acquiring a BIRUGAWA.jpl file from a predetermined URL on the Internet (in this example, a site that manages folders in a hierarchical manner), and connecting each line to "Neighborhood". "The whole string is true".
> Thereby, only the file of interest is accessed from the local news on the Internet that is updated remotely, and only the portion of interest is extracted (such as “$ Y and $ Z are married”). Depending on the model, functions such as reading aloud (with a new composition of text such as “$ Y and $ Z are newlyweds”) can be defined as modules and used as they are, or they can be used as they are. It is easy to modify and reuse only the functions of the department, or to divert it to analysis / extraction applications in related fields.
(0007)
Patent Document 6 describes, as claim 3,
The computer program according to claim 1, wherein the logical expression includes a fact.
: Here, as a simple example of “a logical expression including facts,” “Today the weather is good” and “Taro can get hooked on $ X as a hobby” is given.
: In this case, “weather is good today” is true,
Text that contains inference rules (for example,
“Taro can be hooked on hobby fishing:-The weather is good today;”
“Taro can get hooked on reading hobbies:-today is bad weather;”
“Taro can be crazy about his favorite job”
)
After adding this fact (“the weather is good today”), a solution (in this case “fishing”) that can fill in “$ X” of “Taro can be hooked on $ X of hobby” is obtained.
> This makes it possible to separate rules that can be established dynamically (temporarily at the time of a question) from those that do not, provide hints for answering questions in logical expressions, and expand the scope of problems and solutions It becomes possible to restrict.
(0008)
Patent Document 6 describes, as claim 4,
The computer program according to claim 1, wherein the logical expression includes an inference rule.
: "Logical expressions including inference rules" are, for example, "" Komatsu city small one arithmetic is $ X: -req "http://hoge.net/JP/ISHIKAWA/KOMATSU/ELEMENTARY/1/ARITH.jpl “; $ X;” “Komatsu City $ X?” ”Or the like.
> This makes it possible to add a rule (for interpretation, rewriting, etc.) to be applied dynamically (temporarily at the time of a question) for each question. Also, through the truth of the interpretation, as in the case of facts, the rules that can be established are separated from those that are not, the tips for answering the questions in the logical formula are provided, and the scope of problems and solutions is expanded Or restrict.
(0009)
Patent document 6 has as claim 5:
The accessible text,
The computer program according to any one of claims 1 to 4, which has a user interface that is selected by a user from a limited choice (text set) in advance.
: Such interfaces include drum rolls as hardware, jog dials, list boxes as software controls (may be N-column format), combo boxes, radio buttons, etc., or computer graphics expressed by combining them, Etc.
: Text set is, for example, a set of paths to local files, a set of paths to in-house LAN shared folders, a set of URL / URI paths to Internet files, a pointer to text in memory, or a combination thereof be able to.
> Thereby, content can be restricted in the case of minor education use including elementary and junior high school students. In addition, the subject text can be divided for each subject so that even lower grades and older people can access, edit and manage them efficiently.
(0010)
Patent document 6 has as claim 6:
For each accessible text, associate and store a set of logical expressions corresponding to the text,
The computer program according to claim 1, further comprising: a user interface for selecting a logical expression from a set of logical expressions corresponding to the text being accessed.
: There may be one “Logical Expression Set” element for each accessible text.
: "Logical expression corresponding to text" is a logical expression that has been asked for the text in the past, a logical expression that is known to be useful for the text, and that the text is asked in the first place. (Designated logical terms).
> This makes it possible for users who are not familiar with computers and logic formulas (elementary school students, senior citizens, etc.) to easily conduct substantial dialogues with one click without assistance.
It is preferable to manage one or more “logical expressions corresponding to the text” by embedding one or more in a predetermined format in the accessible text. In the following example, an inquiry can be made by simply selecting from two buttons. In the following example, “: &” means that the head is displayed as a selection 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 years old:-My father is $ X years old;
My man's family is $ X years old:-My grandfather is $ X years old;
My man's family is $ X years old:-My brother is $ X years old;
My man's family is $ X years old:-My brother is $ X years old;
My man's family is $ X years old:-My son is $ X years old;
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 years old:-My grandmother is $ X years old;
My man's family is $ X years old:-My sister is $ X years old;
My man's family is $ X years old:-My sister is $ X years old;
My man's family is $ X years old:-My daughter is $ X years old;
===
: In this case, the first half of the data can be programmed to be dynamically read from an external file (by an embedded function having a function similar to C language #include or PHP require_once). Can be updated in response to updates (by external news distribution companies, internal knowledge editors, family IT staff, etc.).
: If the accessible text is a local file (no sharing is set), the file is updated only by you. In the case of a shared file or an Internet public file, a file updated by a person in charge with each access right is used.
: The buttons to select are an N-column list box, a list box arranged in a brick style, a single kanji character label representing the button arranged on a flat surface or pseudo 3D, and the frequency of use Depending on the above, the contents of the logical expression or the summary may be described in a circle having a different size.
: It should be noted that for users who cannot press the button control with the mouse, or for users 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-gaze recognition. Such elemental technologies for recognition are not detailed for the sake of clarity. In addition, as long as the interface can essentially select one from N, it is not limited to the button type, and various methods such as a drum roll type touch type and an electroencephalogram measurement selection type can be used.
: Also, when linking with the employee's face recognition sensor, the button that is often pressed for each employee is stored in the computer, or the contents that the administrator wants to remember for each employee (rules, expertise, latest information, (English words, correspondences, etc.) are stored in a computer, and when an employee is approached and recognized, the contents to be informed / studied to the employee without pressing a button are spoken. Etc. can be output.
: For elderly people, it can also be used to prevent forgetting by familiar contents organized by field (buttons showing friend list, relative list, shopping list, telephone list, etc.).
： Also, at a school, the morals and rules that the school wants to comply with (a list of items that should not be carried, a list of clothing rules, etc.), a list of teacher names that you want to remember, a list of familiar knowledge of the area (the surrounding history, Geography etc.), it can also be used for systematic enumeration of English words, old words, chronological tables and theorems that you want to remember for each grade.
(0011)
Patent document 6 is as claim 7,
If there are multiple character strings that are the answers to the question text that is extracted or synthesized and read out,
The computer program according to any one of claims 1 to 6, wherein the computer program is read in a random order using a random number generation algorithm.
As a result, it becomes easy to eliminate the order of knowledge that does not need to be stored and to recognize each knowledge as independent knowledge.
(0012)
Patent document 6 has as claim 8:
When there are multiple character strings that are the answers to the question text read out by extraction or synthesis,
If you pause 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 out before the interruption is preferentially read out.
> This makes it possible to convey all of the answers without any interruptions without interruption.
(0013)
Patent document 6 has as claim 9,
If there are multiple character strings that are the answers to the question text that is extracted or synthesized and read out,
Setting a ratio between the plurality of existing character strings or between the texts from which the plurality of existing character strings are extracted;
The computer program according to any one of claims 1 to 8, wherein the plurality of character strings are repeatedly read out at a frequency ratio according to the set ratio.
> This makes it possible to memorize what should be remembered with emphasis and what should not be memorized in a well-balanced manner.
(0014)
Patent document 6 has as claim 10:
The updated text,
Automatically load from a given location at a given time or frequency to make the accessible text,
A character string that is an answer to a question sentence according to a predetermined logical expression,
The computer program according to claim 1, wherein the computer program is automatically extracted or synthesized from the accessible text and read out.
As a result, when the HTML text on the Internet updated by the news site is “updated text”, it is possible to check only the news filtered by the logical formula at a predetermined time and frequency.
> Also, by combining a plurality of contents, for example, an alarm study & news check function can be provided.
> In addition, when the text to be updated is a mission-critical document or database column specified as an internal / external interface, it is easy to create a timely automatic business document by linking with the template engine. It becomes.
(0015)
Patent document 6 has as claim 11:
At a given time or frequency
A character string that is an answer to a question sentence according to a predetermined logical expression,
The computer program according to claim 1, wherein the computer program is automatically extracted or synthesized from a predetermined accessible text and read out.
: The automatic reading time or frequency may include various designation methods such as daily time setting, hour / minute setting, minute / second setting, date / time designation, day designation, and the like.
> This makes it possible to repeat the knowledge that tends to be inaccurate memory, such as in-house rules, by repeating it.
(0016)
Patent document 6 has as claim 12,
The accessible text,
It is added according to posts from an unspecified number of users,
A computer program according to any one of claims 1 to 11 is provided.
: Posting correspondence may be in the form of detecting postings to a predetermined shared folder or Internet site, or in the form of so-called crawlers collecting posts to unspecified Internet sites.
> This makes it possible to collect, exchange, share, and mutually brush up study texts and business / hobby information.
(0017)
Patent document 6 has as claim 13,
The accessible text,
Edit according to posts from an unspecified number of users,
A computer program according to any one of claims 1 to 12 is provided.
: The correspondence to the posting may be a form in which update postings by editing to a predetermined shared folder or Internet site are detected, or a form in which the crawler collects update postings by editing to an unspecified Internet site.
> This makes it possible to mutually complement and check texts for study and business / hobby information.
(0018)
Patent document 6 has as claim 14,
Make the post with a clear category hierarchy of the theme,
14. The computer program according to claim 12 or 13, characterized in that narrowing is performed by specifying a hierarchy of accessible text used for extraction or synthesis of a character string as an answer by specifying the hierarchy.
: Posting is preferably performed while clarifying the following contents.

-Server-File name-Title-Version number-Text content-Hierarchical classification of themes (tree theme)
: Examples of categories (classifications) include the following.

・ Regional news tree (subdivision by region)
・ Research field tree (subdivision by research field)
・ Event tree (subdividing by event field (music, recycling, sports, etc.)
(0019)
Patent Document 6 has, as claim 15,
Output the image or sound corresponding to the character string as the answer simultaneously with the character string or instead of the character string (in the case of function division in a system composed of a plurality of remote computers, or transmission in the case of function division in the same computer) A computer program according to any one of claims 1 to 14 is provided.
: This "voice" can be pre-recorded voice, etc. instead of dynamic synthesized voice.
: The image may be a moving image.
> This makes it possible to express the set of answers and text contents of the theme according to the logical expression more specifically with a sense of reality.
(0020)
Patent document 6 has as claim 16,
Only the character string (one or more) as the answer, or the accessible text itself (a combination of one or more) depending on the logical expression, the terminal (may be a smartphone), or application software for the terminal Send it to
The computer program according to any one of claims 1 to 15, wherein output is performed 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 for studying in train clearance time or for sharing information and knowledge at business sites. Can be used.
> This makes it possible to provide answers and text in a more suitable manner.
(0021)
Patent document 6 is as claim 17,
The computer program according to claim 16, wherein the extraction, synthesis, or transmission is performed via a relay computer.
> This makes it easy to distribute to multiple users and control distribution, control the distribution order of content, insert advertisements into the content, and provide an inexpensive advertising model .
> In addition, it is no longer necessary to provide functions for extraction, synthesis, and speech synthesis using complex logic operations on the sending terminal side, making it easier to make the sending terminal a mobile terminal such as a smartphone and improving the number of posts (outgoing calls) Therefore, it is possible to reduce power consumption and memory usage, which are particularly important in portable terminals.
> In addition, enjoy the spiral of posting to a computer that relays candidates for additions and changes while enjoying reading aloud (in the past of yourself and others) by making both outgoing and output the same user's smartphone, etc. Will also be easier.
(0022)
Patent Document 6 has, as claim 18,
The computer program according to claim 17, wherein the relay computer is configured to distribute to a plurality of user terminals.
: In this case, by setting a mark on the contents of distribution, it can be set to distribute only to users other than the transmitting user.
: It can also be configured to deliver only to users who are contracted to deliver or to users within the limit of the number of users to deliver.
: When delivering to only 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 send a combination of terminal and user attributes to a hash value (which cannot be reproduced by an eavesdropper) and sent from the terminal to the relay computer along with the distribution 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 adopted among users), and the number of distributions can be calculated. It can be suppressed.
This makes it possible to deliver answers and texts to a plurality of users who are highly likely to need them in a timely manner.
(0023)
Patent document 6 has as claim 19,
The relay computer is
From the newly sent content to the relay computer to the previously delivered content,
For the terminal or user who requested delivery,
The computer program according to claim 17 or 18, which transmits contents.
: Here, content refers to 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, forming a single news article. A plurality of sentences (the order of which originally has a meaning) are combined into one content.
> This allows you to touch new content (often more important to its users) faster.
(0024)
Patent Document 6 has, as claim 20,
When new content is transmitted from a related user to a relay computer for a group channel to which the same user ID or user group belongs, the retroactive control is reset, and the new content starts at the beginning. 20. The computer program according to claim 19, wherein the computer program is controlled.
> This makes it possible to share information by reacting more sensitively to new news and the like.
(0025)
Patent document 6 has 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.
As a result, the meaning and position of each order in the reading order can be displayed in a concise manner.
> Also, it becomes easy to generate quiz-type content in a relay computer or the like, or to implement quiz-type content at each terminal.
> The combination of the character string and the logical expression that is the answer is sharp, with "what is the theme" and its "answer (solution)" as the common part and the difference part (multiple when there are multiple solutions) It is possible to inform the end user with a small amount of communication / display amount / speech amount. When related mail delivery / contact etc. are executed at the same time, it also leads to saving of packet amount.
(0026)
Patent Document 6 has, as claim 22,
The computer program according to any one of claims 1 to 21, wherein a text used for deriving an answer to be outputted or a part thereof is also outputted.
> This makes it possible to remember and confirm not only the answers but also the grounds.
> It also leads to fostering logical thinking ability.
(0027)
Patent document 6 has as claim 23,
When the variable (or variable area) that specifies the answer to be output is one type (for example, “$ X likes $ Y” instead of “$ X likes Hanako”, only the subject, etc.) ,
The computer program according to any one of claims 1 to 22, wherein an item name is omitted and output.
> This eliminates the cost (time, communication, electricity, memory, etc.) of transmitting variable names and the like that do not need to be distinguished and are not essential.
(0028)
Patent document 6 has as claim 24,
If the variable (or variable area) that specifies the answer to be output is other than one English alphabet (for example, “$ {subject} likes $ {object}”),
The computer program according to any one of claims 1 to 23, wherein an item name is output without being omitted.
> This can reduce the possibility of mistaken positioning of the answer field consisting of a plurality of fields.
(0029)
Patent document 6 has as claim 25,
The answer string or accessible text itself,
From a logical expression containing a question sentence,
The transmitting computer, the relaying computer, or the computer distributed from the relaying computer,
Generate quiz content,
The computer program according to claim 21, wherein the computer program is executed by any one of the computers.
: Here, the simplest quiz generation method is to mechanically replace a question sentence in a natural language (machine generation of a natural language), and use a “character string as an answer” as the answer of the quiz.
: If you can refer to the text or part of the text used to guide the answer to be output, you can add it as reference information for the answer. If you cannot refer to the text, you can refer to the accessible text (one or a combination) It can also be added as reference information.
> Thereby, a logical expression (“$ X produced $ Y”, etc.) including a text storing familiar information (such as a potty of Mr. Yamada's house producing two puppies) and a familiar question sentence, etc. ) Can easily and automatically generate familiar quiz questions, such as nursing home residents who share the user ID of the computer to be relayed or students of a specific class, such as “inner ring material” Can be continuously enjoyed as quiz contents (for example, {Quiz Problem Example 1: □ Two puppies were born, Answer: Pot of Yamada's house}, etc.). In this case, the computer to be relayed may be provided with a WEB server function, and the generated quiz content may be rendered to terminals in a range where the user ID is shared.
: Note that the same applies to the case where content in the form of hole filling is provided to application software that learns necessary information and transmits information in the screen saver format.
(0030)
Patent document 6 has as claim 26,
The relay computer is
Before delivery
The computer program according to claim 21, wherein a predetermined advertisement is inserted into the content.
: For text, not only advertising text, but also a link to an advertising image or advertising voice can be inserted, and for voice or video, they can be inserted or synthesized.
> This makes it possible to monetize advertising models and provide answers and texts to general consumers at a lower cost.
(0031)
Patent document 6 has as claim 27,
The logical expression includes an expression for forward reasoning;
27. The computer program according to any one of claims 1 to 26, wherein an item that is equal to or greater than a threshold value is read out and then returned to a threshold value or less.
: An expression for forward reasoning is, for example, an assert statement of PROLOG. A similar assert statement can be defined and implemented in a processing system that allows a literal in the form of a variable embedded in a character string. As another example of the logical expression, a certain proposition “Hokuriku region” is introduced by introducing a certainty factor such as ““ The wind blows in the region of $ A ”->“ The shark shop in the region of $ A makes money ”: 0.6”. The initial confidence 0.2 of 0.68 (= 0.2 + 0.6−0.2 × 0.6) for another proposition “The Hokuriku region is making a profit” when the wind blows true You may update with. In another example, even when the certainty factor on the condition side is not 1.0 (true) but the predetermined threshold value is 0.5, K ← K × 0.5 and new certainty factor = 0.44 (= 0.2 + 0) .3-0.2 × 0.3). Further, forward inference may be performed with a plurality of propositions and literals as conditions, and the condition may be satisfied when the certainty factor is greater than or equal to each predetermined threshold.
: When the truth of a proposition etc. is used as a trigger, the logical formula of forward reasoning can be applied to the proposition etc. that is originally true when the text is newly loaded and the proposition that can be proved to be true immediately after the text is newly loaded. It is possible to reset the certainty factor and re-apply it from the beginning when there is a change (addition, deletion, etc.) to the true proposition.
: When certainty level is not required (assert statement and vice versa only), it can be handled with the same memory configuration as the conventional PROLOG operation, but when providing certainty level, a dedicated memory area such as closed hash is provided. It is preferable. The content and certainty factor added by assertion may be reset for each inquiry by the logical expression or for each session by the user.
In addition, the button (s) are preferably defined so that a specific proposition can be set to true or false by or without forward inference.
> This allows employees and students to reinforce and learn their judgments about the influence chain (using simple forward reasoning formulas and forward reasoning formulas that include multiple conditions).
> In addition, it is easy to automatically generate news and its hypotheses, and to perform automatic judgment / analysis.
(0032)
Patent document 6 has as claim 28,
An apparatus comprising the computer program according to any one of claims 1 to 27 is provided.
(0033)
Patent document 6 has as claim 29,
A 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. 2006-196069).

  Each technical content shown in this patent document and the content of the cited elemental technology can also be used in the present application. However, those that are not the main subject of the present invention will not be described in detail in this 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 (step operation of a menu hierarchy) of a plurality of information modules according to the method of the present invention.
The computer recognizes the voice of the user as a predetermined recognition pattern based on a computer program (not shown) for implementing the method according to the present invention (the method for realizing transition control is not described in detail for the sake of clarity). In response to the,
Transition of user variables (for example, when the recognition pattern “work” is recognized in the information module 1 in this example, the variable “& $ {current URI}” (not shown) is set to “002.jpl” and the information module 2), and the information module that is preferentially referred to 2)
Output to the user (for example, displaying “I moved to the work page” as text, and voice-synthesizing the same content).
After this transition, the computer performs speech recognition by giving priority to the recognition pattern information included in the information module 2 over the recognition pattern information included in the information module 1. For example, in this example, when the user pronounces “manufacturing work plan”, the computer determines that it corresponds to “manufacturing plan” in the information module 2 instead of “job” in the information module 1, The command “s” for acquiring and displaying the manufacturing plan from the shared folder is executed. In this example, the recognition pattern “work” is programmed not to be registered 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, not the information module, and changes according to the user's wishes. Then, a stack data structure (not shown) in which a chain of transitions is accumulated is managed so that any information module after that returns to the original information module before the transition and goes back further.
In this example, although not shown, regardless of which information module is referenced, all of the recognition patterns are displayed on the screen to indicate to the user what recognition pattern is assumed, and the user It is urged to pronounce either as an intention expression.
In another embodiment, the menu hierarchy is an actual region, a hobby field, etc., and users who are close to the transition path on the hierarchy can make a group conversation using a known group conversation technique. , And enjoy conversations with others in similar situations. To switch the mode between conversation with another person and voice recognition using a recognition pattern, the reserved words “to conversation mode with another person” and “to voice recognition pattern” are used as an information module (in FIG. 1) as the home of each user. This is performed by registering in two variables (with && at the beginning, && $ {group conversation} and && $ {voice recognition}) in the information module 1).
In another embodiment, the information module is configured to have a coordinate value related to the actual latitude / longitude or the coordinate value of the virtual world instead of the hierarchy, and the user who has transitioned to the information module with a close coordinate is used. It is configured so that they can talk in the same way.
In another embodiment, the recognition patterns in all the information modules on the transition path from the home information module are included in the command list to enable voice recognition.
In another embodiment, only the recognition pattern currently displayed on the screen is recognized, not all, and the recognition pattern set can be totally replaced by a scroll operation.
In another embodiment, the recognition pattern is also recognized as a candidate recognition pattern that is recognized at the same time as a recognition pattern set that remains without being erased by a partial scroll operation (that is, even if it is included in the command list for simultaneous recognition). It is programmed to scroll in only the recognition patterns that are less likely to cause quality.

  Although the industrial applicability of the intelligence system and speech recognition system that are the subject of the present invention is clear, the knowledge itself is classified, organized, and managed, and the knowledge that is managed is automatically applied to new facts (automatic Reasoning), extensive search and search of ideas themselves, combining, refining and materializing ideas, and automatically sharing, disseminating, updating and refining knowledge and research results in human beings, communities, companies and groups Can do.

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)

A way for a computer to interact with a user,
When the computer recognizes the voice or environmental sound of the user (not limited to humans, the same applies hereinafter) as a predetermined recognition pattern, the user variable transitions and the output to the user (text, voice, Multiple information modules that contain information (including information on one or more recognition patterns) for the computer to do (such as images) or both,
The first information module contains information (URI, pointer in memory, structure array index, etc.) for making the computer refer to the second information module,
When the computer refers to the second information module based on the information to be referred to in the first information module,
A method in which a computer performs speech recognition by giving priority to information on a recognition pattern included in a second information module over information on a recognition pattern included in a first information module. The computer moves between information modules (for example, a static file or a dynamically generated file pointed to by the URI) according to the information to be referred to, and information other than the recognition pattern information also includes information of the second information module. 2. The method according to claim 1, wherein priority is given. Until the computer calls a subroutine between information modules (for example, a static file or a dynamically generated file pointed to by a URI) based on the information to be referred to, information other than the recognition pattern information is also the second information. The method according to claim 1, wherein priority is given to information in the information module. Computer
The method according to claim 3, wherein speech recognition is performed using only information of a recognition pattern included in an information module on a chain of call relationships at the time of the subroutine call. Computer
5. The method according to claim 4, wherein speech recognition is performed using only information on a recognition pattern included in an information module at a tip of a call-related chain at that time of the subroutine call. 6. The method according to claim 4, wherein a fixed recognition pattern for returning a calling relationship at the time of the subroutine call is provided regardless of an information module. 6. The method according to claim 4 or 5, wherein a fixed recognition pattern for clearing and returning all call relationships at the time of the subroutine call is provided regardless of the information module. When the recognized pattern does not exist for a predetermined time,
6. A method according to claim 4 or 5 programmed to automatically return the current calling relationship of the subroutine call. Computer
If there are many recognition patterns that must be recognized,
After only a part of it is displayed 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. Computer
The method according to claim 9, wherein only recognition patterns that can be displayed are subjected to speech recognition. Computer
When displaying only a part of 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 confuse in speech recognition. Computer
The range of recognition patterns for voice recognition
The method according to any one of claims 1 to 11, wherein the method can be changed for each situation designated by the user immediately before. Computer
The range of recognition patterns for voice recognition
It changes for every sentence type or case value or case value (deep case, surface case, etc.) that the user has automatically designated or spoken automatically by voice, and changes according to any one of claims 1 to 12. Method. A plurality of the information modules;
Store in relation to the actual latitude, longitude or altitude associated with the information module, or virtual coordinates;
The method according to claim 1, wherein only the information of the recognition pattern included in the information module located within the coordinate range specified by the user can be recognized by voice. A plurality of the information modules;
Store in relation to 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, wherein only the information of the recognition pattern included in the information module located under the theme tag designated by the user can be recognized by voice. The method according to any one of claims 1 to 15, wherein only one output is performed using a random number when the same recognition pattern is associated with a plurality of outputs performed by a computer. Give a given information module a variable with a fixed value,
Storing the variable and the fixed value when the user reads the information module;
The variable and the fixed value can be referred to from the other information module but cannot be changed or deleted even when the other information module is referenced preferentially. The method according to item. Give a given information module a variable that specifies static or global,
Declare and define the variable globally when the user loads the information module,
The method according to any one of claims 1 to 17, wherein the variable 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 referenced preferentially. The method according to any one of claims 1 to 18, wherein the computer is programmed so that each time the set of recognition patterns for voice recognition is changed, the fact is indicated by voice or screen display. The computer accumulates the content that the user uttered and the result recognized by the recognition pattern in order to make speech recognition related to the method,
2. Analyzing or evaluating user's behavior, tendency or performance (excluding the degree of pronunciation improvement. Excluding those excluding those including digestion degree and digestion range of study curriculum and business norm, etc.) 20. The method according to any one of 1 to 19. 21. The program according to any one of claims 1 to 20, wherein a set of users simultaneously accessing the same information module or a set of adjacent information modules of coordinates is programmed so as to perform group communication by text, audio or audio-video. the method of. The reserved word for each focusing on contents (image display, the state of the current global variable, the status text which the information module currently referred to which is referring now) other than an audio | voice is prepared respectively. the method of. Computer program for carrying out the method according to any one of claims 1 to 22. 23. Apparatus for carrying out the method according to any one of claims 1 to 22.

Images