Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
260 words
In a computer program containing a plurality of messages, each including a plurality of text words, a method for forming a data file of the messages comprising the steps of: forming a first file portion as a message word table having unique entries corresponding to one or more of the message words, said entries ordered in said table in accordance with their frequency of occurrence in the plurality of messages; forming a second file portion as a message token string table containing a token string for each message, each token string including a plurality of tokens each representing a word in the message, said tokens ordered in the string by the location of their corresponding words in the corresponding message, each token having a value representing the location of its corresponding word in the message word table, said tokens including at least one token to indicate the location of a variable in the message, said variable having a value being defined when the message is retrieved and wherein said variable includes a ring variable type indicating one of a plurality of values, said values stored as words in the message word table and indicated in said token string as a plurality of corresponding tokens following a token representing the ring variable, a specific value of a selected variable being provided when the message is retrieved; and forming a third file portion as a message lookup table containing a unique identifier for each message and a corresponding pointer, said pointer indicating an address of the token string for the corresponding message.
Claim 2
Dependent Claim
260 words
In a computer program containing a plurality of messages, each including a plurality of text words, a method for forming a data file of the messages comprising the steps of: forming a first file portion as a message word table having unique entries corresponding to one or more of the message words, said entries ordered in said table in accordance with their frequency of occurrence in the plurality of messages; forming a second file portion as a message token string table containing a token string for each message, each token string including a plurality of tokens each representing a word in the message, said tokens ordered in the string by the location of their corresponding words in the corresponding message, each token having a value representing the location of its corresponding word in the message word table, said tokens including at least one token to indicate the location of a variable in the message, said variable having a value being defined when the message is retrieved and wherein said variable includes a ring variable type indicating one of a plurality of values, said values stored as words in the message word table and indicated in said token string as a plurality of corresponding tokens following a token representing the ring variable, a specific value of a selected variable being provided when the message is retrieved; and forming a third file portion as a message lookup table containing a unique identifier for each message and a corresponding pointer, said pointer indicating an address of the token string for the corresponding message.
Claim 3
Dependent Claim
23 words
A method according to claim 1 wherein the message lookup table pointer indicates an address of a first token of the token string.
Claim 4
Dependent Claim
24 words
A method according to claim 2 wherein each of said token strings is terminated by a token indicating an end of the token string.
Claim 5
Dependent Claim
16 words
A method according to claim 3 wherein said tokens include an indication of a terminating space.
Claim 6
Dependent Claim
17 words
A method according to claim 4 wherein said word entries each include a terminating user specified character.
Claim 7
Dependent Claim
20 words
A method according to claim 5 wherein said words are stored in two byte increments in the message word table.
Claim 8
Dependent Claim
40 words
A method according to claim 6 wherein said single and double data lengths are single byte and double byte lengths, said single byte lengths tokens indicating words within a first plurality of double byte locations in the message word table.