Descriptor
| Algorithms | 2 |
| Models | 2 |
| Coding | 1 |
| Computer Science | 1 |
| Full Text Databases | 1 |
| Indexes | 1 |
| Information Processing | 1 |
| Markov Processes | 1 |
| Mathematical Formulas | 1 |
| Optical Data Disks | 1 |
| Probability | 1 |
| More ▼ | |
Author
| Bookstein, Abraham | 2 |
| Klein, Shmuel T. | 1 |
| Raita, Timo | 1 |
Publication Type
| Journal Articles | 2 |
| Reports - Descriptive | 1 |
| Reports - Research | 1 |
| Speeches/Meeting Papers | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedBookstein, 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 reviewedBookstein, 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
