Patent Document ID: 8229878
Application ID: 13012514

Base Claim:
1. A computer implemented method of interpreting written text, said method comprising the steps of: providing an alphabet, at least one symbol for constructing lexical elements, and at least one syntactic element built on said alphabet, said lexical elements, and said at least one symbol on at least one computer; determining, by said at least one computer, a sort of value, an arity, a notation, and a type for each said syntactic element, to provide well-formed syntactic elements and meaningless syntactic elements; building, by said at least one computer, formal definitions from said well-formed syntactic elements, and determining a type for each said formal definition to provide a list of terminologies, assertions, theorems, questions and answers; building, by said at least one computer, at least one formal glossary as ordered sets of said formal definitions; providing, on said at least one computer, to an output of at least one said formal glossary, and a related minimal lexicon; parsing, verifying and normalizing each said formal definition, by said at least one computer, from said formal glossary, to provide a list of defined lexical elements and undefined lexical elements; accepting at least one input, wherein said at least one input includes at least one question containing at least one well formed syntactic element; retrieving for each said defined lexical element, at least one formal definition from said at least one formal glossary; applying said at least one formal definition to said defined lexical elements according to at least one interpretation process to provide at least one meaningful value; coding each said at least one input and said at least one meaningful value as a new questions and answers definition; and saving said new questions and answers definitions in said formal glossary in said computer, to provide an intelligent glossary.

---

Claim 6:
6. A computer implemented method as in claim 1 , further comprising the steps of: assembling a unique symbol concatenated with only 0-arity syntactic elements, respecting the sort of value, arity and notation of said unique symbol to provide a well formed syntactic element; calling such a well formed syntactic element atomic; assembling a unique symbol concatenated with other said well-formed syntactic elements, atomic or non-atomic, respecting the sort, arity and notation of said unique symbol, and using parentheses to disambiguate the order of evaluation of syntactic elements; such a well-formed syntactic element is called non-atomic; calling all other forms of syntactic elements ill-formed; calling “the head”, the unique symbol of said well formed syntactic element, atomic or non-atomic; calling “the body”, the rest of said well formed syntactic element; calling “the sort of value of a well formed syntactic element” the sort of value of the head of that well formed syntactic element; calling “bound” an occurrence of a variable which is in said body of a quantifier or a function symbol in a well formed syntactic element; calling “free” an occurrence of a variable which in not in said body of a quantifier or not a function symbol in a well formed syntactic element; calling “ground” a well formed syntactic element which contains no free variables; calling “non-ground” any well formed syntactic element which is not “ground”; calling “literal”, a well formed syntactic element which contains only elements, and primary symbols; calling “non-literal” any well formed syntactic element which is not “literal”.