Descriptor
| Algorithms | 2 |
| Abstracts | 1 |
| Computer Science | 1 |
| Full Text Databases | 1 |
| Hypermedia | 1 |
| Information Retrieval | 1 |
| Markov Processes | 1 |
| Models | 1 |
| Probability | 1 |
| Program Implementation | 1 |
| Relevance (Information… | 1 |
| More ▼ | |
Author
| Klein, Shmuel T. | 2 |
| Bookstein, Abraham | 1 |
| Fraenkel, Aviezri S. | 1 |
| Raita, Timo | 1 |
Publication Type
| Journal Articles | 2 |
| Reports - Descriptive | 2 |
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 reviewedFraenkel, Aviezri S.; Klein, Shmuel T. – Journal of the American Society for Information Science, 1999
Investigates methods for the correct and efficient handling of annotations in a full-text information-retrieval system in a hypertext environment. Goals were to increase relevant items retrieved, reduce non-relevant items, permit selective retrieval, and to explore the notion of distance between words as given in the distance-evaluation algorithm.…
Descriptors: Abstracts, Algorithms, Full Text Databases, Hypermedia
