OpenRaiser/Intern-Atlas huggingface dataset:
Optimization of Inverted Vector Searches
Authors: Chris Buckley, A. F. Lewit
Venue: SIGIR
Year: 1985

A simple algorithm is presented for increasing the efficiency of information retrieval searches which are implemented using inverted files. This optimization algorithm employs knowledge about the methods used for weighting document and query terms in order to examine as few inverted lists as possible. An extension to the basic algorithm allows greatly increased performance optimization at a modest cost in retrieval effectiveness. Experimental runs are made examining several different term weighting models and showing the optimization possible with each.
Concepts of the Cover-Coefficient-Based Clustering Methodology
Authors: Fazli Can, Esen A. Ozkarahan
Venue: SIGIR
Year: 1985

Document clustering has several unresolved problems. Among them are high time and space complexity, difficulty of determining similarity thresholds, order dependence, nonuniform document distribution in clusters, and arbitrariness in determination of various cluster intiators. To overcome these problems to some degree, the cover coefficient based clustering methodology has been introduced. The concepts used in this methodology have created certain new concepts, relationships, and measures such as the effect of indexing on clustering, an optimal vocabulary generation for indexing, and a new matching function. These new concepts are discussed. The result of performance experiments that show the effectiveness of the clustering methodology and the matching function are also included. In these experiments, it has been also observed that the majority of the documents obtained in a search are concentrated in a few clusters containing a low percentage of documents of the database.
A Conceptual Model aod Experiments on How People Classify and Retrieve Documents
Authors: Alberto J. Cañas, Frank R. Safayeni, David W. Conrath
Venue: SIGIR
Year: 1985

Article Free Access Share on A conceptual model and experiments on how people classify and retrieve documents Authors: Alberto J. Cañas Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2L 3G1 Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2L 3G1View Profile , Frank R. Safayeni Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2L 3G1 Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2L 3G1View Profile , David W. Conrath Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2L 3G1 Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2L 3G1View Profile Authors Info & Claims SIGIR '85: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrievalJune 1985Pages 282–287https://doi.org/10.1145/253495.253535Published:05 June 1985Publication History 0citation325DownloadsMetricsTotal Citations0Total Downloads325Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Processing Free-Text Input to Obtain a Database of Medical Information
Authors: Emile C. Chi, Carol Friedman, Naomi Sager, Margaret S. Lyman
Venue: SIGIR
Year: 1985

The Linguistic String Project of New York University has developed computer programs that convert the information in free-text documents of a technical specialty into a structured form suitable for mapping into a relational database. The processing is based upon the restrictions on the use of language that are characteristic of the subject matter and the document type. These restrictions are summarized in a “sublanguage grammar” that provides a set of word classes and formulas corresponding to the objects and relations of interest in the domain. The programs are independent of the particular sublanguage grammar employed. The application to narrative patient records will be described and the applicability of the methods to other domains discussed.
Efficient Variants of Huffman Codes in High Level Languages
Authors: Yaacov Choueka, Shmuel T. Klein, Yehoshua Perl
Venue: SIGIR
Year: 1985

Although it is well-known that Huffman Codes are optimal for text compression in a character-per-character encoding scheme, they are seldom used in practical situations since they require a bit-per-bit decoding algorithm, which has to be written in some assembly language, and will perform rather slowly. A number of methods are presented that avoid these difficulties. The decoding algorithms efficiently process the encoded string on a byte-per-byte basis, are faster than the original algorithm, and can be programmed in any high level language. This is achieved at the cost of storing some tables in the internal memory, but with no loss in the compression savings of the optimal Huffman codes. The internal memory space needed can be reduced either at the cost of increased processing time, or by using non-binary Huffman codes, which give sub-optimal compression. Experimental results for English and Hebrew text are also presented.
One-Time Complete Indexing of Text: Theory and Practice
Authors: Raymond J. D&apos, Amore, Clinton P. Mah
Venue: SIGIR
Year: 1985

