Describes an approach that combines concepts from information retrieval, fuzzy set theory, and genetic programing to improve weighted Boolean query formulation via relevance feedback. Highlights include background on information retrieval systems; genetic algorithms; subproblem formulation; and preliminary results based on a testbed. (Contains 12…

Reports on the validity of the Multiple Poisson (nP) model of word distribution in full-text document collections. A practical algorithm for determining whether a certain word is distributed according to an nP distribution and the results of a test of this algorithm in three different document collections are described. (14 references) (KRN)

Describes the theoretical framework of a retrieval system that uses data structures called bitmaps to improve search algorithms for medium-sized systems. Information retrieval systems that contain the full text of the documents are discussed, and the use of inverted files such as concordances for small texts is explained. (24 references) (LRW)

This issue contains nine articles that provide an overview of trends and research in parallel information retrieval. Topics discussed include network design for text searching; the Connection Machine System; PThomas, an adaptive information retrieval system on the Connection Machine; algorithms for document clustering; and system architecture for…

Describes fast, dynamic update algorithms for document retrieval systems. B-trees are discussed; the M-B-T file directory structure is explained; insertions and deletions in inverted files are described; and performance evaluation is discussed. An appendix provides the formal definition of an M-B-T directory. (Contains 18 references.) (LRW)

Presents a relevance-feedback strategy that improves the effectiveness of information-retrieval systems based on back-propagation of the relevance of retrieved documents using an algorithm developed in a neural approach. Describes a neural information-retrieval model and reports results obtained with the algorithm in three different environments.…

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.…

Presents a new stemming algorithm based on tree structures that improves relevance in information retrieval by conflation, grouping similar words into a single term. Highlights include the normalization process used in automatic thesaurus construction; theoretical aspects; the normalization algorithm; and experiments with English and Spanish. (LRW)

"The Handbook of Latent Semantic Analysis" is the authoritative reference for the theory behind Latent Semantic Analysis (LSA), a burgeoning mathematical method used to analyze how words make meaning, with the desired outcome to program machines to understand human commands via natural language rather than strict programming protocols.…

Using macro and micro-structure analysis of large files of personal author names, this study developed retrieval techniques and algorithms to automatically correct and/or flag typographical errors in names, identify names in a database that are similar to a name entered by a user during a search, and measure similarities between names. It was…

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)

A straightforward procedure for performing weighted-term searches can be programmed quickly and easily, and the same general algorithm can be used for either on-line or batch mode searching. The method can be used to do whole text searches as well as conventional searches for index terms or other descriptors. (5 references) (Author/NH)

Proper name matching schemes are reviewed and an updated version of these schemes is tested on a suburban telephone book. (Author/AB)

Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

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)