CN101968785A - Logical machine model capable of understanding human natural language - Google Patents

Logical machine model capable of understanding human natural language Download PDF

Info

Publication number
CN101968785A
CN101968785A CN2009100439889A CN200910043988A CN101968785A CN 101968785 A CN101968785 A CN 101968785A CN 2009100439889 A CN2009100439889 A CN 2009100439889A CN 200910043988 A CN200910043988 A CN 200910043988A CN 101968785 A CN101968785 A CN 101968785A
Authority
CN
China
Prior art keywords
natural language
program
predicate
subject
logic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN2009100439889A
Other languages
Chinese (zh)
Inventor
万继华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN2009100439889A priority Critical patent/CN101968785A/en
Publication of CN101968785A publication Critical patent/CN101968785A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention relates to the technical field of a digital computer, in particular provides a logical machine model capable of understanding human natural language. The logical machine model is characterized by using a human natural language as a source language and realizing intelligent control only in a logical true value form which is a 0-1 form corresponding to the semantic property expressing negative and positive in the natural language. The basic design method comprises the following steps of: corresponding a logic equivalence relation between a subject and a predicate and a logic connection relation between atomic clauses to a program control instruction; and then, corresponding the logic connection relation, ect., the subject and predicate concepts and the semantic property of the clauses in a program control instruction, which is a semantic form shown by 0 and 1, to a high level and a low level in a logic gate circuit so that a level signal for controlling and driving a program accurately corresponds to the semantic property expressing the negative and positive in the natural language, and a level signal system for controlling the machine operation is completely identical to a logic semantic system for controlling the natural language, wherein the semantic property means a semantic form of expressing negative and positive with 0 and 1.

Description