Indexing according to occurrences of selected word fragments, called “n-grams”, offers a significant alternative to keyword indexing and full text scanning methods in the design of information systems based on documents. Finite sets of n-grams can be selected to allow effective fixed indexing of all words, numbers, and special terms in text. The characteristics of such indexing can be modeled statistically and validated over a wide range of text. The model provides a descriptive and predictive tool for controlling precision and recall in searching and for scaling estimates of relevance to an adaptive reference noise distribution for a target collection. Special techniques such as partial inversion of index terms, probabilistic ordering of index terms, and various types of data compression allow n-gram indexing to be competitive in performance with other approaches.
Different Levels of Expertise for An Expert System in Information Retrieval
Authors: Bruno Defude
Venue: SIGIR
Year: 1985

Article Different levels of expertise for an expert system in information retrieval Share on Author: B. Defude Groupe "Systèmes Intelligents de Recherche, d'Informations", Laboratoire Génie Informatique, Institut IMAG Grenoble, BP 68 38402, St Martin D'Heres, Cedex, France Groupe "Systèmes Intelligents de Recherche, d'Informations", Laboratoire Génie Informatique, Institut IMAG Grenoble, BP 68 38402, St Martin D'Heres, Cedex, FranceView Profile Authors Info & Claims SIGIR '85: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrievalJune 1985 Pages 147–153https://doi.org/10.1145/253495.253520Online:05 June 1985Publication History 7citation248DownloadsMetricsTotal Citations7Total Downloads248Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Composite Document Extended Retrieval - An Overview
Authors: Edward A. Fox
Venue: SIGIR
Year: 1985

Experimental information retrieval (IR) systems, some dating back to the sixties, have demonstrated the viability of fully automatic document storage and retrieval methodologies with small to medium size bibliographic collections [72]. Many of these experimental systems utilize the vector space model in which each important term (such as a word stem) identifies a different dimension in a space, so that matrix methods and vector operations can be defined on queries and documents. Statistical techniques have been very effective, and probabilistic enhancements have given additional improvements [84]. However, the basic vector space model is oriented towards recording the essential information in the text of a title/abstract combination rather than describing more complex document structures. It is necessary to extend the model in order to handle composite documents.
A Testbed for Information Retrieval Research: The Utah Retrieval System Architecture
Authors: Lee A. Hollaar
Venue: SIGIR
Year: 1985

The Utah Retrieval System Architecture provides an excellent testbed for the development and testing of new algorithms or techniques for information retrieval. URSA™ is a message-based structure capable of running on a variety of system configurations, ranging from a single mainframe processor to a system distributed across a number of dissimilar processors. It can readily support a variety of specialized backend processors, such as high-speed search engines.
Optimization of a Hierarchical File Organization for Spelling Correction
Authors: Tetsuro Ito, Clement T. Yu
Venue: SIGIR
Year: 1985

A spelling program using a hierarchically organized file seems to be promising, since it can correct more than common typing mistakes. However, its speed of detecting spelling errors in the inputs is rather slow. Here some techniques of modifying the program to improve the speed are presented.
On Retrieval Tests with an Inhomogeneous Query Collection
Authors: Friedbert Jochum
Venue: SIGIR
Year: 1985

Retrieval tests are often performed with an inhomogeneous query collection, that means certain properties of queries vary within the collection. This paper investigates under which conditions this inhomogeneity may lead to a loss of measurement precision and validity and should be controlled by an experimental design. In particular, interrelationships between the design of a retrieval test, inhomogeneity of the query collection and measurement theoretical properties of the evaluation measure will be discussed. Based on these results, some recommendations for experimental design of retrieval tests are presented.
Theoretical Measures in P/Q Document Spaces
Authors: Robert R. Korfhage
Venue: SIGIR
Year: 1985

Early work on the application of user interest profiles to aid in the interpretation of queries in an information retrieval system developed the concepts of retrieval subspaces that are either ellipsoids or Cassini ovals. This report extends the theoretical basis of these models, exploring other models and the effect of different metrics on the conceptual retrieval subspace.
Experiments with Cited Titles for Automatic Document Indexing and Similarity Measure in a Probabilistic Context
Authors: K. L. Kwok
Venue: SIGIR
Year: 1985

Most people will agree that the ultlmate goal of an Information retrleval (IR) system wouIcl be to Incorporate as much artificial
An Integrated Hierarchical File Organization for Data Selection and Retrieval
Authors: Sau-Lan Lee
Venue: SIGIR
Year: 1985

