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 (1.1.1, 1.1.2,1.1.3) for presenting natural language text to said system; d) a text parser (3.1.2) for partitioning said text into a sequence of sequences of strings of characters or pretokens; e) a lexicon (3.2.0) 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 (3.2.0); g) a lexical insertion processor (3.2.1.3) for inserting terms into the lexicon (3.2.0) 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 (3.2.1.4) by which refined lexical types may be reassigned to tokens depending on syntactic context; j) a type reduction matrix; k) a term reduction processor (3.2.2.2) which uses said type reduction matrix to determine proper syntactic dependencies between tokens in a sentence; 1) a term inversion processor (3.2.2.3) 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 (3.2.3) 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 (3.3.1) 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 (3.3.2) for associating appropriate internal formal models with terms in the semantic tensor algebra; t) a formal interpretation processor (3.3.3) for transforming terms in the syntactic algebra into equivalent expressions in an internal formal language; u) an external representation processor (3.4.1) for associating external operational environments with internal formal models; v) an external interpretation processor (3.4.2) for translating expressions in an internal formal language into equivalent formal expressions executable into appropriate external operational environments. Figure 2
展开▼