The design of programs to search large document data bases is discussed with regard to the use of compression coding combined with adoption of word fragments as the basic language elements. An algorithm is described for determination of a set of almost equifrequent fragments. Its efficiency is tested. (23 references) (Author)

The benefits of utilizing text compression for CAI are evaluated, and an analysis of core storage, decoding, and CPU time are presented for the PDP-10 system. (RAO)

Questions of the automation of input, output and data processing on computers in systems of information services are covered in the discussion of peculiarities of applied computers and processed information, general characteristics of processing algorithms and problems of information input and output. This is followed by a discussion of the…

Three specific contributions to the field of information retrieval are presented. The first two describe the establishment of an adaptive, interactive man-machine dialogue that produces a form of unsolicited librarian-like assistance for the user in his selection of index terms to characterize an indexing function. The data set upon which the…

A relational data system (RDS) is one that has the capability not only to retrieve specific facts but also the ability to deduce facts that are implicit rather than explicit in the data base. The study investigated the application of RDS technology to intelligence data processing. RDS technology and the nature of intelligence data processing are…

The twenty-second in a series, this report describes research in information organization and retrieval conducted by the Department of Computer Science at Cornell University. The report covers work carried out during the period summer 1972 through summer 1974 and is divided into four parts: indexing theory, automatic content analysis, feedback…