Method, a computer program and apparatus for processing a computer message

Abstract

Embodiments of the invention provide a method, computer program and apparatus for processing a computer message, the method comprising: upon receipt of a computer message at a computer, classifying the computer message and assigning it a message cluster identification in dependence thereon; and, utilizing a message template to trans-denotate the message, wherein the message template is selected in dependence on the message cluster identification.

The invention claimed is: 
     
       1. A method of processing a computer message, the method comprising:
 upon receipt of the computer message at a computer, classifying the computer message, wherein the classifying of the computer message includes using efficient grammatical clustering (EGC) to classify the computer message, and wherein using EGC to classify includes:
 determining a syntactic execution path of the computer message through an EGC program; 
 analyzing previously determined correct structure and syntactic validity to provide a context which limits complexity of the classification; 
 using pattern matching of the computer message against a template; and 
 based on the syntax execution path, the determined context, and results of the pattern matching, providing a classification of the computer message; 
 
 assigning the computer message to a message cluster identification in dependence thereon; and 
 utilizing a message template to trans-denotate the computer message, wherein the message template is selected in dependence on the message cluster identification, and wherein trans-denotating of the computer message comprises:
 receiving the message template and the computer message; 
 sending the message template and the computer message to a language aware tokenizer; 
 producing, by the language aware tokenizer, input tokens from the computer message; 
 producing, by the language aware tokenizer, template tokens from the message template; and 
 sending the input tokens and the template tokens to a template matching process, wherein the template matching process generates a sequence of output tokens that are used to generate a corresponding output message by
 analyzing the sequence of output tokens with computer-readable rules to obtain patterns of the sequence of tokens by:
 determining a path that is taken by each of the tokens through the computer-readable rules which successfully terminates; and 
 grouping the tokens according to the path. 
 
 
 
 
     
     
       2. The method according to  claim 1 , comprising, upon receipt of the computer message, tokenizing the computer message to produce a sequence of message tokens corresponding to the computer message. 
     
     
       3. The method according to  claim 1 , in which the message template includes a template head which corresponds to the format of the received computer message and a template body which corresponds to the format of the output message. 
     
     
       4. The method according to  claim 3 , comprising tokenizing the template to produce a sequence of head message tokens and a sequence of body template tokens. 
     
     
       5. The method according to  claim 4 , in which a series of output tokens are used to generate the output message. 
     
     
       6. The method according to  claim 1 , in which the message template includes parameterization to enable operations to be performed on parameters within a received message. 
     
     
       7. The method according to  claim 1 , in which the message template includes one or more guard functions to perform a test on an input message parameter. 
     
     
       8. The method according to  claim 1 , wherein the computer message is a query to a relational database. 
     
     
       9. The method according to  claim 1 , comprising generating at least one alternative message based on the computer message. 
     
     
       10. The method according to  claim 1 , wherein the template is arranged such that the computer message is translated from one language to another. 
     
     
       11. The method according to  claim 1 , wherein the trans-denotation serves to change the computer message to one that has improved properties and/or to change the computer message so that elements of the computer message are no longer publicly readable. 
     
     
       12. The method according to  claim 1 , in which the computer message is changed prior to forwarding to a resource such that the resource is prevented from answering the computer message in a defined manner. 
     
     
       13. The method according to  claim 12 , in which the computer message is changed prior to forwarding to a resource such that the resource responds with a reply that no longer contains sensitive information. 
     
     
       14. A non-transitory computer readable medium having sets of instructions stored thereon, which when executed by a computer causes the computer to:
 upon receipt of a computer message, classify the computer message, wherein the classifying of the computer message includes using efficient grammatical clustering (EGC) to classify the computer message, and wherein using EGC to classify includes:
 determining a syntactic execution path of the computer message through an EGC program; 
 analyzing previously determined correct structure and syntactic validity to provide a context which limits complexity of the classification; 
 using pattern matching of the computer message against a template; and 
 based on the syntax execution path, the determined context, and results of the pattern matching, providing a classification of the computer message; 
 
 assign the computer message to a message cluster identification in dependence thereon; and 
 utilize a message template to trans-denotate the computer message, wherein the message template is selected in dependence on the message cluster identification, and wherein trans-denotating of the computer message comprises:
 receiving the message template and the computer message; 
 sending the message template and the computer message to a language aware tokenizer; 
 producing, by the language aware tokenizer, input tokens from the computer message; 
 producing, by the language aware tokenizer, template tokens from the message template; and 
 sending the input tokens and the template tokens to a template matching process, wherein the template matching process generates a sequence of output tokens that are used to generate a corresponding output message by
 analyzing the sequence of output tokens with computer-readable rules to obtain patterns of the sequence of tokens by:
 determining a path that is taken by each of the tokens through the computer-readable rules which successfully terminates; and 
 
 
 grouping the tokens according to the path. 
 
 
     
     
       15. A computer system for processing a computer message, the system comprising:
 a memory device; and 
 a computer processor in communication with the memory device, wherein the memory device includes sets of instruction which, when executed by the computer processor, cause the computer processor to: 
 upon receipt of the computer message, classify the computer message, wherein the classifying of the computer message includes using efficient grammatical clustering (EGC) to classify the computer message, and wherein using EGC to classify includes:
 determining a syntactic execution path of the computer message through an EGC program; 
 analyzing previously determined correct structure and syntactic validity to provide a context which limits complexity of the classification; 
 using pattern matching of the computer message against a template; and 
 based on the syntax execution path, the determined context, and results of the pattern matching, providing a classification of the computer message; 
 
 assign the computer message to a message cluster identification in dependence thereon; and 
 utilize a message template to trans-denotate the computer message, wherein the message template is selected in dependence on the message cluster identification, and wherein trans-denotating of the computer message comprises:
 receiving the message template and the computer message; 
 sending the message template and the computer message to a language aware tokenizer; 
 producing, by the language aware tokenizer, input tokens from the computer message; 
 producing, by the language aware tokenizer, template tokens from the message template; and 
 sending the input tokens and the template tokens to a template matching process, wherein the template matching process generates a sequence of output tokens that are used to generate a corresponding output message by
 analyzing the sequence of output tokens with computer-readable rules to obtain patterns of the sequence of tokens by:
 determining a path that is taken by each of the tokens through the computer-readable rules which successfully terminates; and 
 
 
 grouping the tokens according to the path.