Proposes that error rates in indexing using string index languages such as NEPHIS might be reduced at relatively low cost by having the indexer enter strings via a microcomputer system which could provide simple validation and feedback in the form of graphic displays of concept links. (Author/FM)

Presents a modification function for weights of descriptors for documents in fuzzy retrieval systems which includes some desirable properties that are lacking in the model proposed by Choros and Danilowicz in their study on relative indexing. (MBR)

Surveys the current state of minicomputer-operated information systems capable of incorporating linguistic features, focusing on the Minicomputer Operated Retrieval (Partially Heuristic) System. Consideration is given to the automation of the indexing process and to available search strategies. (FM)

Presents principles for determining profile of a system user based on analysis of co-occurrence of index terms in queries and pertinent documents. A procedure for determining index term weights, the information value of which depends on the degree of homogeneity of system users, is introduced. Three references are cited. (EJS)

Following a discussion of derivative versus assignment indexing, use of roles, and concept behind Preserved Concept Indexing System, features of PERMDEX (microcomputer program to assist in creation of permuted printed index) are described including indexer input and prompts, the shunting algorithm, and sorting and printing routines. Fourteen…

Describes an indexing technique based on overlapping word fragments as reference strings that are linked in a directed graph structure which makes possible exact match-, partial match-, and masked-partial match-retrieval and indicates search strategies for each case. Eight figures, two tables, and nine references are provided. (RBF)

Presents a theoretical rationale for employing a form of information retrieval algorithm that helps searchers better navigate through large document collections by continually revising probability estimates for document subsets. The algorithm avoids assumptions of index term independence and predicts relevance more accurately with increasing…

Describes the use of a highly parallel array processor for pattern matching operations in a bibliographic retrieval system. The discussion covers the hardware and software features of the processor, the pattern matching algorithm used, and the results of experimental tests of the system. (37 references) (Author/CLB)

Zipfian laws for frequency distributions of word pairs and longer phrases are derived from text sample analysis. From crossing of Zipfian curves, it is deduced that number of multi-word phrases that occur frequently in text is surprisingly small, of same order of magnitude as number of individual word-types. (8 references) (EJS)

Discusses methods of weighting of descriptors in document search patterns together with the concept of relative indexing and conditions which should be satisfied by descriptor weight. A procedure for modifiying document search patterns based on users' informational needs and opinions is outlined, and examples are given. Sixteen references are…

The six papers that comprise this document deal with topics related to the National Institute for Occupational Safety and Health (NIOSH) and/or its online document retrieval system, NIOSHTIC. Specific subjects include: (1) a method to catalog multiple sources of NIOSH publications for dissemination; (2) an input rejection algorithm used to provide…