Understand the logic machine mould of people's natural language
Technical field
The invention belongs to the digital computer technique field.
Background technology
I oneself the Chinese patent 200710035634..0 of application---with the logic control and the computing method of the mechanical means, 200910107975.3 of 0 and 1 two signal encoding and calculating natural language---system and method for ensuring computer to understand natural languages, 200910107974.9---natural language program, is a main background technology of the present invention.
Patented claim 200710035634..0---with the mechanical means of 0 and 1 two signal encoding and calculating natural language, by the semantic nature of subject-predicate notion in the natural language---negate and sure semantic nature is quantified as 0 and 1 logic true value form, and by the logical relation between the subject-predicate notion is defined as equivalence relation, promptly when the subject-predicate notion is to affirm simultaneously or is negative simultaneously, the logical value of atomic sentence is 1, otherwise is 0.If with " _ " presentation logic Equivalence Operation symbol, then has 0_0=1,0_1=0,1_0=0,1_1=1; Realized the true value calculation of natural language then by the relation of the locial join between the atomic sentence.
The system and method for patented claim 200910107975.3---ensuring computer to understand natural languages, by the unique objective body of being defined as of arbitrary things in the real world itself, and by representing that arbitrary things is the notion of objective body and the unique mapping relations between the objective body, has eliminated the ambiguousness of natural language conceptual understanding.Based on unique form of this conceptual understanding, provided the system and method for ensuring computer to understand natural languages, described system and method can directly be translated as machine instruction with natural language.
The logic control of patented claim 200910107974.9---natural language program and computing method, by 0 and 1 truth expression of expression natural language semantic nature being corresponded to the high-low level form in the logical circuit, various logic connection relation between the natural language statement is converted to program control instruction, and locial join concerned its corresponding logic gates correspondence, realized the mechanical calculations and the control of natural language.
Above-mentioned natural language processing method and system, the logic machine of understanding people's natural language for structure provides the reliable technique basis.
Summary of the invention
The technical problem to be solved in the present invention is according to the method and the system of above-mentioned processing natural language, to construct a kind of new Digital computing machine model.Described new digital computation machine model is the logic machine mould that can understand people's natural language automatically.
The technical scheme that the present invention addresses the above problem is that a kind of system that natural language is converted to translation system and a kind of direct use logic gates control of machine instruction and realizes natural language program is provided.
Of the present invention natural language is converted to the translation system of machine instruction, comprises:
Database is used for storing corresponding to the subject of input natural language and the subject class and the predicate class of predicate;
Instruction set is used for the control and the calculating of natural language program.Comprise: assignment corresponding and call instruction with the subject-predicate connection relation, with the instruction of the corresponding sequential transfer of logical and connection relation, with logic fully and the necessary condition relation corresponding to fully and the necessary condition transfer instruction, with logic together or and XOR concern that corresponding same or selection and XOR select one and instruct or the like.
The character string creating unit is used for generating input of character string according to the natural language of input;
The subject and predicate recognition unit, be used for discerning the subject and the predicate character field of described input of character string, obtain the program code segments of mating respectively by searching database, and when program is carried out, subject and predicate character field are converted to corresponding program code segments with described subject and predicate character field.
Described subject character field and/or predicate character field comprise one or more attributes, the adverbial modifier and/or complement respectively, comprise in the described database that pairing class of attribute, the adverbial modifier and complement or code are for section.Thereby also comprise in the described subject and predicate recognition unit:
The parameter recognition subelement is used for discerning attribute, the adverbial modifier and/or the complement of described subject and predicate character field.
Parameter is handled subelement, be used for by searching database obtain with the value of attribute, the adverbial modifier and/or the complement of described attribute, the adverbial modifier and/or complement coupling or code for section, and to use the pairing value of described attribute, the adverbial modifier and/or complement or code be corresponding parameter assignment in described subject and/or the predicate for section;
Crucial character/word recognition unit, be used for discerning the crucial character/word of described input of character string presentation logic connection relation, obtain corresponding program control instruction by the search instruction collection, and the crucial character/word of presentation logic connection relation is converted to corresponding program control instruction;
Logical processing unit, the program control instruction that crucial character/word and crucial character/word mated of the presentation logic connection relation that code segment that subject and predicate notion of being discerned according to described subject and predicate recognition unit and subject and predicate notion are mated and crucial character/word recognition unit are discerned generates complete program file.
The system of direct use logic gates control of the present invention and realization natural language program comprises:
The natural language scrambler is used for the subject of input natural language and the semantic nature volume of predicate character field are binary code.Described natural language scrambler is that the subject and the predicate character field that input are included negative keyword/speech such as " non-, or not do not have, do not have " in the natural language are encoded to 0, otherwise is encoded to 1 logical circuit.
The natural language code translator is used for the binary code that obtains in the subject of natural language and predicate character field and the logical operation process thereof is translated into the control or the high and low level of driver.Described natural language scrambler is a logical process of the binary code of the expression semantic nature that produces in subject and predicate character field and the logic control process being changed or is defaulted as high and low level.
The natural language controlling device is used for the calculating and the control of natural language program.Described natural language controlling device concerns that by the locial join in the natural language pairing logic gates combines.Promptly by not gate, equivalent door, with door, with or 7 kinds at door, XOR gate, abundant Yun Hanmen, necessary Yun Hanmen etc. concern that with locial join in the natural language system corresponding gate circuit combines.
Data distributor is used for distributing the multinomial data of selecting and selecting a program.Described data distributor is distribution and processing selecting and selects the logical circuit of a compound statement two or more data item in one's power.
Data selector is used for selecting and selecting the data selection of a program.Described data selector is to select and selecting and select wherein one or multinomial logical circuit in a compound statement two or more data item in one's power.
Digital comparator is used for fully and the prerequisite of necessary condition transfer instruction compares.Described digital comparator at realization prerequisite numeric ratio fully and in the necessary condition transfer instruction and determines whether to realize the logical circuit that shifts.
Subject in the natural language of the present invention and predicate and all be character field or the code segment that has the binary code corresponding with its semantic nature by statement or program that subject and predicate are formed, and described binary code is corresponding one by one with high and low level in the driver, so the circuit structure of natural language controlling device of the present invention and relative scrambler, code translator, data distributor, data selector, digital comparator all is a simple and direct.In one's power Digital Logic relation and logical operation program comprise, logic NOT relation and operation program thereof, logically equivalent relation and operation program thereof, logical and relation and operation program thereof, logic with or relation and operation program, logic XOR relation and operation program thereof, logic fully contain relation and operation program thereof, logic concerns and operation program necessary the implication.Represent that the binary code in these logical relations and the operation program and the structural relation of high and low level are simple and clear.Particularly, if with " " presentation logic inverse symbol, then has 0=1 ,-1=0; If with " _ " presentation logic Equivalence Operation symbol, then has 0_0=1,0_1=0,1_0=0,1_1=1; If with “ ﹠amp; " presentation logic AND operator number, then have 0﹠amp; 0=0,0﹠amp; 1=0,1﹠amp; 0=0,1﹠amp; 1=1; If with the exclusive disjunction symbol, then have 0+0=0,0+1=1,1+0=1,1+1=1 with "+" presentation logic; If with Presentation logic XOR symbol then has
Figure B2009100439889D0000032
If with the abundant subsume symbol of " → " presentation logic, then has 0 → 0=1,0 → 1=1,1 → 0=0,1 → 1=1; If, then have 0 ← 0=1,0 ← 1=0,1 ← 0=1,1 ← 1=1 with the necessary subsume symbol of " ← " presentation logic.
Especially, above-mentioned all logical operation programs all are directly to be realized synchronously when carrying out corresponding control programs by its pairing gate circuit.When assignment that realizes the subject-predicate connection relation and call instruction, realize Equivalence Operation synchronously by the pairing level signal of logically equivalent gate circuit; When instructing with the sequential transfer of connection relation, realization realizes synchronously and computing by the pairing level signal of logically equivalent gate circuit; When realizing the same or selection instruction of same or connection relation, realize same exclusive disjunction synchronously with the pairing level signal of OR circuit by logic; When realizing the same of XOR connection relation or select an instruction, realize XOR synchronously by the pairing level signal of logical difference OR circuit; When realizing the adequate condition transfer instruction of fully accumulateing the letter connection relation, fully accumulate the synchronous realization of the pairing level signal of letter gate circuit and fully accumulate the letter computing by logic; When realizing the necessary condition transfer instruction that necessity is accumulate the letter connection relation, accumulate the synchronous realization of the pairing level signal of letter gate circuit and fully accumulate the letter computing by logic necessity.This is the technological core of logic machine of the present invention and energy intelligence form.
The system of direct use logic gates control of the present invention and realization natural language program also comprises:
High-low level in semantic nature in the natural language and the logic gates corresponding: represent that with logical one natural language notion and statement are sure semantic nature, sure semantic nature is corresponding to the high level in the logic gates.Represent natural language notion and the semantic nature of statement for negating with logical zero, negative semantic nature is corresponding to the low level in the logic gates.
Logical connective is corresponding with program control instruction: the symbol that connects subject and predicate has three kinds of forms, respectively corresponding three kinds of steering orders, if do to connect then corresponding to logic instruction with symbol " _ ", if with symbol "=" do to connect then corresponding to assignment directive, if do to connect then corresponding to calling and link order with symbol " "; The connective of logical and relation, as and, again, also and and, wait then, instruct corresponding to sequential transfer; The connective of logic adequate condition relation, if as ... so, because ... so so, therefore, must wait, corresponding to the adequate condition transfer instruction; The connective of logic necessary condition relation, as have only ... ability, ability etc. are corresponding to the necessary condition transfer instruction; Logic with or the connective of relation, as or, may wait, corresponding to or selection instruction, described logic with or selection instruction be or the options of relation in select one or multi-mode operation; The connective of presentation logic XOR relation, as or, select an instruction corresponding to XOR, described logic XOR select an instruction be or the options of relation in select wherein operation;
Logical connective is corresponding with logic gates: the non-connective of presentation logic is corresponding to the logic inverter circuit, that the non-crucial character/word of presentation logic has is non-, or not do not have, do not have or the like, the logic NOT operation relation uses the control of logic inverter circuit.If with " " presentation logic inverse symbol, then has 0=1,1=0; The junction symbol of presentation logic equivalence or connective are corresponding to the logically equivalent gate circuit, the junction symbol and the connective of presentation logic equivalence have _ ,=, and and if only if, equal or the like, if connect the junction symbol of subject-predicate notion with " _ " expression, then has 0_0=1,0_1=0,1_0=0,1_1=1; Presentation logic and connective corresponding to the logical AND gate circuit, the crucial character/word of presentation logic and relation have and, again, also and and, wait then, logic and operation relation is used the control of logical AND gate circuit.If with “ ﹠amp; " presentation logic AND operator number, then have 0﹠amp; 0=0,0﹠amp; 1=0,1﹠amp; 0=0,1﹠amp; 1=1; Presentation logic with or connective corresponding to the same OR circuit of logic, presentation logic with or the crucial character/word of relation has or, may wait, logic uses logic to control with OR circuit with exclusive disjunction relation.If with the exclusive disjunction symbol, then have 0+0=0,0+1=1,1+0=1,1+1=1 with "+" presentation logic.The connective of presentation logic XOR is corresponding to the logical difference OR circuit, the crucial character/word of presentation logic XOR relation have otherwise etc., logical difference exclusive disjunction relation is used the control of logical difference OR circuit.If with Presentation logic XOR symbol then has
Figure B2009100439889D0000042
Figure B2009100439889D0000043
The connective that presentation logic fully contains is corresponding to the abundant IF-THEN gate circuit of logic, if fully containing the crucial character/word of relation, presentation logic has ... so, because ... so so, therefore, inevitable or the like, the abundant subsume relation of logic is used the abundant IF-THEN gate circuit control of logic.If with the abundant subsume symbol of " → " presentation logic, then has 0 → 0=1,0 → 1=1,1 → 0=0,1 → 1=1; The necessary connective that contains of presentation logic is corresponding to the necessary IF-THEN gate circuit of logic, and presentation logic is necessary, and to contain the crucial character/word of relation capable, just or the like, and the necessary subsume relation of logic is used the necessary IF-THEN gate circuit control of logic.If, then have 0 ← 0=1,0 ← 1=0,1 ← 0=1,1 ← 1=1 with the necessary subsume symbol of " ← " presentation logic.
Logic judgment unit, the logical symbol and the connective that are used for the semantic nature (0 or 1) of fetch program file expression subject-predicate notion and statement, and make which kind of gate circuit of use according to the connection relation between logical semantics symbol that is read and the symbol and control and the judgement of mating which kind of instruction.If the program that is read is the subject-predicate connection relation, then use equivalent gate circuit control; If the program that is read is and connection relation then to use AND circuit control; If the program that is read is same or connection relation, then uses with OR circuit and control; If the program that is read is the XOR connection relation, then use NOR gate circuit control; If the program that is read is the adequate condition connection relation, then use abundant IF-THEN gate circuit control; If the program that is read is the necessary condition connection relation, then use necessary IF-THEN gate circuit control.
Temporary storage cell is used for storing the rreturn value of input file and file implementation or the information of the interim preservation of needs;
Program execution unit is used for reading and carrying out the program code of temporary storage cell.Particularly, program execution unit reads the program control instruction that has limit priority in the temporary storage cell earlier, and carries out the program code at these steering order two ends, and the result that will carry out stores in the temporary storage cell then.Program execution unit is carried out aforesaid operations repeatedly, and all program codes of the program file in temporary storage cell are finished.
Description of drawings
The invention will be further described below in conjunction with drawings and Examples.
Accompanying drawing is the logic machine mould synoptic diagram of the people's of understanding natural language of the present invention.
Embodiment
Shown in the accompanying drawing, be the logic machine mould synoptic diagram of the people's of understanding natural language of the present invention.This model mainly comprises following assembly and system: input file 11, language translation system 12, program control system 13, data-storage system 14, data management system 15, output 16.
In the present embodiment, what input file 11 was imported is natural language documents, in the described natural language documents, has used the unit separation symbol of different priorities, and the unit separation symbol provides discernible logical condition for computing and the control that realizes natural language.Wherein use underscore " _ " to separate the subject-predicate notion, use comma as first separator, " as second separator separate atomic sentence, with period ". " as the 3rd separator separate molecusar statement, use branch "; " as the 4th separator separate part statement before and after the reasoning, with fullstop "." separate the reasoning paragraph as the 5th separator.The priority of separator is successively decreased to the 5th separator by first separator.
In the present embodiment, subject and predicate recognition unit, crucial character/word recognition unit and Logical processing unit that language translation system 12 uses in the described system, at first discern the crucial character/word of the negative semantic nature of expression in subject and predicate field and subject and the predicate field, and the crucial words of the negative semantic nature of expression is subject and predicate code field in root a tree name subject and the predicate field.The coding 0 of crucial character/word such as " non-", " no ", " nothing ", " not having " is arranged in subject and/or the predicate field, otherwise encode 1.Discern the subject and predicate notion then and connect the subject and predicate notion and the logical connective of statement, and to generate complete machine instruction sequence according to the program control instruction that code segment and logical connective mated that the subject and predicate notion is mated be program file.
In the present embodiment, program control system 13 is by reading from left to right and execution, makes control assembly always be on any one state on limited the internal state of programmed instruction defined, and changes state according to the instruction of reading in successively.Control device is wherein operated on the framework of discrete time.On given arbitrarily time point, control assembly is on certain specific internal state, and which internal state next timing control component can appear on, by the locial join relation decision of next unit and this unit of connection.From a time interval to the transfer process in the next time interval, control system 13 can produce output or change the information content in the interim storage space.
In this example, logical operation in all control programs all is to realize synchronously by the control of the logic gates corresponding with it and operating process, promptly when carrying out each steering order by logic gates, simultaneously Bao Han one by the pairing logical operation of the level state in this logic gates, the pairing truth symbol of semantic nature of subject-predicate notion in the described steering order or statement is exactly the level signal that is used for controlling the logic gates of this program.The logically equivalent computing of wherein having used in assignment between the subject-predicate unit of logically equivalent gate control or the call instruction Bao Han, the logic and operation that used in the sequential transfer instruction between the statement of logical AND gate control Bao Han, the abundant subsume of logic of having used in the adequate condition transfer instruction between the statement of the abundant IF-THEN gate control of logic Bao Han, the necessary subsume of logic of having used in the necessary condition transfer instruction between the statement of the necessary IF-THEN gate control of logic Bao Han, use logic with or the statement of gate control between same or selection instruction in Bao Han the same exclusive disjunction of logic, use XOR between the statement of the logic XOR control logical difference exclusive disjunction of having selected in the instruction Bao Han.
In this example, described logic linker is meant that the program between the subject-predicate connects.Program between the subject-predicate connects corresponding to the subject-predicate connection relation in the natural language, the pairing connection symbol of subject-predicate connection relation has underscore " _ ", equal sign "=" and period " ", and wherein underscore " _ " counterlogic connection relation, the corresponding assignment directive of period " ", period " " are corresponding to calling and link order.The subject-predicate linker uses the control of logically equivalent gate circuit; The control of described logical and is sequential transfer control, corresponding in the natural language and connection relation, with the pairing crucial words of connection relation be and, again, also and and, wait then.Especially, if do not have connective between the statement of natural language, then acquiescence is used the statement at these two ends of logical and composition of relations.The sequential transfer program of logical and relation is used the control of logical AND gate circuit; Described conditional transfer control, comprise that the control of logic adequate condition and logic necessary condition is that adequate condition and necessary condition shift control, the control of logic adequate condition is corresponding to the adequate condition connection relation in the natural language, the pairing crucial words of adequate condition connection relation be if ... so, because ... so the branching program of logic adequate condition relation uses the abundant IF-THEN gate circuit control of logic so therefore, must wait.And the adequate condition of calculating and determining whether to realize to shift by comparator circuit.The control of logic necessary condition is corresponding to the necessary condition connection relation in the natural language, and the pairing crucial words of necessary condition connection relation is to have only ... ability, ability etc., the branching program of logic necessary condition relation use the necessary IF-THEN gate circuit of logic to control.And the necessary condition of calculating and determining whether to realize to shift by comparer of the present invention: described logic is selected control, is a kind of non-deterministic behavior control.Comprise logic with or selection and logic XOR select a control.Logic with or select control corresponding to the logic in the natural language with or connection relation, with or the pairing crucial words of connection relation is or, may wait, logic with or the option program of relation use logic to control with OR circuit.And select one or more or whole in the probable behavior set by selector switch of the present invention.The logic XOR selects control corresponding to the logic XOR connection relation in the natural language, the pairing crucial words of XOR connection relation be or, the option program of logic XOR relation uses the control of logical difference OR circuit.And select and realize a kind of in two kinds of probable behaviors by selector switch of the present invention.
In this example, data-storage system 14 comprises the temporary storage cell in database and the internal memory.Database is used for storing subject class and the predicate class corresponding to the subject and the predicate of input of character string; Temporary storage cell is used for storing the program code of input file and the rreturn value in program control instruction and the program process and maybe needs the temporary information preserved.
In this example, data management part 15 is used for distributing the storage space with the total data or the information of supervisory routine file, database and temporary storage cell.
In this example, output 16, when program execution unit is finished, the output execution result.
The above only for the preferable embodiment of the present invention, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses, and variation that can realize easily or replacement all should be encompassed within protection scope of the present invention.

