Computer system with natural language to machine language translator
First Claim
1. A natural language processing apparatus for translating natural language into a formal language executable on a programmable device, said system comprising,a) memory for storing data;
- b) a data processor;
c) an input device for presenting natural language text to said system;
d) a text parser for partitioning said text into a sequence of sequences of strings of characters or pretokens;
e) a lexicon for storing lexical terms as token associated with lexical type and reference data;
f) a lexical type assignment process for assigning lexical types to pretokens by comparison to terms in the lexicon;
g) a lexical insertion processor for inserting terms into the lexicon under specific control;
h) a control processor for invoking lexical insertions under the condition that a pretoken is not recognized as a lexical token;
i) a type contextualization processor by which refined lexical types may be reassigned to tokens depending on syntactic context;
j) a type reduction matrix;
k) a term reduction processor which uses said type reduction matrix to determine proper syntactic dependencies between tokens in a sentence;
l) a term inversion processor for constructing chains of syntactic dependencies among lexical terms in an expression and for determining proper dependencies between those chains;
m) a syntactic tree generation processor for constructing syntactic trees representing the syntactic structure of each expression processed by the processors;
n) a syntactic algebra comprising syntactic terms formally representing processed expressions;
o) a syntactic representation processor for constructing syntactic terms to represent formal syntactic structures of processed expressions;
p) a semantic algebra comprising semantic objects as formal references of appropriate terms in the syntactic algebra;
q) a semantic representation processor for associating internal semantic object references with terms in the syntactic algebra;
r) a semantic tensor algebra comprising correlated pairs of syntactic algebraic terms and their semantic object representations;
s) a formal representation processor for associating appropriate internal formal models with terms in the semantic tensor algebra;
t) a formal interpretation processor for transforming terms in the syntactic algebra into equivalent expressions in an internal formal language;
u) an external representation processor for associating external operational environments with internal formal models;
v) an external interpretation processor for translating expressions in an internal formal language into equivalent formal expressions executable into appropriate external operational environments.
6 Assignments
0 Petitions
Accused Products
Abstract
Presented is a system and method for converting or translating expressions in a natural language such as English into machine executable expressions in a formal language. This translation enables a transformation from the syntactic structures of a natural language into effective algebraic forms for further exact processing. The invention utilizes algorithms employing a reduction of sequences of terms defined over an extensible lexicon into formal syntactic and semantic structures. This term reduction incorporates both syntactic type and semantic context to achieve an effective formal representation and interpretation of the meaning conveyed by any natural language expression.
163 Citations
9 Claims
-
1. A natural language processing apparatus for translating natural language into a formal language executable on a programmable device, said system comprising,
a) memory for storing data; -
b) a data processor; c) an input device for presenting natural language text to said system; d) a text parser for partitioning said text into a sequence of sequences of strings of characters or pretokens; e) a lexicon for storing lexical terms as token associated with lexical type and reference data; f) a lexical type assignment process for assigning lexical types to pretokens by comparison to terms in the lexicon; g) a lexical insertion processor for inserting terms into the lexicon under specific control; h) a control processor for invoking lexical insertions under the condition that a pretoken is not recognized as a lexical token; i) a type contextualization processor by which refined lexical types may be reassigned to tokens depending on syntactic context; j) a type reduction matrix; k) a term reduction processor which uses said type reduction matrix to determine proper syntactic dependencies between tokens in a sentence; l) a term inversion processor for constructing chains of syntactic dependencies among lexical terms in an expression and for determining proper dependencies between those chains; m) a syntactic tree generation processor for constructing syntactic trees representing the syntactic structure of each expression processed by the processors; n) a syntactic algebra comprising syntactic terms formally representing processed expressions; o) a syntactic representation processor for constructing syntactic terms to represent formal syntactic structures of processed expressions; p) a semantic algebra comprising semantic objects as formal references of appropriate terms in the syntactic algebra; q) a semantic representation processor for associating internal semantic object references with terms in the syntactic algebra; r) a semantic tensor algebra comprising correlated pairs of syntactic algebraic terms and their semantic object representations; s) a formal representation processor for associating appropriate internal formal models with terms in the semantic tensor algebra; t) a formal interpretation processor for transforming terms in the syntactic algebra into equivalent expressions in an internal formal language; u) an external representation processor for associating external operational environments with internal formal models; v) an external interpretation processor for translating expressions in an internal formal language into equivalent formal expressions executable into appropriate external operational environments.
-
-
2. A method for translating natural language into a formal language executable on a programmable device, said method comprising the steps of:
-
a) receiving natural language text; b) parsing said text into a sequences of sequences of pretokens; c) recognizing pretokens as tokens in the lexicon; b) parsing said text into a sequence of sequences of pretokens; c) recognizing pretokens as tokens in the lexicon; d) inserting new terms into the lexicon under specific control; e) assigning types to pretokens to form lexical terms for further syntactic processing; f) reassigning lexical types to tokens based on syntactic context; g) correlating terms occurring in a set of expressions in order to replace indirect references by appropriate direct references; h) establishing syntactic dependencies between terms in an expression through a process of term reduction; i) constructing chains of syntactic dependencies and determining dependencies between those chains, by a process of term inversion; j) generating syntactic trees which represent the syntactic structures of processed expressions; k) representing said processed expressions as terms in a syntactic algebra; l) representing terms in the syntactic algebra as objects in a semantic algebra; m) combing objects in the semantic algebra by means of a semantic product on pairs of semantic objects to form more complex semantic objects; n) representing correlated syntactic algebraic terms and semantic objects as terms in a semantic tensor algebra; o) representing terms in the semantic tensor algebra as internal formal models; p) transforming terms in the syntactic algebra into equivalent expressions in an internal formal language, q) associating external operation environments with internal formal models; and p) translating expressions of the internal formal language into equivalent formal expressions executable in an external operational environment.
-
-
3. In a natural language processing apparatus for translating natural language into a formal language executable on a programmable device, wherein said apparatus includes processing means;
- input means for presenting natural language text to said system;
a lexicon of terms;
a text parser which partitions expressions into sequences of sequences of pretokens;a type assignment process for assigning syntactic types to pretokens by comparison to lexical terms in the lexicon and determining their status as tokens; a type contextualization process for reassigning lexical types to tokens based on syntactic context, a term correlation process for correlating terms occurring in a set of expressions in order to replace indirect references by direct references, said system comprising a) a type reduction matrix; b) a term reduction processor that uses the type reduction matrix to determine proper syntactic dependencies between tokens in an expression; c) a term inversion processor for constructing chains of syntactic dependencies among lexical terms in an expression and for determining the proper dependencies between those chains; d) a syntactic tree generation processor for constructing syntactic trees representing syntactic structures of expressions; e) a syntactic algebra comprising syntactic terms formally representing processed expressions; f) a syntactic representation processor for constructing syntactic algebraic terms representing processed expressions; g) a semantic object algebra comprising semantic objects as internal references of terms in the syntactic algebra; h) a semantic product processor by which objects in the in the semantic object algebra are combined to form more complex semantic objects; i) a semantic representation processor by which internal semantic algebraic objects representing terms in the syntactic algebra are constructed; j) a semantic tensor algebra comprising correlated syntactic terms and semantic objects; k) a formal representation processor by which internal formal models are associated with terms in the semantic tensor algebra; l) a formal interpretation processor by which syntactic algebraic terms are transformed into equivalent expressions in an internal formal language; m) a semantic product processor by which objects in semantic algebra are combined to form more complex semantic objects; n) an external representation processor by which external operational environments are associated with internal formal models; and o) an external interpretation processor by which expressions in an internal formal language are translated into equivalent formal expressions executable in an external environment.
- input means for presenting natural language text to said system;
-
4. A software system for translating natural language into a formal language executable on a programmable device,
wherein said system includes processing means; - input means for presenting natural language text to said system;
a lexicon of terms;
a text parser which partitions natural language texts into sequences of sequences of pretokens;
a type assignment process for assigning syntactic types to pretokens by comparison to lexical terms in the lexicon and determining their status as tokens;a type contextualization process for reassigning lexical types to tokens based on syntactic context; a term correlation process for correlating terms occurring in a set of expressions in order to replace indirect references by direct references, a) a type reduction matrix; b) a term reduction process which uses the reduction matrix to determine proper syntactic dependencies between tokens in an expression; c) a term inversion process for constructing chains of syntactic dependencies among lexical terms in an expression and for determining the proper dependencies between those chains; d) a syntactic tree generation process by which syntactic trees representing syntactic structures of expressions are constructed; e) a syntactic algebra comprising syntactic terms formally representing processed expressions; f) a syntactic representation process by which syntactic algebraic terms representing processed expressions are constructed; g) a semantic object algebra comprising semantic objects as internal references of term in the syntactic algebra; h) a semantic object algebra comprising semantic objects as formal references of terms in the syntactic algebra; i) a semantic representation process by which internal semantic algebraic objects representing appropriate terms in the syntactic algebra are constructed; j) a semantic product process by which objects in the semantic algebra are combined to form more complex semantic objects; k) a formal representation process by which internal formal models object references are associated with terms in semantic tensor algebra; l) a formal interpretation process by which syntactic algebraic terms are transformed into equivalent expressions in an internal formal language; m) an external representation process by which appropriate external operation environments are associated with internal formal models; and n) an external interpretation process by which expressions in an internal formal language are translated into equivalent formal expressions executable in an external operational environment.
- input means for presenting natural language text to said system;
-
5. A software system for a data processing device used in translating natural language into executable expressions in a formal language,
wherein said data processing device includes a data processor and memory; -
input means for presenting natural language text to said system;
alexicon of terms;
a text parser which partitions natural language texts into sequences of sequences of pretokens;a type assignment processor for assigning syntactic types to pretokens by comparison to lexical terms in the lexicon and determining their status as tokens; a type contextualization processor for reassigning lexical types to tokens based on syntactic context; a term correlation processor for correlating terms occurring in a set of expressions in order to replace indirect references by direct references;
said software system comprising,a) a type reduction matrix for processing said expressions; b) a term reduction processor that uses the type reduction matrix to determine proper syntactic dependencies between tokens in an expression; c) a term inversion processor for constructing chains of syntactic dependencies among lexical terms in an expression and for determining the proper dependencies between those chains; d) a syntactic tree generation processor by which syntactic trees representing syntactic structures of expressions are constructed; e) a syntactic algebra comprising syntactic terms formally representing said processed expressions; f) a syntactic representation processor by means of which syntactic algebraic terms representing processed expressions are constructed; g) a semantic object algebra comprising semantic objects as internal references of terms in the syntactic algebra; h) a semantic representation processor by which internal semantic algebraic objects representing terms in the syntactic algebra are constructed; i) a semantic product processor by which objects in semantic algebra are combined to form more complex semantic objects; j) a formal representation processor by which internal formal models are associated with terms in semantic tensor algebra; k) a formal interpretation processor by which syntactic algebraic terms are transformed into equivalent expressions in an internal formal language; l) an external representation processor by which external operational environments are associated with internal formal models; and m) an external interpretation processor by which expressions in an internal formal language are translated into equivalent formal expressions executable in an external operational environment. - View Dependent Claims (6, 7, 8, 9)
-
Specification