Describes a microcomputer-based string index format generated from concept networks using multiple search terms. Link weighting is highlighted as a method to decide which term appears first so the entry reflects the classification implied by the search specification. The computer software used for this system is briefly described. (Author/LRW)

Describes an algorithm for the calculation of term discrimination values that may be used when the interdocument similarity measure used is the cosine coefficient and when the document representations have been weighted using one particular term weighting scheme. (7 references) (Author/CLB)

Discussion of index construction for large text collections highlights a new indexing algorithm designed to create large compressed inverted indexes "in situ." Topics include a computational model, inversion, index compression, merging, experimental test results, effect on retrieval performance, memory restrictions, and dynamic…

Describes the two basic approaches to the calculation of term discrimination values for automatic indexing. The results of an experiment that investigated the differences between algorithms of these two approaches in terms of their impact on the discrimination value model are reported and discussed. (13 references) (Author/CLB)

Presents an approach to automatic matching and linkage of citations between databases which applied 14 coding techniques and measured their effectiveness in terms of efficiency of retrieval of duplicates with minimal false hits, reliability, and performance. (EAM)

Discusses the effect of including relevance data on the calculation of term discrimination values in bibliographic databases. Algorithms that calculate the ability of index terms to discriminate between relevant and non-relevant documents are described and tested. The results are discussed in terms of the relationship between term frequency and…

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)

Demonstrates efficiency of preparation of query description using semantic analyser method based on analysis of semantic structure of documents in field of automatic indexing. Results obtained are compared with automatic indexing results performed by traditional methods and results of indexing done by human indexers. Sample terms and codes are…

Describes two computer programs--INDEX and INDEXD--that use statistical information about repeated phrases in documents to automatically index documents at the conceptual level. Sample output of the programs is provided, and plans to combine this method with linguistic and artificial intelligence techniques to provide a general conceptual…

Describes and discusses the findings of an experiment that tested the precision of full-text retrieval enhanced by 29 document term weighting algorithms at the lowest, middle, and highest levels of recall, and compared with the precision of full-text retrieval without algorithms and with paragraph retrieval. (29 references) (Author/CLB)

The major advantage of sequential classification, a technique for automatically classifying documents into previously selected categories, is that the entire document need not be processed before it is classified. This method assumes the availability of a priori categories, a selection of keywords representative of these categories, and the a…

Discusses suffix stripping algorithms used in information retrieval to cluster words derived from a common root under the same stem, and proposes a suffixing algorithm for French which uses grammatical categories to enhance the stemming process. An evaluation of the algorithm is discussed, and an analysis of errors is described. (17 references)…

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)

The feasibility of using a distance measure, called the Bayesian distance, for automatic sequential document classification was studied. Results indicate that, by observing the variation of this distance measure as keywords are extracted sequentially from a document, the occurrence of noisy keywords may be detected. This property of the distance…

Investigates techniques for automatic classification of book material focusing on: computer-based surrogation of monographic material, book surrogate clustering on basis of content association, evaluation of resultant classifications. Test collection (250 books) is described with surrogation by means of back-of-the-book index, table of contents,…