NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 3 results Save | Export
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
Ellis, David; And Others – Journal of Documentation, 1994
Describes a study in which several different sets of hypertext links are inserted by different people in full-text documents. The degree of similarity between the sets is measured using coefficients and topological indices. As in comparable studies of inter-indexer consistency, the sets of links used by different people showed little similarity.…
Descriptors: Full Text Databases, Hypermedia, Information Retrieval, Mathematical Formulas
Peer reviewed Peer reviewed
Pearce, Claudia; Nicholas, Charles – Journal of the American Society for Information Science, 1996
Presents experimentation results for the TELLTALE system, a dynamic hypertext environment that provides full-text search from a hypertext-style user interface for text corpora that may be garbled by OCR (optical character recognition) or transmission errors, and that may contain languages other than English. (Author/LRW)
Descriptors: Character Recognition, Full Text Databases, Hypermedia, Information Retrieval