This paper presents an approach, the IHF approach, of organising data of a hierarchical structure into one single file, maintaining adequate representation of the relationships among the data. The IHF approach requires each data item be stored in the basic form of name-value pair and consists in assigning each data item with identifier which provides not only the data item identification but also an implicit identification of the hierarchical structural relationships among groups of data items. Data selection and retrieval operations are effectively implemented with the concept of masking of relevant identifier bits, without resorting to any linking devices. Application of the IHF technique on CAFS is examined.
Graphical Information Resources: Maps and Beyond
Authors: Michael Lesk
Venue: SIGIR
Year: 1985

The rise of computer graphics offers a new challenge for information retrieval: how to search and retrieve information which is partly or wholly graphical. As an example, procedures for handling geographical information, such as street maps and directories are explained. With this data, it is possible to find routes on maps, retrieve locations and names of people or businesses, and draw maps. But a comparison of these programs with programs for face processing or computer typesetting makes clear how far we are from general purpose routines. Today successful graphics routines contain a great deal of local domain knowledge. There is no analog of the simple keyword systems that handle textual documents in any subject area. Just as computational linguists have found that subject matter expertise is necessary to do really sophisticated processing of English, it seems also necessary to sophisticated processing of pictures; the difference is that we don't know how to do unsophisticated processing of graphics.
An Approach to Multikey Sequencing in an Equiprobable Keyterm Retrieval Situation
Authors: Barry G. T. Lowden
Venue: SIGIR
Year: 1985

We present a simple generalised technique, for sequencing a multi-attribute file, which can be used in a situation where the query pattern is unknown and the term content equiprobable. The method is based on constructing a short spanning path through the records thereby minimising the sum of the Hamming distances between them. Retrieval performance is simulated over a range of query expressions and results suggest a significant reduction in the number of block accesses, using this technique, as compared with records randomly distributed over the file space.
Handling Multiple Databases in Document Retrieval
Authors: I. McLeod
Venue: SIGIR
Year: 1985

There is no such thing as a standard document. Bibliographic information comes in a wide variety of formats. Existing retrieval systems handle different document styles either by creating an artificial document type or by providing different and independent data bases. Neither approach seems satisfactory. In this paper we describe a data model which we feel is more appropriate for document representation and show it can handle the multiple document type problem quite naturally.
Automatic Assignment of Soft Boolean Operators
Authors: Gerard Salton, Ellen M. Voorhees
Venue: SIGIR
Year: 1985

The conventional bibliographic retrieval systems are based on Boolean query formulations and inverted file implementations. Such systems provide rapid responses in answer to search queries but they are not easy to use by uninitiated patrons. An extended Boolean retrieval strategy has been devised in which the Boolean operators are treated more or less strictly, depending on the setting of a special parameter, known as the p-value. The extended system is much more forgiving than the conventional system, and provides better retrieval effectiveness. In this study various problems associated with the determination of appropriate p-values are discussed, and suggestions are made for an automatic assignment of p-values. Evaluation output is included to illustrate the operations of the suggested procedures.
The New English Oxford English Dictionary and its Potential Users: Some Preliminary Comments
Authors: J. O. Stubbs
Venue: SIGIR
Year: 1985

Article Free Access Share on The New Oxford English Dictionary and its potential users: some preliminary comments Author: John Stubbs Waterloo Centre for the New OED, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1 Waterloo Centre for the New OED, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1View Profile Authors Info & Claims SIGIR '85: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrievalJune 1985 Pages 78–81https://doi.org/10.1145/253495.253512Online:05 June 1985Publication History 1citation370DownloadsMetricsTotal Citations1Total Downloads370Last 12 Months5Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
ANNOD - A Navigator of Natural-language Organized (Textual) Data
Authors: R. E. Williamson
Venue: SIGIR
Year: 1985

ANNOD is the name of a system developed at the National Library of Medicine (NLM), which implements a set of linguistic and empirical techniques that permit retrieval of natural language information in response to natural language queries. The system is based on Dr. Gerard Salton's SMART [1] document retrieval system and is presently implemented on a mini-computer as part of an Interactive TExt Management System, ITEMS.[2] Actual experience with retrieval of information from NLM's Hepatitis Knowledge Base (HKB), an encyclopedic hierarchical, full-text file, is presented. The techniques used in ANNOD include: automatic stemming of words, common word deletion, thesaurus expansion, a complex empirical matching (ranking) algorithm (similarity measure), and techniques expressly designed to permit rapid response in a mini-computer environment. Preliminary testing demonstrates high efficiency in identifying portions of a text which are relevant to users.
Generalized Vector Space Model in Information Retrieval
Authors: S. K. Michael Wong, Wojciech Ziarko, P. C. N. Wong
Venue: SIGIR
Year: 1985

