This study offers an analysis and comparison of search results from Google concerning the topic of Artificial Intelligence (AI) in two geographically and politically different contexts: the United States and Italy. As new AI systems, tools, and solutions are developed and implemented in each sector of human life on a global scale, certain…

Investigates techniques for automatic coding of English language strings which involve titles drawn from bibliographic files, but do not require prior knowledge of source. Coding methods (basic, maximum entropy principle), results of test using 6,260 titles from British National Bibliography, and variations in code element ordering are…

Frequently it is useful to abbreviate or otherwise transform keys used for information retrieval. Given a transformation algorithm and data to be transformed, certain qualities of the algorithm relating to retrieval problems can be characterized. This paper gives some measures of effectiveness of such transformation algorithms. (11 references)…

Proof is given of the equivalence of Boolean and weighted search methods. (Author)

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)

Enriching factor rotation algorithms with the capacity to conduct repeated searches from random starting points can make the tendency to converge to optima that are merely local a way to catch rotations of the input factors that might otherwise elude discovery. Use of the HYBALL computer program is discussed. (SLD)

Discusses the role of search engines in Web usability and analyzes and evaluates the retrieval effectiveness of various indexing and searching strategies on a new Web text collection. Highlights include preprocessing techniques that might improve retrieval effectiveness; and hyperlinks as useful sources of evidence in improving retrieval…

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

Addresses the problem of systematic biases which affect the way that individuals construct and modify search queries on online retrieval systems, and suggests a searching algorithm that helps to avoid the effect of those biases. (FM)

Discussion of knowledge management for electronic data focuses on creating a high quality similarity ranking algorithm. Topics include similarity ranking and unstructured data management; searching, categorization, and summarization of documents; query evaluation; considering sentences in addition to keywords; and vector models. (LRW)

Presents a model of information retrieval based on plausible inference which suggests that techniques should be found for combining multiple search strategies into an overall assessment of a document's relevance. The results of experiments designed to test this approach using a simple spreading activation search are discussed. (21 references) (CLB)

Explains, with supporting figures and flowcharts of programing logic, two search strategies introduced to the MORPHS System since 1976: one that employs the normal Boolean operators in strings without bracketing or in the form of marked steps, and one that treats a string of keywords as a compound word. (Author/JD)

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)

Describes the design of a stemming algorithm for searching Latin text databases. The algorithm uses a longest-match approach with some recoding but differs from most stemmers in its use of two separate suffix dictionaries for processing query and database words that enables users to pursue specific searches for single grammatical forms of words.…

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)