Claims (4)

1. logic machine mould of understanding people's natural language, it is characterized in that it is a source language with people's natural language, and only with representing negative and the sure pairing logic true value form of semantic nature in the natural language---0 and 1 form realizes intelligent control.Its basic design method is that the locial join relation between relation of the logically equivalent between the subject-predicate and the atomic sentence is corresponded to program control instruction, be the subject-predicate notion in the program control instruction and the semantic nature of statement then with locial join relation---correspond to high-low level in the logic gates with 0 and the 1 negative and sure semantic form of representing, make expression in level signal and the natural language of control and driver negate and sure semantic nature accurately corresponding, make that also the level signal system that controls machine run and the logical semantics system that controls natural language are same fully.
2. according to right 1 described method, it is characterized in that, the invention provides the translation system that natural language is converted to machine instruction, comprising:
Database is used for storing corresponding to the subject of input natural language and the subject class and the predicate class of predicate;
Instruction set is used for the control and the calculating of natural language program.Comprise: assignment corresponding and call instruction with the subject-predicate connection relation, with the instruction of the corresponding sequential transfer of logical and connection relation, with logic fully and the necessary condition relation corresponding to fully and the necessary condition transfer instruction, with logic together or and XOR concern that corresponding same or selection and XOR select one and instruct or the like.
The character string creating unit is used for generating input of character string according to the natural language of input;
The subject and predicate recognition unit, be used for discerning the subject and the predicate character field of described input of character string, obtain the program code segments of mating respectively by searching database, and when program is carried out, subject and predicate character field are converted to corresponding program code segments with described subject and predicate character field.
Described subject character field and/or predicate character field comprise one or more attributes, the adverbial modifier and/or complement respectively, comprise in the described database that pairing class of attribute, the adverbial modifier and complement or code are for section.Thereby also comprise in the described subject and predicate recognition unit:
The parameter recognition subelement is used for discerning attribute, the adverbial modifier and/or the complement of described subject and predicate character field.
Parameter is handled subelement, be used for obtaining value or code segment with attribute, the adverbial modifier and/or the complement of described attribute, the adverbial modifier and/or complement coupling, and to use pairing value of described attribute, the adverbial modifier and/or complement or code segment be corresponding parameter assignment in described subject and/or the predicate by searching database;
Crucial character/word recognition unit, be used for discerning the crucial character/word of described input of character string presentation logic connection relation, obtain corresponding program control instruction by the search instruction collection, and the crucial character/word of presentation logic connection relation is converted to corresponding program control instruction;
Logical processing unit, the program control instruction that crucial character/word and crucial character/word mated of the presentation logic connection relation that code segment that subject and predicate notion of being discerned according to described subject and predicate recognition unit and subject and predicate notion are mated and crucial character/word recognition unit are discerned generates complete program file.
3. according to right 1,2 described methods, it is characterized in that the system of direct use logic gates control of the present invention and realization natural language program comprises:
The natural language scrambler is used for the subject of input natural language and the semantic nature volume of predicate character field are binary code.Described natural language scrambler is that the subject and the predicate character field that input are included negative keyword/speech such as " non-, or not do not have, do not have " in the natural language are encoded to 0, otherwise is encoded to 1 logical circuit.
The natural language code translator is used for the binary code that obtains in the subject of natural language and predicate character field and the logical operation process thereof is translated into the control or the high and low level of driver.Described natural language scrambler is a logical process of the binary code of the expression semantic nature that produces in subject and predicate character field and the logic control process being changed or is defaulted as high and low level.
The natural language controlling device is used for the calculating and the control of natural language program.Described natural language controlling device concerns that by the locial join in the natural language pairing logic gates combines.Promptly by not gate, equivalent door, with door, with or 7 kinds at door, XOR gate, abundant Yun Hanmen, necessary Yun Hanmen etc. concern that with locial join in the natural language system corresponding gate circuit combines.
Data distributor is used for distributing the multinomial data of selecting and selecting a program.Described data distributor is distribution and processing selecting and selects the logical circuit of a compound statement two or more data item in one's power.
Data selector is used for selecting and selecting the data selection of a program.Described data selector is to select and selecting and select wherein one or multinomial logical circuit in a compound statement two or more data item in one's power.
Digital comparator is used for fully and the prerequisite of necessary condition transfer instruction compares.Described digital comparator at realization prerequisite numeric ratio fully and in the necessary condition transfer instruction and determines whether to realize the logical circuit that shifts.
4. according to right 1,2,3 described methods, it is characterized in that the system of direct use logic gates control of the present invention and realization natural language program also comprises:
High-low level in semantic nature in the natural language and the logic gates corresponding;
Logical connective is corresponding with program control instruction;
Logical connective is corresponding with logic gates;
Logic judgment unit; The logical symbol and the connective that are used for the semantic nature (0 or 1) of fetch program file expression subject-predicate notion and statement, and make which kind of gate circuit of use according to the connection relation between logical semantics symbol that is read and the symbol and control and the judgement of mating which kind of instruction.If the program that is read is the subject-predicate connection relation, then use equivalent gate circuit control; If the program that is read is and connection relation then to use AND circuit control; If the program that is read is same or connection relation, then uses with OR circuit and control; If the program that is read is the XOR connection relation, then use NOR gate circuit control; If the program that is read is the adequate condition connection relation, then use abundant IF-THEN gate circuit control; If the program that is read is the necessary condition connection relation, then use necessary IF-THEN gate circuit control.
Temporary storage cell is used for storing the rreturn value of input file and file implementation or the information of the interim preservation of needs;
Program execution unit is used for reading and carrying out the program code of temporary storage cell.Particularly, program execution unit reads the program control instruction that has limit priority in the temporary storage cell earlier, and carries out the program code at these steering order two ends, and the result that will carry out stores in the temporary storage cell then.Program execution unit is carried out aforesaid operations repeatedly, and all program codes of the program file in temporary storage cell are finished.
CN2009100439889A 2009-07-28 2009-07-28 Logical machine model capable of understanding human natural language Pending CN101968785A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2009100439889A CN101968785A (en) 2009-07-28 2009-07-28 Logical machine model capable of understanding human natural language

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2009100439889A CN101968785A (en) 2009-07-28 2009-07-28 Logical machine model capable of understanding human natural language

