NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 3 results Save | Export
Peer reviewed Peer reviewed
Bookstein, Abraham; Klein, Shmuel T.; Raita, Timo – Information Processing & Management, 1997
Discussion of text compression focuses on a method to reduce the amount of storage needed to represent a Markov model with an extended alphabet, by applying a clustering scheme that brings together similar states. Highlights include probability vectors; algorithms; implementation details; and experimental data with natural languages. (Author/LRW)
Descriptors: Algorithms, Computer Science, Markov Processes, Models
Peer reviewed Peer reviewed
Bookstein, Abraham; And Others – Information Processing and Management, 1992
Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)
Descriptors: Algorithms, Coding, Full Text Databases, Indexes
Peer reviewed Peer reviewed
Bookstein, Abraham; And Others – Information Processing and Management, 1992
Describes the use of loglinear statistical models in the field of informetrics, especially for the analysis of information systems. A detailed example is given of developing a model based on loglinear analysis to determine book acquisition patterns in libraries, including mathematical considerations and algorithms. (19 references) (LRW)
Descriptors: Algorithms, Information Retrieval, Information Science, Information Systems