Descriptor
Source
Information Processing and… | 84 |
Author
Willett, Peter | 4 |
Croft, W. B. | 3 |
Danilowicz, Czeslaw | 3 |
Bookstein, Abraham | 2 |
Craven, Timothy C. | 2 |
Fawthrop, D. | 2 |
Gordon, Michael D. | 2 |
Kraft, Donald H. | 2 |
Waller, W. G. | 2 |
Yannakoudakis, E. J. | 2 |
Bartschi, Martin | 1 |
More ▼ |
Publication Type
Journal Articles | 79 |
Reports - Research | 58 |
Opinion Papers | 17 |
Reports - Descriptive | 13 |
Information Analyses | 10 |
Speeches/Meeting Papers | 7 |
Reports - General | 2 |
Collected Works - General | 1 |
Reports - Evaluative | 1 |
Education Level
Audience
Researchers | 22 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating

Lorchirachoonkul, Vichit – Information Processing and Management, 1982
The concept of Thai soundex system for name search as method of information retrieval is developed and evaluated by extending and modifying Odell and Russell soundex system to fit specific characteristics of Thai language. Thai consonants, letter codes, and evaluation of system in name file of 61,215 records are highlighted. (EJS)
Descriptors: Algorithms, Consonants, Information Retrieval, Information Systems

Bratley, Paul; Choueka, Yaacov – Information Processing and Management, 1982
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.…
Descriptors: Algorithms, Information Retrieval, Information Storage, Information Systems

Kochtanek, Thomas R. – Information Processing and Management, 1982
Presents an algorithm for use in online information retrieval which will generate a list of bibliographic citations derived from a preselected relevant document and which measures the relatedness of retrieved items to the preselected document. A test of the algorithm in retrieving medical literature is described. Two figures are included. (JL)
Descriptors: Algorithms, Bibliographic Coupling, Bibliographies, Citations (References)

Sechser, Otto – Information Processing and Management, 1982
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…
Descriptors: Algorithms, Indexes, Information Retrieval, Online Systems

Kropp, D.; Walch, G. – Information Processing and Management, 1981
Describes an indexing technique based on overlapping word fragments as reference strings that are linked in a directed graph structure which makes possible exact match-, partial match-, and masked-partial match-retrieval and indicates search strategies for each case. Eight figures, two tables, and nine references are provided. (RBF)
Descriptors: Algorithms, Computer Programs, Coordinate Indexes, Indexing

Spiegler, Israel; Elata, Smadar – Information Processing and Management, 1988
Presents a model for the a priori analysis of natural language queries which uses an algorithm to transform the query into a logical pattern that is used to determine the answerability of the query. The results of testing by a prototype system implemented in PROLOG are discussed. (20 references) (CLB)
Descriptors: Algorithms, Computational Linguistics, Databases, Information Retrieval

Bookstein, Abraham; And Others – Information Processing and Management, 1992
Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)
Descriptors: Algorithms, Coding, Full Text Databases, Indexes

Gordon, Michael D. – Information Processing and Management, 1991
Presents a theoretical rationale for employing a form of information retrieval algorithm that helps searchers better navigate through large document collections by continually revising probability estimates for document subsets. The algorithm avoids assumptions of index term independence and predicts relevance more accurately with increasing…
Descriptors: Algorithms, Feedback, Indexing, Information Needs

Craven, Timothy C. – Information Processing and Management, 1991
Discussion of graph-drawing algorithms compares and evaluates five algorithms for generated automatic graphic display of sentence dependency structures that have been implemented in the TEXTNET text structure management system. Evaluation criteria are discussed, and a test of the algorithms with a database of newspaper articles is described. (16…
Descriptors: Algorithms, Comparative Analysis, Database Management Systems, Databases

Lee, Joon Ho; And Others – Information Processing and Management, 1994
Investigates document ranking methods in thesaurus-based Boolean information retrieval systems and proposes a new thesaurus-based ranking algorithm called the Extended Relevance algorithm. Performance comparisons are made between the Extended Relevance algorithm and previous thesaurus-based ranking algorithms. (Contains 20 references.) (LRW)
Descriptors: Algorithms, Comparative Analysis, Correlation, Information Retrieval

Cohen, Paul R.; Kjeldsen, Rick – Information Processing and Management, 1987
Describes GRANT, an expert system for finding sources of funding given research proposals. The architecture of GRANT and the implementation of constrained spreading activation (a modified search algorithm based on semantic memory) are described, and recall and precision rates are analyzed. (Author/LRW)
Descriptors: Algorithms, Evaluation, Expert Systems, Grants

Crouch, Carolyn J. – Information Processing and Management, 1988
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)
Descriptors: Algorithms, Automatic Indexing, Comparative Analysis, Computational Linguistics

Zaki, M.; Elboraey, F. – Information Processing and Management, 1985
Investigates applicability of inverted file processing in magnetic bubble memories by presenting four magnetic bubble memory models as storage mediums: one based on a major-minor loop configuration; one utilizing a decoder design on a magnetic bubble memory chip; and two based on different structural configurations of the first two. (MBR)
Descriptors: Algorithms, Classification, Computer Storage Devices, Data Processing

Yannakoudakis, E. J.; Fawthrop, D. – Information Processing and Management, 1983
This paper describes an intelligent spelling error correction system for use in a word processing environment. The system employs a dictionary of 93,769 words and, provided the intended word is in the dictionary, it identifies 80 percent to 90 percent of spelling and typing errors. Nine references are cited. (Author/EJS)
Descriptors: Algorithms, Artificial Intelligence, Computer Programs, Dictionaries

Willett, Peter – Information Processing and Management, 1988
Reviews recent research into the use of hierarchic agglomerative clustering methods for document retrieval. The topics discussed include the calculation of interdocument similarities, algorithms used to implement clustering methods on large databases, validity testing of document hierarchies, appropriate search strategies, and other applications…
Descriptors: Algorithms, Bibliometrics, Cluster Analysis, Comparative Analysis