Publications (1)

Publication Number Publication Date
CN101968785A true CN101968785A (en) 2011-02-09

Family

ID=43547944

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2009100439889A Pending CN101968785A (en) 2009-07-28 2009-07-28 Logical machine model capable of understanding human natural language

Country Status (1)

Country Link
CN (1) CN101968785A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102707948A (en) * 2012-04-26 2012-10-03 华亚微电子(上海)有限公司 Source code generation method
CN103207771A (en) * 2013-03-19 2013-07-17 浙江中控研究院有限公司 IP (Intelligent property) core of PLC (programmable logic controller) program performer
CN103617159A (en) * 2012-12-07 2014-03-05 万继华 Method for translating natural languages into computer language, semantic analyzer and human-machine conversation system
CN104572801A (en) * 2013-10-29 2015-04-29 百旭科技有限公司 Semantic business intelligence system
CN105264518A (en) * 2013-02-28 2016-01-20 株式会社东芝 Data processing device and method for constructing story model

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102707948A (en) * 2012-04-26 2012-10-03 华亚微电子(上海)有限公司 Source code generation method
CN102707948B (en) * 2012-04-26 2014-11-26 华亚微电子(上海)有限公司 Source code generation method
CN103617159A (en) * 2012-12-07 2014-03-05 万继华 Method for translating natural languages into computer language, semantic analyzer and human-machine conversation system
WO2014086101A1 (en) * 2012-12-07 2014-06-12 Wan Jihua Method for translating natural language into computer language, semantic analyzer and human-computer dialogue system
CN103617159B (en) * 2012-12-07 2016-10-12 万继华 Natural language translation is become the method for computer language, semantic analyzer and interactive system
CN105264518A (en) * 2013-02-28 2016-01-20 株式会社东芝 Data processing device and method for constructing story model
CN105264518B (en) * 2013-02-28 2017-12-01 株式会社东芝 Data processing equipment and story model building method
US9904677B2 (en) 2013-02-28 2018-02-27 Kabushiki Kaisha Toshiba Data processing device for contextual analysis and method for constructing script model
CN103207771A (en) * 2013-03-19 2013-07-17 浙江中控研究院有限公司 IP (Intelligent property) core of PLC (programmable logic controller) program performer
CN103207771B (en) * 2013-03-19 2015-10-07 浙江中控研究院有限公司 A kind of PLC program actuator IP kernel
CN104572801A (en) * 2013-10-29 2015-04-29 百旭科技有限公司 Semantic business intelligence system

