| Title of Invention | "COMPUTER SYSTEM WITH NATURAL LANGUAGE TO MACHINE LANGUAGE TRANSLATOR" |
|---|---|
| Abstract | 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 |
| Full Text | The present invention relates to computer system with natural language to machine language translator. BACKGROUND OF THE INVENTION-. The present invention is directed to a system which translates natural (human) language into an abstract formal language. This formal language is explicitly designed to serve as a universal template for further translations into a comprehensive variety of machine languages which are executable in specific operational environments. Extensive efforts have been made, many articles have been published, and many patents have been issued, all directed toward the goal of providing computers with the capacity to understand natural (human) language sufficiently well to respond reliably and, accurately to directives issued from human users. Many companies and research groups, such as AT&T, IBM, and Microsoft, and an assortment of academic institutions, are presently working on natural language processing (NLP). To date, many different approaches have been tried to provide a system which effectively converts natural language to a formal language for computer applications. One such approach is disclosed in an article published by Microsoft Corporation titled "Microsoft Research: Natural Language Processing Hits High Gear" dated May 3, 2000. The article discloses that Microsoft is heavily focused on a database of logical forms, called MindNet (TM), and the creation of a machine translation application. It is stated that MindNet is an initiative in an area of research called "example-based processing", whereby a computer processes input based on something it has encountered before. The MindNet database is created by storing and weighting the semantic graphs produced during the analysis of a document or collection of documents. The system uses this database to find links in meaning between words within a single language or across languages. These stored relationships among words give the system a basis for "understanding", thereby allowing the system to respond to natural language input. MindNet apparently contains the contents of several dictionaries and an encyclopedia to increase its level of understanding. Another approach is disclosed in Microsoft U.S. Patent No. 5,966,686. This approach provides a rule-based computer system for semantically analyzing natural language sentences. The system first transforms an input sentence into a syntactic parse tree. Semantic analysis then applies three sets of semantic rules to create an initial logical form graph from this tree. Additional rules provide semantically meaningful labels to create additional logical form graph models and to unify redundant elements. The final logical form graph represents the semantic analysis of the input sentence. Yet another, and apparently more common, approach is provided by U.S. Patent No. 5,895,466, wherein a database stores a plurality of answers which are indexed to natural language keys. The natural language device receives a natural language question over the network from a remote device and the question is analyzed using a natural language understanding system. Based on this analysis, the database is then queried and an answer is provided to the remote device. Applicant is aware that various other approaches toward providing a conversion from natural language to some machine language have been tried. However, the prior art has not provided a truly effective conversion system of this sort. SUMMARY OF THE ///KENT/ON: 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. The foregoing features and advantages of the present invention will be apparent from the following more particular description of the invention. The accompanying drawings, listed herein below, are useful in explaining the invention. BRIEF DESCRIPTION OF THE DRA WINGS-. FIG. 1 shows the hardware architecture of a computer system comprising the natural language converter of the present invention; FIG. 2 shows the general process and data flow of the inventive system; FIG. 3 shows a more detailed flow diagram for the inventive system; FIG. 4a shows the results of virtual type assignment applied to a sample text; FIG. 4b shows the results of actual type assignment for the same text; FIG. 5 shows the term reduction sequence for a sample text; FIG. 6a shows the sequence of dependency chains for a sample text; FIG. 6b shows the associated syntactic tree for the same text; and FIG. 7 a shows the schema of structures and maps involved in the external interpretation of a text; FIG. 7b shows this external interpretation schema as controlled by a metasemantic protocol. BRIEF DESCRIPTION OF THE INVENTION-. Refer to FIG. 1 for an overview of the system architecture. As mentioned above, the inventive system, called METASCRIPT (TM), provides a method for translating expressions in a natural language such as English into machine executable expressions. In the embodiment of the system and method to be described, the user inputs text in a natural language through some input device to a known computer system which may comprise a standalone computer system, a local network of computing devices, or a global network such as the Internet, using wired land lines, wireless communication, or some combination thereof, etc. This computer system includes memory for storing data, and a data processor. The text may be entered into the client device or local VDM (Video Display Monitor) (1.1) by any suitable means, such as direct input via keyboard (1.1.1), voice input via speech recognition means (an SR system) (1.1.2), or indirect input via optical scanning (an OCR system) (1.1.3). The natural language text input to the system is passed along the network or local bus (1.3) to a server or local CPU (Central Processing Unit) (1.2) where it is processed in accordance with the inventive method and system. This processed output of the system is then provided to the system for distribution to the original input device (1.1), or to other collateral devices (1.4) which may be one or more digital computers, mobile devices, etc. The inventive system thus comprises a natural language interface to any sufficiently capable digital environment. Refer now to FIG. 2 for an overview of the process and data flow of the inventive system. The invention will be subsequently discussed in more detail herein below. Natural language text input is entered by the user (2.0) into the internal system (2.1) by means of a text processing module (2.1.1) which parses the text. The output of the text processing module comprises a parsed sequence of preexpressions which is entered into the syntactic processing module (2.1.2) which provides syntactic type information, establishes proper syntactic dependencies between terms in expressions, and represents these expressions as complexes in a syntactic algebra. The output of the syntactic processing module, comprising a sequence of these syntactic complexes, is entered into the semantic processing module (2.1.3) in order to achieve a semantic interpretation of the input text. The output of the semantic processing module, comprising a formal interpretation of the input text, is entered into an external system by means of the external processing module (2.2.1), which finally provides a sequence of executable expressions derived from the input text for use in a specific operational environment (2.2.2). As noted above, the means for providing text input to the system, such as through a keyboard, scanner, or speech recognition system, are well known in the art and are commercially available. Another standard component of the present system is a text parser, construed here in an extremely narrow sense as a limited process restricted to partitioning text strings into syntactic subcomponents such as paragraphs, sentences, and words. As such, the text parser discussed herein does not provide further linguistic information such as grammatical types, syntactic dependencies, semantic import, etc. Such limited text parsers are standard components of any natural language processing system, and exceedingly well known in the art. Yet another component in the present system which plays a relatively standard role is the lexicon or "electronic dictionary". In general, lexicons are also well known in the art and are discussed in many patents including U.S. Patent Nos. 5,371,807; 5,724,594; 5,794,050; and 5,966,686. However, the notion and function of "virtual" types, which play a significant syntactic categorization role in the passive specification of lexical terms, and hence strongly contribute to the definition of the particular lexicon used in the inventive system, are not standard, and so require careful description. On the other hand, since text inpxit devices, text parsers, and their operation are so well known, they will not be further described in detail herein. Refer now to FIG. 3, which shows more details of the inventive system. The components, modules, and submodules of the inventive system are enumerated for convenient reference so that the operation and application of the system and method may be described in detail. As mentioned above, natural language text is entered by the user (3.0) into the text input submodule (3.1.1) of the text processing module (3.1) via any suitable means including a keyboard or a speech recognition system. For the purposes of this discussion, the user input signal is simply some linguistic data stream which is digitized into a string of ASCII characters. This ASCII string is the input text. In order to clarify the following discussion, it is helpful to note that any natural language text is typically organized into a sequence of paragraphs, each of which is a sequence of sentences, each of which is a sequence of words, each of which is a sequence of characters (alphanumeric symbols). All of this nested syntactic structure must be taken into account if an effective interpretive analysis is to be achieved. The role of the text parser is to determine and then present these nested sequential structures to the system for further processing. Thus in general, the adequate output of the text parser is a sequence of sequences of sequences of sequences of ASCII characters. This level of generality, however, tends to obscure the basic points of any useful description of the inventive system, so a technical compromise is adopted herein, whereby any text is considered to comprise a sequence of sentences, or more properly, of expressions, each of which comprises a sequence of words. Until recognized by the system as a meaningful unit of linguistic analysis, however, any such word in a text is simply treated as a partitioned substring of the input text string. Thus the proper output of the text parser is considered here to be a sequence of sequences of "pretokens", where a pretoken is a text fragment which is a candidate for a word, i.e. an ASCII (sub)string presented for recognition as a system "token". The system lexicon is a lexicographically ordered list of such tokens (with associated type and reference data), and recognition by the system of a pretoken as an actual token is simply a matter of exact string comparison. Accordingly, the output of the text parser (3.1.2) is a sequence of sequences of pretokens, or sequence of "preexpressions", which is then passed to the type assignment submodule (3.2.1.1) of the type association submodule (3.2.1), where syntactic processing is initiated. Each pretoken is checked against the system lexicon (3.2.0) for its status as a recognized lexical token. If a pretoken is recognized, i.e. if the string comprising that pretoken is included in the lexicon as an actual token (with associated syntactic and semantic data), then it is assigned a lexically associated syntactic type. The system determines at decision node (3.2.1.2) whether all the pretokens from the entered text have been recognized as system tokens. If the determination is negative, then as indicated by the "no" connection to the lexical insertion submoduJe (3.2.1.3), the user is given the option to add the unrecognized pretokens to the system as tokens with associated type and reference data, i.e. to insert new terms into the lexicon, for further processing. On the other hand, if the determination is affirmative, then the resulting sequence of sequences of lexically typed tokens, or sequence of "virtual" expressions, is passed along the "yes" connection to the type contextualization submodule (3.2.1.4). This submodule initiates a second order type assignment which uses the initial (or virtual) lexical type assignments as data for a contextual process which may reassign these initial types depending on the relative syntactic roles of the tokens in the virtual expressions being processed. Upon complete (re)assignment of appropriate types to tokens, each virtual expression is promoted to an "actual" expression, and each token/type pair becomes a fully functional lexical term with associated semantic data. Thus the output of the type association submodule (3.2.1) of the syntactic processing module (3.2) comprises a sequence of (actual) expressions, and is passed to the term correlation submodule (3.2.2.1) of the term resolution module (3.2.2). The output of this submodule is a sequence of sequences of fully correlated lexical terms, which is then entered into the term reduction submodule (3.2.2.2), wherein proper syntactic dependencies between terms in an expression are established by means of a type reduction matrix. The output of this submodule is a sequence of sequences of reduction links, which is entered into the term inversion submodule (3.2.2.3), wherein these reduction links are used to construct syntactic trees, each tree representing a processed expression. The resulting sequence of syntactic trees is passed to the syntactic representation submodule (3.2.3), wherein each expression is then represented as a syntactic complex, i.e. a (usually composite) term in the syntactic algebra. Semantic processing (3.3) is initiated in the semantic representation submodule (3.3.1), wherein the input sequence of syntactic complexes from the syntactic processing module (3.2) is represented as a full semantic complex, i.e. a structure of internal objects in the semantic algebra. This semantic complex is then passed to the formal representation submodule (3.3.2), wherein the input semantic complex is represented as a formal structure adhering to a fundamental transaction paradigm. This formal semantic model is then combined with the sequence of syntactic complexes output from the syntactic processing module to form the input to the formal interpretation submodule (3.3.3), wherein a sequence of formal expressions is constructed as an interpretation of the presented syntactic and semantic data. In addition, the output of the formal representation submodule is passed to the external representation submodule (3.4.1) of the external processing module (3.4), wherein a specific external representation appropriate for the formal semantic data presented is identified. This external representation is combined with the sequence of formal expressions output from the formal interpretation submodule to form the input to the external interpretation submodule (3.4.2), wherein a sequence of executable expressions is constructed accordingly for ultimate processing in the appropriate operational environment (3.5). DETAILED DESCRIPTION OF THE INVENTION-. INTRODUCTION: METASCRJPT is a translation from a natural language into an executable formal language. This translation is essentially a transformation from the syntactic structures of natural language into effective algebraic forms suitable for further processing. The formal semantics which finally determines the ensuing interpretations and executions of these formal expressions in external operational environments is object-oriented. The fundamental algorithm upon which METASCRIPT is based employs a reduction to formal syntactic structures over terms defined in an extensible lexicon. 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. Extensibility of the lexicon under specific user direction provides the capacity for the system to expand its knowledge of vocabulary and usage, and consequently, offers an effective mechanism under user control for establishing definite incremental enhancements to the system's linguistic capabilities, hence substantially increasing the system's familiarity with (and competence in) particular operational environments. Put simply, the system learns as it goes. In addition, any desired level of syntactic disambiguation is attainable by increasing the local dimensionality of the underlying reduction matrix, though this feature is part of the underlying algorithm, and therefore independent of user modulation. It should be noted that METASCRIPT is not a speech recognition system. Instead, it is a fully capable natural language interpreter. Specifically, METASCRIPT translates natural language expressions into expressions in a formal language associated with an abstract network protocol. A more detailed account of this process follows. NOTATION: Standard mathematical notation is used to clarify the presentation of certain technical features of the system. In particular, the following set-theoretical notation appears throughout this discussion: a) &set is a collection of things, called elements. For example, N= {0,1,2,3,...} is the set of natural numbers. Note: In general, a set A is most conveniently determined by some property P of its elements, indicated by use of so-called "set-builder notation" as A = {x \ P(#)} = the set of things x satisfying property P. • b) the expression 'xeA' indicates that the thing x is an element of the set A c) the expression 'AciB' indicates that the set A is a subset of the set B, i.e. that every element of A is an element of B as well d) a map (or function) is a relation between two setsA,B such that each element in A is assigned a unique element in B. The expression '/: A -> 5' indicates that/is a map from the set A to the set B, i.e./assigns a unique element >> -fix)&B to each elementxe.4. The composition of maps f:A-*B and g : B -> C on sets A,B,C Is the map A = g°/: A -+ C defined such that A(x) = g(f(x)) e.C for any x&A. Note: A program is a function which maps input onto output in an effective manner, i.e. by means of a finite, discrete, deterministic procedure; in fact, any process or procedure is effective precisely to the extent that it is executable as ^program of this sort. e) for any sets AjB, the Cartesian product AxB consists of all pairs (xjs) such that x&A and yeB, i.e. f) for any sets A,B the wiion A^JB is the set consisting of all elements x such that xeA or xeB, i.e. Au£ = {x | xeA orxeS}; for any collection C = {Aj \ 0 distinguished subset of AxB which consists of all pairs (xj(x)) for xeA, i.e. ^®/S = { (xj[x)) \ x&A } = the graph off; for an implicit representation, the map subscript may be omitted, i.e. A®B = A h) for any set A, Seq(A) is the set of finite sequences from A, i.e. Seq(A) = {(ao,-.-,an) \n\eA , neN} DjrFJW/77£MVJ: language: a structure over the following components: a) alphabet: a set of basic symbols b) punctuation symbols: a set of basic symbols disjoint from the alphabet c) words: admissible sequences of basic symbols d)punctuations: admissible sequences of punctuation symbols e) expressions: admissible sequences of words and/or punctuations f) sentences: complete expressions g) syntax: a specification of which - sequences of basic symbols are admissible as wordy - sequences of punctuation symbols are admissible as punctuations - sequences of words and/or punctuations are admissible as expressions - expressions are admissible as sentences g) semantics: a scheme of interpretation over words whereby expressions acquire meaning with respect to certain external structures A number of languages enter into this discussion: 1) natural language: any of the human languages in current use, e.g. English, each characterized by an informal, and hence notoriously ambiguous, syntax and semantics 2) formal language: a highly structured language, usually mathematical in origin and use, characterized by a uniquely readable, recursive syntax and an extensional, usually first-order semantics; in short, a language for which the syntax and semantics is effectively unambiguous 3) object language: a formal language which is interpretable relative to a class of extensional structures, i.e. a formal language with an object-oriented semantics 4)protocol language: a formal language which mediates transactions between addressable nodes on a network 5) executable language: a formal, programmable language which encodes instructions directly implementable by a suitably capable machine such as a computer system: the integrated process which manifests METASCRJPT, and which may be implemented as software running on any programmable device string: a sequence of ASCII characters text: a string presented to the system as the fundamental unit of initial input parser, a process which partitions texts into sequences of sequences of substrings preexpression: a sequence of substrings of some text, distinguished as a unit of syntactic processing by the text parser lexicon: a system specific, indexed, lexicographically ordered list of designated strings, called tokens, each of which is associated with certain syntactic and semantic information; in particular, each token is associated with a lexical type, which may be virtual (syntactically ambiguous) or actual syntactically unambiguous); furthermore, each token which is associated with an actual type is also associated with a lexical reference, which provides basic semantic information Note: A single string may serve as a token with multiple entries, associated with a number (including 1) of virtual types and a number of actual types, reflecting that token's multiple syntactic roles, e.g. as a verb and an object, or an object and an adjective, etc. Although there is considerable variability in such syntactic multiplicities among lexical entries, it is still the case that every token is associated with at least one actual type. token: a string recognized by the system in the sense that it is included in the system lexicon type: a syntactic category used to organize semantically similar tokens; there are three sorts: 1) virtual: a lexical type which is ambiguous 2) actual: a lexical type which is not ambiguous 3) reduced: a syntactic type which has specific semantic functionality upon term reduction term: there are six sorts: 1) lexical: a token/type pair in the lexicon with associated reference data 2) reduced: a token/type pair for which the type is reduced 3) syntactic: an element of the syntactic algebra associated with a language 4) semantic: an element of the semantic object algebra associated with a language 5) tensored: an element of the semantic tensor algebra associated with a language 6) formal: an interpretable element of a formal language reference: there are two sorts: 1) internal: an object with which a term is associated, either in the lexicon or in the semantic object algebra 2) external: an object with which an internal semantic object is associated in some operational environment expression: a sequence of tokens sentence: a syntactically correct, semantically complete expression chain: a linearly ordered set of nodes (usually comprising a subset of some tree) tree: a partially ordered set of nodes model: a semantic structure M for & formal language FL consisting of a) a set Dom(M) of individuals (called the "domain" of M) b) a set Rln(M) of relations on Dom(M) c) a set Obj(M) of objects (each object containing elements of Dom(M) as elements; also, there is a mill object OeObj(M) for technical reasons) d) a set Map(M) of functions between objects These individuals, objects, relations, and functions are formal interpretations of corresponding terms in the language FL, and expressions of FL which correctly describe configurations of these various elements which actually obtain in the model are considered to be "true" in the model, or "satisfied" by the model; this satisfaction relation between a model M and an expression denoted as " M |= 9 ", meaning that "M is a model of cp", "M satisfies cp", " true in M", or " operational environment: a dynamic structure E represented as a series of static states Efc (for keN), each of which comprises a model for an executable language EL Throughout this discussion, the terms "internal" and "external" are applied relative to the system itself. Thus any component, module, process, or method which is part of the system is considered to be internal, while any user of the system or operational environment for the system is regarded as being external. This distinction is more logical than physical, since an external operational environment for the system may reside on the same computer system or device which hosts the system. SYSTEM SETS-, The following sets are defined relative to a language L: Sym(L): the set of basic symbols for L, usually including an alphabet and various punctuation symbols Tok(L): the set of lexical tokens for L, i.e. a distinguished subset of Seq(Sym(L)) Ltp(L): the set of lexical types for L Rtp(L): the set of reduced types for L, including a mill type Trm(L): the set of lexical terms for L, i.e. a distinguished subset of Tok(L)xLtp(L) Rdn(L): the set of reduced terms for L, i.e. a distinguished subset of Tok(L)xRtp(L) Ref(L): the domain of lexical references for L Lex(L): the lexicon for L, i.e. a distinguished subset of NxTrm(L)xRef(L) consisting of a lexicographically ordered list of {indexllokenltypelreference} entries Txt(L): the set of texts for L, i.e. a subset of Seq(Sym(L)) determined by user input Prx(L): the set ofpreexpressiom forL, i.e. a subset of jS'eg^e^SymCL))) determined by the parser Exp(L): the set of expressions for L, i.e. a distinguished subset of Seq(Tok(Ly) Snt(L): the set of sentences for L, i.e. a distinguished subset of Exp(L) Tre(L): the set of syntactic trees for L, each having reduced terms from Rdn(L) as nodes Syn(L): the syntactic algebra for L Sem(L): the semantic object algebra for L Tns(L): the semantic tensor algebra for L, viz. Tns(L) = Syn(L)®Sem(L) for a canonical map /: Syn(L) -> Sem(L) Mod(L): the set of internal formal models for L Env(L): the set of external operational environments for L SYSTEM MAPS: The following maps are defined relative to a natural language ML, an associated object language XL, a protocol language PL, and an executable language EL associated with an operational environment E: txtprs : Txt(NL) -» ^e^PrxO^JL)) is the text parser which maps any /ex/ sfr/jj^ s eTxt(NL) onto a sequence ft/Jpns(s)6i$'e strings which are candidates for tokens (including punctuations) as determined by inclusion in the lexicon lextyp : NxTok(NL) -> Typ(NL) is the lexical type assignment such that /exr>-j3(n,a)6Typ(NL) is the lexical type associated in the lexicon with the indexed token (n,a) lexref: Tok(NL)xTyp(NL) -»• Ref(NL) is the lexical reference assignment such that fewe/(a,e)eRef(NL) is the reference associated in the lexicon with the tokenltype pair (a,e)eTok(NL)xTyp(NL) Note: If lexrefla,e) =0 (= null reference) then either (a,e) is not a recognized token/type pair, i.e. there is no entry in the lexicon of the form (n/a/e/r) for any index n, or e is a virtual type; accordingly, the set of lexical terms for NL is defined as Trm(NL) = {(a,e)eTok(NL)xTyp(NL) | /ra-ep(t)eSyn(NL) wit'1 eacn syntactic tree teTre(NL) over the assignment of basic syntactic terms q(d,a) = syntrm(n,d) to nodes (a,d)6t, i.e. the representation synrep = trerep° syntre : Exp(NL) -» Syn(NL) * : Sem(NL)xSem(NL) — > Sem(NL) is the semantic product on semantic objects in the semantic object algebra Sem(NL) such that *(xy) = **J>eSem(NL) is the minimal common upper bound of any pair of objects x,y in the induced class inheritance lattice on Sem(NL), with the second term of the product dominant over the first relative to consistency issues, i.e. y dominant over x in x*y Note: In fact, Sem(NL) is simply the algebraic closure under the semantic product over the kernel Ref(NL) of lexical references associated with the lexical terms of NL by means of the map lexref: Trm(NL) — » Ref(NL), i.e. Sem(NL) is defined by induction on the semantic product as follows: a) identity object: there is an identity element lsSem(NL) b) lexical object: fecre/(a,e)eSem(NL) for any lexical term (a,e)eTrmCNL), i.e. Ref(NL)£Sem(NL) c) composite object: x*ye Sem(NL) for any objects jc,yeSem(NL); x*l = l*x - x for each *eSem(NL) d) completeness: xeSem(NL) iff x is either the identity object or a lexical object, or a composite object generated by a finite sequence of semantic products over a set of lexical objects semrep : Syn(NL) -» Sem(NL) is the semantic representation such that setnrep(q)e Sem(NL) is the semantic reference associated with the syntactic term qeSyn(NL); moreover semrep is the implicit representation in the definition of the semantic tensor algebra Tns(NL) = Syn(NL)®Sem(NL) = Syn(NL)®sm?.epSem(NL) Note: Semantic reference makes contact with lexical reference in that je»H-ep(q(d(e),a)) = /exreXa,e)eRef(NL) for every basic complex q(d(e),a)6Syn(NL) naturally associated (after term reduction: (a,e) -* (a,d(e)) ) with a reduced term (a,d(e))eRdn(NL); moreover, semrep : Syn(NL) -> Sem(NL) is a homomorphism from the syntactic algebra to the semantic object algebra in that a) null -> identity: semrep(Q) = 1 where 0 e Syn(NL) is the null complex and 1 e Sem(NL) is the identity object b) basic -> lexical: jemre/(q(d(e),a)) = /ex?'e/(a,e)eSem(NL) for any lexical term (a,e)eTrm(NL) and associated reduced term (a,d(e))6Rdn(NL), where q(d(e),a) = iSynfov7j(a,d(e))eSyn(NL) is a ios/'c complex c) composite ->• composite: se/weXq[q']) - ie/wre^q)*je;7?reXq')eSem(NL) for any complexes q,q'6Syn(NL) : Syn(NL) -> Tns(NL) is the irewjor representation such that tnsrep(q) = q€>sewrep(q)eTns(NL) is the tensored complex associated with the syntactic term qsSyn(NL), and implicitly, with the semantic reference semrep(q)eSemQ3L) fmlrep: Sem(NL) -> Mod(XL) is fat formal representation such that^w/re^(x)6Mod(XL) is the formal model associated with the semantic context jceSem(NL) fmlint: Tns(NL) -> Exp(XL) is the/ora;a/ interpretation such that./w//H/(u)eExp(XL) is informal 11 hxref(a,&) 5* 0}. Thus lexical reference properly reduces to an assignment lexref: Trm(NL) -> Ref(NL) on actual lexical terms, rather than on random token/type pairs, or even on lexical entries in general. syntrm : Rdn(NL) -» Syn(NL) is the assignment of a basic syntactic term q(d,a) = syntrm(a,di)eSyn(NL) to each reduced term (a,d)eRdn(NL) •[•]: Syn(NL)xSyn(NL) ->• Syn(NL) is term application on pairs of complexes q,q'eSyn(NL) such that q[q']eSyn(NL) is the composite complex induced by the application of the syntactic term q to the term q' Note: In fact, Syn(NL) is simply the algebraic closure under the operation of term application over the set of basic complexes associated with the lexical terms of NL by means of the map syntrm on Rdn(NL), i.e, Syn(NL) is defined by induction on term application as follows: a) null complex: there is a null term OeSyn(NL) b) basic complex: q(d,a) = syntrtnfad^eSynfNL) for any reduced term (a,d)eRdn(NL) c) composite complex: q[q']eSyn(NL) for any q,q'eSyn(NL); q[0] = 0[q] = q for any qeSyn(NL) d) completeness: q e Syn(NL) iff q is either the trull complex or a basic complex, or a composite complex generated by a finite sequence of term applications over a set of basic complexes syntyp : Syn(L) -> Rtp(L) is the syntactic type designator defined by induction on Syn(L) as follows: a) null complex: syntyp(0) — nul eRtp(NL), where OeSyn(NL) is the null term and nul is the null type b) basic complex: syntyp(q(d,&)) = deRtp(NL) for any reduced term (a,d)eRdn(NL) c) composite complex: syntyp(q[tf}) - syntyp(q)&Rip(NL) for any q,q'eSyn(NL); subtrm : Syn(NL)xRtp(NL) -> Syn(NL) is the subterm designator such that su6rt-m(q,d)eSyn(NL) is the leading subcomplex of syntactic type deRtp(NL) in the syntactic complex qeSynfNL). The precise definition of subtrm proceeds by induction on Syn(NL) as follows: a) mill complex: subtrm(Q,d) = 0 for any type d £Rtp(NL), where OeSyn(NL) is the null term b) basic complex: subtrm(q(d',a),d) = q(d',a) if d'=d, and subtrm(q(d',a),d) = 0 if d Vd, for any type deRtp(NL) and reduced term (a,d')eRdn(NL) c) composite complex: subtrm(q[q'],d) = subtrm(q",d)eSyn(NL) for any q,q'6Syn(NL) and type deRtp(NL), where q"=q if subto'm(q,A) #• 0, and q"=q' otherwise Note: subtrm(q,d) = 0 if there is no subcomplex of type deRtp(NL) in the syntactic complex qeSyn(NL); otherwise, syntyp(sitbtrm(q,dy) = deRtpfNL). Also, by default, subtrm(q,nul~) = 0 for all qeSyn(NL), i.e. the null term is a subterm of every syntactic complex. synrep : Exp(NL) ->• Syn(NL) is the syntactic representation such that synrep(p)eSyn(NL) is the syntactic complex associated with the expression peExp(NL) Note: The system currently constructs synrep as a composition of the maps syntre : Exp(NL) -> Tre(NL) and trerep : Tre(NL) -> Syn(NL), where syntre associates a syntactic tree syntre(p)eTTe(NL) with each expression peExp(NL), and trerep associates a syntactic complex 10 expression associated with the tensored complex ueTns(NL) modrejy[ : Trm(XL) -> M for each MsMod(XL) is the model reference such that »Jorfre/M(v)sM is the model element referenced by the term veTrm(XL); if there is no actual reference for v in M then ~ OeM is the null object by default extrep : Mod(XL) -* Env(NL) is the external representation such that extrep(M)€En\(NL) is the external operational environment associated with the internal formal model MeMod(XL) extinfg : Trm(PL) -> Trm(EL) is the external term interpretation relative to an operational environment EeEnv(NL) with an associated executable language EL such that extintfc (v)6Trm(EL) is the external term corresponding to the protocol term veTrm(PL) : Exp(XL) -» Exp(EL) is the external translation relative to an operational environment EeEnv(NL) with an associated executable language EL such that exttrn^ ( executable translate of the formal expression cpeExp(XL) envexcg : Exp(EL) — > E is the execution process for an operational environment EeEnv(NL) with an associated executable Icmguage EL such that envexc^( expression £eExp(EL) in E Note: An execution process for an operational environment E = {E^ | keN} and executable language EL is defined with respect to an execution procedure envprcfc : Exp(EL)xN -* N such that for any executable expression £eExp(EL) and operational state index keN , the image state EJ/JA j= ^ (i.e. the model Eg^) satisfies the expression £, ), where the image index J(k) = ewvjwqg^.k) > k. In terms of a sequence of operations in E, any specific execution of an expression ^eExp(EL) is then simply tiie operational state envexcftfe) = envprcj^,n)eE for some index neN. pclint: Sem(NL) -»• Trm(PL) is the protocol interpretation such that/>c/j>j/(x)eTrm(PL) is the protocol term corresponding to the semantic object xeSemfNL) pclcod: Mod(XL)xExp(XL) -> Exp(PL) is the protocol encoding such that/?c/corf(M, the protocol expression associated with the formal expression pclrep: Exp(PL) -> Env(NL) is the external protocol representation such thatpcfrep(X)eEnv(NL) is the external operational environment encoded into the protocol expression XeExp(PL) pcltrn: Exp(PL) -> Exp(EL) is the external protocol translation such thatpc/frn(X)eExp(EL) is the fortnal expression encoded into thsprotocol expression XeExp(PL) for execution in the external operational environment E = extref: Exp(PL)xTrm(PL) -* Env*(NL) = Env(NL) u (LJEnv(NL)) is the uniform external reference such that extref (X,T) is the external element referenced by the term ofmetatype TeTyp(PL) in the protocol expression XeExp(PL); if there is no actual reference of this type then extref '(X,T) = 0 is 12 the null object by default Note: The uniform range Env*(NL) = Env(NL) u (Env(NL)) ofextref, where UEnv(NL) = the combined set of elements from all environments EeEnv(NL) }, accommodates reference with respect to terms ofmetatype ENVeTyp(PL) as well as all other terms, since the reference is an operational environment for any protocol expression XeExpfPL), i.e. ), whereas the referenced external element exrreXX,ABC) for any other metatype ABCeTyp(PL) is an element of the operational environment exfre/(X,ENV), i.e. ABC & ENV ;=> extrefCX.,KBC)€exfrej(X,WVy, therefore, the range of extrefmust be mixed between operational environments and elements of these environments. envrefe : Trm(PL) -» E for each EeEnv(NL) is the operational environment reference such that env7-e/jg(v)eM 's *ne environment element referenced by the term veTrm(PL); if there is no actual reference for v in E then envrefgfy} = OsEis the null object by default Put succinctly, METASCRIPT is an effective transformation mscript: Exp(NL) -» Exp(PL) of natural language expressions into formal expressions in the abstract language PL associated with a universal protocol. Using a fonnal metasemantics over the object language XL associated with NL, this protocol is explicitly designed to accommodate further effective translations exttrnj? : Exp(XL) -» Exp(EL) for specific operational environments EeEnv(NL) with associated executable languages EL. It should be noted that a particular protocol is utilized in certain sections of this description for the purposes of specificity and clarity. In this exemplary embodiment, the protocol is XMP (for external Media Protocol), which is designed and used as a universal transaction medium for diverse digital components in a networked environment. However, the invention and functionality of this system is not limited to any specific protocol. SYSTEM PROCESSES: Text Processing: Refer to module 3.1 ofFIG. 3. Text Input; Refer to submodule 3.1.1 ofFIG. 3. Any text is presented to the system as a string of ASCII characters. The specific method of text presentation is irrelevant. It may be voice-generated, entered via keyboard, optically scanned, etc. The system itself does not explicitly include a module for speech recognition, optical character recognition, etc., but any effective mechanism for presenting ASCII text to the system is sufficient for its successful operation. The following text string represents a typical input: Send Bob an email asking him if he is going to go to his appointment by himself. 13 This example will be carried throughout the following discussion in order to illustrate the METASCRIPT process in some detail. Text Parser. Refer to submodule 3.1.2 of FIG. 3. The text parser partitions any string of ASCII characters into sequences of sequences of ASCII substrings, using embedded blank spaces as delimiters. These inner sequences of substrings represent potential expressions, and the substrings themselves represent potential words or punctuation marks. For terminological convenience, any such parsed substring is called a pretoken, and the partitioned sequence in which it occurs is called & preexpression. Applied to the sample text string introduced above, the parser produces the following sequence of pretokens: (send,Bob,an,email,asking,him,if,he,is,going,to,go,to,his, appointment,by,himself,.) Syntactic Processing: Refer to module 3.2 of FIG. 3. Type Association: Refer to submodule 3.2.1 of FIG. 3. Type Assignment: Refer to submodule 3.2.1.1 of FIG. 3. Each parsedpretoken is checked against the lexicon for recognition by the system. Ifapretoken is recognized, i.e. if that string is included in the lexicon as an actual token, then it is immediately associated with some type. This first order assignment of type to token is only tentative at this point in the process, since correct type association requires more than mere lexical recognition of text strings as legitimate tokens. Accordingly, these initially assigned types are considered to be "virtual" types. Virtual type assignment on the sample preexpression parsed above yields the following list of token/type pairs (lexical terms) in the form (a,Iextyp(Q,ay) for each indicated token aeTok(NL) as shown in FIG. 4a. Since all pretokens listed there are recognized by the system as actual tokens, the parsed preexpression becomes an expression for further processing. However, the presence of ambiguous (virtual) types classifies this expression as "virtual". Promotion to an "actual" expression is deferred to the type contextualization process. Lexical Insertion: Refer to submodule 3.2.1.3 of FIG. 3. If a pretoken is not recognized by the system, then the user is prompted for information concerning lexical type and reference which may be properly associated with that pretoken in order to form a lexical term appropriate for inclusion in the lexicon. Upon such inclusion, the pretoken becomes a system token. This is the primary mechanism, and the only one under direct user control, by which the system learns new vocabulary. Type Contextualization: Refer to submodule 3.2.1.4 of FIG. 3. 14 Second order type assignment uses the initial lexical type assignments to tokens in an expression as data for a contextual process by which actual types may be assigned to tokens depending on their syntactic roles relative to other tokens in that expression. For example, in the sentence I want to go to the store. the word "to" is of ambiguous type because it appears in two different guises, once as the prefix of the infinitive "to go" and later as the preposition in the phrase "to the store". The system is able to discern such grammatical differences and assign correct types based on syntactic context. This method of type reassignment through syntactic context alone represents the simplest, most direct form of disambiguation employed by the system. More subtle mechanisms for further disambiguation, such as local type reduction and semantic contextualization, are deployed later in the process. In any case, final type association on the sample expression being processed yields the list shown in FIG. 4b of refined lexical terms in the form (a,fertxp(j>a)) f°r each indicated token aeTok(NL), where j^O is the (perhaps alternative) index corresponding to the appropriate refined type. Note that all the ambiguous (virtual) lexical types have been replaced by unambiguous (actual) types. This type reassignment promotes a virtual expression to an actual expression suitable for further syntactic processing. Term Resolution: Refer to submodule3.2.2 of FIG. 3. Term Correlation: Refer to submodule 3.2.2.1 of FIG. 3. Indirect references by various syntactic elements such as pronouns must be correlated to direct references elsewhere in the text. This task is achieved through type matching in the context of appropriate syntactic configurations. For example, in the sentence Inform Bob about the next meeting, and tell him that it will happen later than usual. the pronoun "him" naturally correlates with "Bob", and "it" with "meeting". The system establishes such correlations first by executing a simple type/reference matching such as (him ->• male person -> Bob) on antecedents, and then by evaluating such matches for probable fit according to context. For example, in the extended sentence Inform Bob about the next meeting at the factory, and tell him that it will happen later than usual. there are two possible type/reference matches for "it", viz. (it -> some object -> {meeting, factory}), but clearly, on the basis of object characteristics, the match (it -» some object -> meeting) is a better fit than (it -> some object -> factory) in the context of the phrase "...it will happen later than usual" since meetings happen more readily than factories do, as any capable scheme of lexical reference will indicate. It should be noted, of course, that this process must be applied to a text as a whole, not just 15 to individual expressions, so that indirect references across multiple expressions may be correlated properly. Accordingly, the following simple tern: correlations are made within the sample expression being processed: 5) (him,ppm) ->• (Bob/pnm) 7) (he,ppm) -> (Bob,pnm) 13) (his,psm) -> (Bob's,psm) 16) (himself,prm) ~» (Bob,pnm) Term Reduction: Refer to submodule 3.2.2.2 of FIG. 3. Proper syntactic dependencies between terms in an expression are established by means of a type reduction matrix. The dimensions of this matrix help to determine the level of syntactic disambiguation quickly achievable by the system. A 2-dimensional matrix, which maps pairs of tokens into their relative reduction ordering, is minimal. Higher dimensional reduction matrices, which map longer sequences of tokens into their relative reduction orderings, are increasingly effective, but more costly to implement in terms of memory requirements and processing speed. An optimal number of reduction dimensions, of course, depends critically on a complex combination of implementation constraints and performance criteria. Whatever the number of dimensions used, however, the system is designed to establish correct syntactic relationships on a relatively global scale (at least over an entire expression) simply by executing local term reductions in the proper order. For example, using a minimal matrix on the sample expression being processed, the local term reduction sequence is constructed as shown in FIG. 5. Term Inversion: Refer to submodule 3.2,2.3 of FIG. 3. Proper chains of syntactic dependencies among tokens in a sentence, and the resultant dependencies between those chains, are constructed by means of an effective inversion of the term reduction process. These chains are then used to generate branches of the syntactic tree which represents the underlying syntactic structure of the expression being processed. On the sample reduction sequence just constructed, term inversion produces the maximal chains shown in FIG. 6a. Note that term reduction has effected critical type modulations in some of the subordinate terms, viz. obj->obd (general object -> direct object), obj->obi (general object-» indirect object), ob j-^obs (general object -> verb subject), and obj-»obp (general object —> preposition object). These reduced types are critical data for accurate semantic processing. Syntactic Representation: Refer to submodule 3.2.3 of FIG. 3. Each expression for a language is represented at the fundamental syntactic structural level by a tree, i.e. by a finitely branching partial order of finite length having elements corresponding to lexical 16 terms ordered by their associated type reductions. This tree has a canonical representation as a natural branching diagram, which in turn becomes represented as a (usually composite) term (syntactic complex) in an associated syntactic algebra. The branches of this tree correspond directly to. the chains of syntactic dependencies established in the term resolution process. For example, the syntactic tree representing the sample text being processed becomes structured as shown in FIG. 6b. Nodes of a syntactic tree and the syntactic order relations which hold between them are interpreted in terms of a many-sorted syntactic structure. The canonical language for this class of structures is based on the notion of a type/token complex to form basic terms, and the operation of term application on pairs of these complexes to form more complicated or composite terms. Each term, whether basic or composite, ultimately corresponds to a semantic object with certain characteristics, and these objects in their various configurations comprise the domains and internal relations of the syntactic structures considered. More specifically, under METASCR1PT the formal correlate of an expression in a natural language is a term in the associated syntactic algebra which represents the effective translation of the expression into a form suitable for direct system interpretation. This algebra is based on an operation of term application which, given a translation of natural language expressions into algebraic terms, transforms syntactic dependencies at the level of natural language into specific formal relations at an algebraic level. Thus the syntactics for natural language becomes a matter of effective computation. Each node (type/token pair) (d,a) in a syntactic tree t(p) = syntre(p)&Tre(NL) representing an expression peExp(NL) corresponds to a reduced term (token/type pair) (a,d)eRdn(NL), and is associated with a basic complex q(d,a)eSyn(NL) by means of the syntactic assignment syntrm : Rdn(NL) -> Syn(NL), i.e. q(d,a) = synlrm(z,A). The immediate syntactic dependence of another term (d',a') on (d,a) determined by term reduction is signified at the tree level as the order relation (d,a) L (d',a'). The algebraic operation of term application •[•] : Syn(NL)xSyn(NL) -* Syn(NL) on pairs of syntactic complexes then yields composite complexes of the form q"=q[q'] induced by these syntactic dependency relations; for example, in the particular case considered here involving the terms (d,a) and (d'.a1), term application results in the composite complex q"((d,a),(d',a')) = q(d,a)[q'(d',a')] = syntrm(a,d)[syntrm(&',A')]. Similarly, a chain of syntactic dependencies yields iterated applications on increasingly composite complexes and the basic complex which represents the next link in the dependency chain, i.e. the relation ZQ L. zj L 22 between syntactic terms zo,zi,Z2eTrm(NL) yields the algebraic term qo[qilq2]] yields a slightly different form for the associated algebraic term, in that a dependency relation of the form ZQ L (zi,Z2), whereby syntactic terms zj and Z2 are both directly dependent on ZQ (i.e. ZQ L zand zo L 22 ), yields the algebraic term qo[qj][q2]= (qofalDte] * qotqifelL '-e term application is not an associative algebraic operation. In any case, continued term applications of this sort, as explicitly induced by the dependency structure of the syntactic tree, thus yield an effective representation of any expression in a language NL as a (usually composite) term in the associated syntactic algebra Syn(NL). For example, the syntactic complex corresponding to the sample expression being processed is (act,send)[(obi,Bob)][(obd,email)[(adj,an)][(ptc,asking) [(Itm,if) [(act,is)[(ptc,going)[(inf,to)[(act,go) 17 OTTTKS'llWii'V'iW. P'-TOfT"!1' ffiOWTTTmTTr..w.'MTi SUBSTITUTE SHEET (RULE 26) [(prp,to)[(obp,appointment)[(adj,his)]]] [(prp,by)[(obp,himself)]]]]]]]]] This algebraic form of the expression is critical for the language processing which follows; in particular, the syntactic representation of expressions afforded by algebraic term reduction provides an effective recursion structure for accurate semantic processing. In summary, each expression peExp(NL) is represented as a syntactic tree t(p) = .syjtfre(p)eTre(NL) which induces an associated syntactic complex q(t(p)) = ft-erep(t(p)}eS>'n(NL). A detailed definition of the intermediate syntactic algebraic representation trerep : Tre(NL) --> Syn(NL) is given by induction on syntactic dependence: a) null dependence; trerep(d,a) = syntrm(&,&) for any trivial (single node) tree (d,a)6Tre(NL) b) direct dependence: trerep(t L t') = trerep(ty[trerep(t')] for any trees t,t'eTre(NL) c) multiple dependence: trerep(t L (t',t")) = (trerep(\)[trerep(t')])[triirep(i")} for any trees t,t',t"eTre(NL) Full syntactic representation is then simply the composition synrep ~ trerep° syntre : Exp(NL) -> Syn(NL). Semantic Processing: Refer to module 3.3 of FIG. 3. Semantic Representation'* Refer to submodule 3.3.1 of FIG. 3. The lexical reference map lexref: TrmfNL) -> Ref(NL) forms the basis for the interpretation of terms in the semantic algebra Sem(NL) as objects constructed over the reference domain Ref(NL). Specifically, each lexical term (token/type pair) (a,e)sTrm(NL) is explicitly associated in the lexicon with a reference /ej0-e/[a,e)eRef(NL) which instantiates the term in a given environment; in fact, no lexical term is properly defined until such a reference for it is specified, since this definition forms the principal link between a natural language term and its intended meanings. The basic objects of the semantic algebra are simply these lexical references, i.e. Ref(NL) c: Sem(NL). Tin's first order notion of reference for lexical terms is then extended to more complex semantic terms by means of a semantic product * : Sem(NL) xSem(NL) -» Sem(NL) on objects which allows a proper definition of a semantic representation semrep : Syn(NL) -> Sem(NL) on the entire algebra Syn(NL). By induction on the composition of syntactic complexes, the full definition becomes: a) null: semrep(0) = 1 where OeSyn(NL) is the null complex and 1 eSem(NL) is the identity object b) basic; ,ye>we/[q(d(e),a)) = /exre/[a,e)eSem(NL) for any lexical term (a,e)eTrm(NL) and associated reduced term (a,d(e))eRdn(NL), where q(d(e),a) = jy«?r/n(a,d(e))eSyn(NL) is a basic complex c) composite: semrej(q[q']) — semrej(q)*semrej(q')e Sem(NL) for any complexes q,q' eSyn(NL) By this definition, semrep is clearly a homomorphism from the syntactic algebra into the semantic object algebra. 18 19 The semantic context c(p) is constructed as an object in the algebra Sem(NL) as follows: After text parsing and type association, the text s(p) is represented as a sequence (po)...,pn)6iS'eg(Exp(NL)) of expressions p; eExp(NL) for some n ^ 0, where p = pj(p) for some index j(p)e (0,.. .,n} . Note that s(pj) = s(p) for 0 i j by induction on the indices je {0,...,n} where q(pj)sSyn(NL) is the syntactic complex representing Pj. Entering into this definition is the metaterm operator pdtnn : Syn(NL)xTyp(PL) — > Syn(NL) associated with the protocol language PL as described in the following section. Briefly, for any syntactic complex qeSyn(NL) and metatype ABCeTyp(PL), the syntactic term j9cfrrflj(q,ABC)eSyn(NL) is the leading subterm of q of type ABC; in particular, subterms /jc//nw(q,ENV)eSyn(NL) of metatype ENVeTyp(PL) (indicating "environment") play a significant role. Specifically, the inductive definition oicontxt : Syn(NL)xTxt(NL) -> Sem(NL) is as follows: a) j = 0: ccnttf(q(po),s(p)) = se??irep(pc/fr/n(q(po),ENV))eSem(NL) b) j = k+1 for k Then c(p) = co«tc/(q(p),s(p)) = cowtt/(q(pj(p)),s(p»eSem(NL), and M(p) =^n/re/j(c(p))eMod(XL) by means of \\\Q formal representation finlrep : Sem(NL) -> Mod(XL). The noncommutativity of the semantic product is critical in this definition. Formal Interpretation: Refer to submodule 3.3.3 of FIG. 3. The formal term interpretation trmint: Sem(NL)xMod(XL) -> Trm(XL) establishes the syntactic basis for the formalization of NL, since expressions interpretations of natural expressions peExp(NL) are built from terms in Trm(XL) associated through trmint with appropriate objects in Sem(NL). In some extremely approximate sense, q(p)®fr«j/Hr(x(p)) where q(p) = synrep(p)eSyn(NL) is the syntactic complex representing p and x(p) = Sfi7weXq(p))eSem(NL) >s tne semantic complex representing q(p). The fonnal semantics, or metasemantics, by which these forma] interpretations are constructed is called MEAO (for Modified Environment Action Object). It is based on a fundamental transaction paradigm for which the elementary operation is a mapping /: A -> B on structures A,BeObj(M) in an environment M. Terms of an object language for this semantics reflect this fundamental orientation, and a basic statement in any such language is simply an assignment of the form "xjj =// Oy)" wherex^eA, xg&B, and //: A -> B. More complicated expressions are constructed from these basic (or atomic) statements by means of the usual formal prepositional connectives (negation, conjunction, disjunction, and implication) and quantification (existential and universal). Of course, any of the individuals, objects, functions, and environments which serve as interpreted elements for such a language may be arbitrarily articulated, thus extremely complex despite the apparent simplicity of this formal syntax; hence the notion of "modification" (the M in MEAO) plays a significant role. 20 As previously indicated, the proper formal interpretation of an expression peExp(NL) relative to a semantics for the object language XL is induced by a map trmint: Sem(NL) -» Trm(XL). However, the actual computation of MEAO elements from the syntactic and semantic apparatus of NL is performed in terms of a formal protocol which implements this metasemantics in an effective manner. Specifically, there is a metaterm operator pcltrm : Syn(NL)xTyp(PL) -> Syn(NL) for the protocol language PL associated with XL, which is built from conditional sequences (in essence, executable routines) of syntactic subterm assignments yielded by the standard sitbterm designator subtrm : Syn(NL)xRtp(NL) -» Syn(NL). Distinguished semantic types TeTyp(PL) determine certain syntactic subterms q(p)T =.£>c//ra(q(p),T)eSyn(NL) of the syntactic complex q(p)eSyn(NL), and these syntactic subterms yield semantic representations x(p)f = ,srewrep( the basis of the formal semantics for XL. From the perspective of an effective metasemantics for XL, however, this term interpretation is derived from a higher level protocol interpretation pclint: Sem(NL) -> Trm(PL) by composition with an intermediate formal interpretation fmltrm : Trm(PL) -> Trm(XL) as trmint =fmltrm° pclint: Sem(NL) -> Trm(PL) -» Trm(XL) It is in this precise sense, coupled with the fact that the internal model M(p) =y»j/rep(c(p))eMod(XL) is also interpreted as an element for PL corresponding to a term V(p)ENV =/>c//Hf(c(p),ENV)eTrm(PL) relative to the metatype ENVeTyp(PL) (indicating "environment"), that PL constitutes an effective formal metalanguage for XL, whereas NL is an informal metalanguage for XL. In any case, the semantic representations x(p)xe Sem(NL) are interpreted as formal terms v(p)j = Or»wrt(x(p)j) =./7H//7v«°/?c//«/(x(p)x)eTrm(XL). These terms then designate formal elements h(p)x = ;no£/re/M(p)(v(p)x)eM(p) by means of the model reference map modre/Mfn) '• Trm(XL) -> M(p). Finally, these elements are structured by the syntactic complex q(p) into the formal configuration K(p)crM(p), which is exactly described by the formal expression (p(p) =^5w///i/(u(p))eExp(XL), where u(p) = q(p)®5e»jrep(q(p))6Tns(NL) is the semantic tensor complex representing p. More precisely, K(p) is the minimal substructure of M(p) satisfying cp(p), i.e. M(p) 2 K(p) |= cp(p). Again, in the simplest case conforming to MEAO semantics, the structure K(p) consists of a) an object^ = «orfre/Jv!(p)Cv(p)DMN) e Obj(M(p)) for a term v(p)DMNeTrm(XL) of metatype DMNeTyp(PL) b) an object B = ?"ocfre^vI(p)(v(p)RKG) e Obj(M(p)) for a term v(p)RNGeTrm(XL) of metatype RNGeTyp(PL) c) a map// = «Jorfre^vi(p)(v(p)MRp) e Map(M(p)) for a term v(p)MApeTrm(XL) of metatype MAPeTyp(PL) d) an element xj = modrefy^(p)(v(p)QM) &A for a term v(p)ARGeTrm(XL) of metatype ARGeTyp(PL) 21 e) an element xB =fB A (xA) e B while the formal description cp(p) is simply the statement 'xB —fB A(.xA)' • As the formal description of an abstract configuration K(p) in the internal mode] M(p), the expression q(p) is not an executable translate of the natural expression p; instead, it is a formal interpretation of the precise conditions, relative to an abstract model of an operational environment, upon which an effective executable form of p may be constructed. The ultimate transition to an appropriate external operational environment is properly accomplished by means of the rnetasemantic protocol. In essence, the construction of a metaformal expression X(p)eExp(PL) as a fully effective translation of an expression peExp(NL) is simply a machine interpretable codification of the satisfaction relation M(p)|=cp(p). Formally, the expression X(p) =pclcod'(M(p),9(p))eExp(PL) is constructed by means of the protocol encodingpclcod; Mod(XL)xExp(XL) -> Exp(PL) based on the protocol interpretation pclint: Sem(NL) -» Trm(PL) introduced above. From this metaformal perspective, the internal model M(p)eMod(XL) appropriate for p is referenced by the term V(P)ENV =,pc/wrt(c(p),ENV)eTrm(PL), and semantic objects x(p)f = semrep(q(p)x)eSem(NL), which represent distinguished subterms q(p)T =pcltrm(q(p),T)eSyn(NL} of q(p) = synrep(p)zSya(NL) corresponding to metatypes TeTyp(PL), are interpreted as terms w(p)x=.pclint(x(P)T)€Trm(PL). For the purpose of protocol consistency, it is significant to note that the formal terms from which simply the interpretations v{p)j =j6«/*ra(w(p)'T')sTnn(XL). When PL is XMPL, the formal language associated with the universal protocol XMP, this metasyntactic construction is straightforward. Indeed, the syntax of XMPL is explicitly designed to accommodate MEAO semantics. In general, what is specified by any XMPL expression is an operational environment, a transaction mapping, a mapping domain, a mapping range, and a mapping argument. Refinements to any of these elements are indicated by appropriate nestings of siibelements. Again, in the simplest case conforming to MEAO semantics, X(p)eExp(XMPL) is the protocol statement |
|---|
55-DELNP-2004-Abstract-(12-05-2010).pdf
55-DELNP-2004-Claims-(12-05-2010).pdf
55-DELNP-2004-Correspondence-Others-(12-05-2010)-.pdf
55-DELNP-2004-Correspondence-Others-(12-05-2010).pdf
55-delnp-2004-correspondence-others.pdf
55-DELNP-2004-Description (Complete)-(12-05-2010).pdf
55-delnp-2004-description (complete).pdf
55-DELNP-2004-Drawings-(12-05-2010).pdf
55-DELNP-2004-Form-1-(12-05-2010).pdf
55-DELNP-2004-Form-2-(12-05-2010).pdf
55-DELNP-2004-Form-3-(12-05-2010).pdf
55-DELNP-2004-GPA-(12-05-2010).pdf
| Patent Number | 242103 | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Indian Patent Application Number | 55/DELNP/2004 | ||||||||
| PG Journal Number | 33/2010 | ||||||||
| Publication Date | 13-Aug-2010 | ||||||||
| Grant Date | 11-Aug-2010 | ||||||||
| Date of Filing | 07-Jan-2004 | ||||||||
| Name of Patentee | RAVENFLOW, INC., a US company of 918 Parker Street, Suite A-11, Berkeley, California 94710, U.S.A. | ||||||||
| Applicant Address | 918 PARKER STREET,SUITE A-11,BERKELEY,CALIFORNIA 94710,USA | ||||||||
Inventors:
|
|||||||||
| PCT International Classification Number | G06F 17/28 | ||||||||
| PCT International Application Number | PCT/GB02/02742 | ||||||||
| PCT International Filing date | 2002-06-12 | ||||||||
PCT Conventions:
|
|||||||||