Discusses vectors used in information retrieval and the algorithms used to manipulate them. Uses the Kohonen neural algorithm and a fuzzification model to perform a fuzzy clustering of document terms to reduce the high dimension and presents results from a test database. (Author/LRW)

The index entries generated by the Selective Listing in Combinations (SLIC) technique constitute a lattice which is a subset of the power set of the set of descriptors assigned to a document and this fact leads to an improved algorithm for generating SLIC entries. (Author/MF)

Discusses information retrieval systems and extracting appropriate keywords from documents and proposes an effective substring search method by extending a pattern matching machine for multi-keywords called delayed keyword extraction (DKE). Also proposes a construction algorithm of the retrieval structure for speeding up the substring search.…

The error-correcting algorithm described was constructed to examine subject headings in online catalog records for common errors such as omission, addition, substitution, and transposition errors, and to make needed changes. Essentially, the algorithm searches the authority file for a record whose primary key exactly matches the test key. If an…

Proposes an approach to incorporate term similarity and inverse document frequency into a logical model of information retrieval. Highlights include document representation and matching; incorporating term similarity into the measure of distance; new algorithms for implementation; inverse document frequency; and logical versus classical models of…

Describes the development of a structural model of document retrieval based on lexical-semantic relationships between index terms. An algorithm that uses tree-to-tree distance to measure structural closeness between a document and a query statement is explained, and the proposed model is compared to a vector retrieval model. (18 references) (LRW)

Discussion of query processing focuses on techniques developed by LEXIS-NEXIS for identifying key concepts, selecting synonyms and related terms, and detecting phrases that can be combined to increase recall and precision. Describes experiments in the ad hoc track of the sixth TREC (Text Retrieval Conference), including the use of ranking…

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 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)

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)

Describes a prototype system for interactive knowledge-based indexing of the medical literature. Topics covered include current indexing practice; knowledge-based systems using frames; various types of assistance provided by the prototype system; and current research activities and plans for the development of the system. (17 references) (CLB)

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)

Presents uniform and efficient approach for processing all truncated query terms in information retrieval which requires one disk access to obtain from the permuted dictionary all strings represented by truncated term. The problem of the overhead storage required to implement the permuted dictionary is discussed. Fifteen references are provided.…

Analyzes the formal properties, structural consequences, similarities, and differences of link indicators, brackets, and cohesion separators in the query languages employed in information retrieval. Eleven figures, a 32-item reference list, and appendices on Extended Backus Notation and the formal definition of the Formal Relevance Language are…