Claims Analysis
Total Claims: 3
Claim 1
Independent Claim
231 words
A machine method of generating a language dependent sortkey, to facilitate the alphabetical sorting of another alphabet using a common sorting routine, said method comprising the steps of: (a) storing in a master file encoded words, formed from characters each having a preselected value, to be sorted; (b) providing a language dependent data file having an alphanumerical encoding table for the language of said another alphabet, the table including an encoding indicator, a first sort order entry and a second sort order entry; (c) comparing said value of a character from one of the encoded words in the master file against the alphanumerical encoding table to determine its corresponding entry; (d) retrieving the encoding indicator from said table, corresponding to said corresponding entry, which indicates if the encoding process will be a one-to-one character encoding, a one-to-two character encoding, or an ignore character encoding; (e) if the encoding indicator indicates the encoding is one-to one, utilizing the value in the first sort order entry, for said sortkey; (f) if the encoding indicator indicates that the encoding is one-to-two, utilizing the values in both the first sort order entry and the second sort order entry, for said sortkey; and (g) if the encoding indicator indicates that the encoding is an ignore encoding, ignoring any values for said sortkey; and repeating from step (c) for each of the characters in the master file.
Claim 2
Dependent Claim
231 words
A machine method of generating a language dependent sortkey, to facilitate the alphabetical sorting of another alphabet using a common sorting routine, said method comprising the steps of: (a) storing in a master file encoded words, formed from characters each having a preselected value, to be sorted; (b) providing a language dependent data file having an alphanumerical encoding table for the language of said another alphabet, the table including an encoding indicator, a first sort order entry and a second sort order entry; (c) comparing said value of a character from one of the encoded words in the master file against the alphanumerical encoding table to determine its corresponding entry; (d) retrieving the encoding indicator from said table, corresponding to said corresponding entry, which indicates if the encoding process will be a one-to-one character encoding, a one-to-two character encoding, or an ignore character encoding; (e) if the encoding indicator indicates the encoding is one-to one, utilizing the value in the first sort order entry, for said sortkey; (f) if the encoding indicator indicates that the encoding is one-to-two, utilizing the values in both the first sort order entry and the second sort order entry, for said sortkey; and (g) if the encoding indicator indicates that the encoding is an ignore encoding, ignoring any values for said sortkey; and repeating from step (c) for each of the characters in the master file.
Claim 3
Dependent Claim
127 words
A machine method as defined in claim 1 in which said encoding table further includes an alternate sort order entry and said encoding indicator also indicates if the encoding process will be a potential two-to-two character encoding; and which further comprises the step of: (h) if the encoding indicator indicates that the encoding is a potential two-to-two character encoding, comparing the value of the second character in a character pair from the encoded words; if the encoding indicator confirms a two-to-two character encoding, utilizing the value in the first sort order entry and the alternate sort order entry for said sortkey; else utilizing the value in the first sort order entry for said sortkey, and then comparing the value of said second character repeating from step (c).