Presents a dynamic model of user behavior when scanning an information storage and retrieval system output list, compares rules for determining the user's optimum stopping point, presents an algorithm for implementing the Bayesian model, and discusses implications for retrieval system design. Provided are 13 figures and 15 references. (Author/RBF)

Describes a fast algorithm for comparing the lists of terms representing documents in automatic classification experiments. Complexity and running time for the algorithm are compared to other procedures, and a short algol-like routine is presented in the appendix. Eight references are included. (Author/BK)

Explores potential of mathematical theory of communication for information science and examines question of how to encode a message at time it is encountered for subsequent recall. Examples of problem, a prototype computer program and experiment, coding as embedding in associational nets, and nature of information are discussed. (Nine references.)…

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…

Discussion of relevancy in information retrieval systems focuses on an analysis of the efficiency of various cluster-based retrieval (CBR) strategies. A method for combining CBR and inverted index search is proposed that is cost effective in terms of time efficiency; and results of experiments are reported. (Contains 32 references.) (LRW)

Presents methods of information query building in selective dissemination of information systems based on user's publications and examines possible compatibility between user's information queries and his publications. Methods of information query construction determined by logical operators AND, OR, NOT and set of weighted keywords are described.…

Study results indicate that it is feasible to develop automatic name recognition algorithms to distinguish character strings representing names from other character strings occurring in English language titles. This finding offers cautious promise for alleviating some of the labor intensive work of cataloging. (16 references) (Author/SD)

Evaluates and compares two recently proposed automatic methods for relevance feedback of Boolean queries (Dillon method, which uses probabilistic approach as basis, and disjunctive normal form method). Conclusions are drawn concerning the use of effective feedback methods in a Boolean query environment. Nineteen references are included. (EJS)