Similar Documents

Publication Publication Date Title
Li et al. Pretrained language models for text generation: A survey
CN103617159A (en) Method for translating natural languages into computer language, semantic analyzer and human-machine conversation system
CN101930428A (en) System and method for ensuring computer to understand natural languages
CN103547998A (en) Method and apparatus for compiling regular expressions
CN101968785A (en) Logical machine model capable of understanding human natural language
CN113641830A (en) Model pre-training method and device, electronic equipment and storage medium
CN103942081A (en) Method for generating IL instruction lists of PLC ladder diagrams
CN116126304B (en) XML-based extended Lustre code generation method
Lai Event extraction: A survey
He et al. Modeling grammatical evolution by automaton
CN115879450B (en) Gradual text generation method, system, computer equipment and storage medium
CN111967265A (en) Chinese word segmentation and entity identification combined learning method capable of automatically generating data set
CN115455937A (en) Negative analysis method based on syntactic structure and comparative learning
CN114116779A (en) Deep learning-based power grid regulation and control field information retrieval method, system and medium
CN114860869A (en) Controllable universal dialogue model with generalized intentions
CN115437626A (en) OCL statement automatic generation method and device based on natural language
CN111680523B (en) Man-machine collaborative translation system and method based on context semantic comparison
Dorna et al. Efficient implementation of a semantic-based transfer approach
CN115345153A (en) Natural language generation method based on concept network
CN114201957A (en) Text emotion analysis method and device and computer readable storage medium
Vacareanu et al. From examples to rules: Neural guided rule synthesis for information extraction
CN101931394A (en) Logic control method of natural language program and computing method thereof
Drexler QNRs: Toward language for intelligent machines
CN117573096B (en) Intelligent code completion method integrating abstract syntax tree structure information
Iana et al. NewsRecLib: A PyTorch-Lightning library for neural news recommendation

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20110209