Describes a system for the automatic coding of most descriptive titles which generates Nested Phrase Indexing System (NEPHIS) input strings of sufficient quality for permuted index production. A series of examples and an 11-item reference list accompany the text. (JL)

An algorithm is proposed to solve the problem of sequential indexing which does not use any grammatical or semantic analysis, but follows the principle of emulating human judgement by evaluation of machine-recognizable attributes of structured word assemblies. (Author)

The implications of some major linguistic and semiotic concepts for the machine manipulation of natural language text are examined. It is proposed that the study of meaning should contribute to the development of sophisticated algorithms for machine indexing. (Author)

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)

A probabilistic model of keyword indexing is outlined, and some of the consequences of the model are examined. An algorithm defining a measure of indexability is developed--a measure intended to reflect the relative significance of words in documents. (Author)

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)

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 development and application of an algorithm that generates non-linear representations of English text. It appears that the representation it produces could be quite useful in automatic language processing. (JB)

Describes the advantages of a prototype retrieval system that uses statistically based ranked retrieval of records rather than traditional boolean methods, especially for end users. Several new techniques are also discussed including bit mapping, pruning, methods of building inverted files, and types of search engine. (26 references) (EAM)

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)

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)

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)

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

Presents an algorithm that automatically extracts words and phrases containing geographic place names or characteristics from a text document and uses them as input to database functions that use spatial reasoning to approximate statistically the geoposition referenced in the text. Preliminary results and future work are discussed. (28 references)…