In information retrieval, it is common to model index terms and documents as vectors in a suitably defined vector space. The main difficulty with this approach is that the explicit representation of term vectors is not known a priori. For this reason, the vector space model adopted by Salton for the SMART system treats the terms as a set of orthogonal vectors. In such a model it is often necessary to adopt a separate, corrective procedure to take into account the correlations between terms. In this paper, we propose a systematic method (the generalized vector space model) to compute term correlations directly from automatic indexing scheme. We also demonstrate how such correlations can be included with minimal modification in the existing vector based information retrieval systems. The preliminary experimental results obtained from the new model are very encouraging.
Adaptive Document Clustering
Authors: Clement T. Yu
Venue: SIGIR
Year: 1985

Article Free Access Share on Adaptive document clustering Authors: C. T. Yu Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, IL Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, ILView Profile , Y. T. Wang Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, IL Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, ILView Profile , C. H. Chen Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, IL Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, ILView Profile Authors Info & Claims SIGIR '85: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrievalJune 1985Pages 197–203https://doi.org/10.1145/253495.253525Published:05 June 1985Publication History 21citation390DownloadsMetricsTotal Citations21Total Downloads390Last 12 Months11Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Using Structural Representations of Anomalous States of Knowledge for Choosing Document Retrieval Strategies
Authors: Nicholas J. Belkin, Barbara H. Kwasnik
Venue: SIGIR
Year: 1986

We report on a project which attempts to classify representations of the anomalous states of knowledge (ASKs) of users of document retrieval systems on the basis of structural characteristics of the representations, and which specifies different retrieval strategies and ranking mechanisms for each ASK class. The classification and retrieval strategy specification is based on 53 real problem statements, 35 of which have a total of 250 evaluated documents. Four facets of the ASK structures have been tentatively identified, whose combinations determine the method and order of application of five basic ranking strategies. This work is still in progress, so results presented here are incomplete.
COREL - A Conceptual Retrieval System
Authors: M. Kathryn Di Benigno, George R. Cross, Cary deBessonet
Venue: SIGIR
Year: 1986

Article Free Access Share on COREL: a conceptual retrieval system Authors: M. Kathryn Di Benigno JAYCOR, c/o Naval Research Laboratory, NOARAI - Code 7510, Washington, D.C. and Computer Science Department, Louisiana State University, Baton Rouge, LA JAYCOR, c/o Naval Research Laboratory, NOARAI - Code 7510, Washington, D.C. and Computer Science Department, Louisiana State University, Baton Rouge, LAView Profile , George R. Cross Computer Science Department, Washington State University, Pullman, WA Computer Science Department, Washington State University, Pullman, WAView Profile , Cary G. de Bessonet Law and AI Project, Louisiana State Law Institute, LSU Law Center, University Station, Baton Rouge, LA Law and AI Project, Louisiana State Law Institute, LSU Law Center, University Station, Baton Rouge, LAView Profile Authors Info & Claims SIGIR '86: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrievalSeptember 1986 Pages 144–148https://doi.org/10.1145/253168.253199Published:01 September 1986Publication History 6citation265DownloadsMetricsTotal Citations6Total Downloads265Last 12 Months12Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Solving Grammatical Ambiguities within a Surface Syntactical Parser for Automatic Indexing
Authors: Catherine Berrut, Patrick Palmer
Venue: SIGIR
Year: 1986

This paper describes linguistic tools specifically designed for performant automatic indexing of natural language texts. By performant indexing, we mean the ability of the system to extract noun phrases (considered as main conceptual frames regarding text content) without processing full syntactic analysis of sentences (surface analyzer) both with its ability in learning unknown words. The paper describes the overall principles of this parser, emphasizing the use of syntactic networks and precedence matrix to fulfil the above goals of reducing the analysis cost and infering new vocabularies without interrupting the indexing process.