Method of preparing indexes
OwnerVincent M. Geversinventor
Life of this patent
Estimating the term…
Abstract
A method of recording data, such as trade marks, for searching by data processing means comprising recording the data on data processing supports first as it normally appears and again according to an alphabet code, phonic code or cryptographic code, filing the data processing supports in a logical order by the alphabet code and preparing lists of the data.
Claims4
A machine process for making directories of word marks, comprising the steps of:
- (a) recording each word mark on a data processing support in the form of a first series of machine readable indicia;
- (b) feeding the thus obtained supports into a machine programmed to add to said first series of indicia a second series of machine readable indicia, each of said first and second series of machine readable indicia representing alphabetic characters, said second series of machine readable indicia corresponding to the word marks as transformed according to a predetermined objective alphabetic translation code which is applied to the letters of said word marks in a manner such that there is only one possible transformation permissible from the indicia of said first series to the indicia of said second series and a plurality of different first series indicia can be transformed to the same second series indicia, said alphabetic translation code applying at least the following rules to the letters of said word mark as represented by said first series of indicia:
- (1) a double letter equals a single letter;
- (2) CY equals SI;
- (3) Y equals I;
- (c) recording said second series of indicia on said supports;
- (d) feeding the thus completed supports into a sorting machine programmed to classify the supports according to the indicia of the second series;
- and
- (e) printing by means of the thus classified supports the word marks corresponding to the indicia of the first series.
A machine process for making directories of alphanumeric data comprising the steps of:
- (a) recording each datum on a data processing support in the form of a first series of machine readable indicia;
- (b) recording on each of said data processing supports a second series of machine readable indicia, each of said first and second series of machine readable indicia representing alphabetic characters, the indicia of said second series being related to the indicia of said first series recorded on the same support according to a predetermined objective alphabetic translation code which is applied to the letters of said alphanumeric datum in a manner such that there is only one possible transformation permissible from the indicia of said first series to the indicia of said second series and a plurality of different first series indicia can be transformed to the same second series indicia, said alphabetic translation code applying at least the following rules to the letters of said alphanumeric datum as represented by said first series of indicia:
- (1) a double letter equals a single letter;
- (2) CY equals SI;
- (3) Y equals I;
- (c) feeding the thus completed supports into a sorting machine programmed to classify the supports according to the indicia of the second series;
- and
- (d) printing by means of the thus classified supports the data corresponding to the indicia of the first series.
A machine process for making directories of word marks, comprising the steps of:
- (a) recording each word mark on a data processing support in the form of a first series of machine readable indicia;
- (b) feeding the thus obtained supports into a machine programmed to add to said first series of indicia a second series of machine readable indicia and corresponding to the word marks according to a predetermined objective alphabetic translation code which applies the following translation rules to the letters of said word mark:
- (1) a double letter equals a single letter;
- (2) C equals K except:
- CE equals SE
- CI equals SI
- CY equals SI
- CH equals CH
- (3) PH equals F;
- (4) Q equals K;
- (5) Y equals I;
- (6) Z equals S;
- (7) KS, CS and QS equal X;
- (8) H is ignored except in CH and SH;
- (9) U is ignored after Q;
- (10) CH and SH are replaced by Z;
- (c) recording said second series of indicia on said supports;
- (d) feeding the thus completed supports into a sorting machine programmed to classify the supports according to the indicia of the second series;
- and
- (e) printing by means of the thus classified supports the word marks corresponding to the indicia of the first series.
A machine process for making directories of alphanumeric data comprising the steps of:
- (a) recording each alphanumeric datum on a data processing support in the form of a first series of machine readable indicia;
- (b) recording on each of said data processing supports a second series of machine readable indicia, the indicia of said second series being related to the indicia of the first series recorded on the same support according to a predetermined objective alphabetic translation code which applies the following translation rules to the letters of said alphanumeric datum:
- (1) a double letter equals a single letter;
- (2) C equals K except:
- CE equals SE
- CI equals SI
- CY equals SI
- CH equals CH
- (3) PH equals F;
- (4) Q equals K;
- (5) Y equals I;
- (6) Z equals S;
- (7) KS, CS and QS equal X;
- (8) H is ignored except in CH and SH;
- (9) U is ignored after Q;
- (10) CH and SH are replaced by Z;
- (c) feeding the thus completed supports into a sorting machine programmed to classify the supports according to the indicia of the second series;
- and
- (d) printing by means of the thus classified supports the data corresponding to the indicia of the first series.
Dependencies are inferred from the claim text.