Automatic assignment of soft Boolean operators

Authors:
Gerard Salton;Ellen Voorhees
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY;Department of Computer Science, Cornell University, Ithaca, NY
Venue:
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Year:
1985

Citing 5
Cited 5

Extended Boolean information retrieval

Communications of the ACM
A comparison of search term weighting: term relevance vs. inverse document frequency

SIGIR '81 Proceedings of the 4th annual international ACM SIGIR conference on Information storage and retrieval: theoretical issues in information retrieval
Introduction to Modern Information Retrieval

Introduction to Modern Information Retrieval
On query formulation in information retrieval

On query formulation in information retrieval
The SMART Retrieval System—Experiments in Automatic Document Processing

The SMART Retrieval System—Experiments in Automatic Document Processing

Writing to be searched: A workshop on document creation principles

ACM SIGIR Forum
Rough sets and information retrieval

SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
On extending the vector space model for Boolean query processing

Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Applying fuzzy sets and rough sets as metric for vagueness and uncertainty in information retrieval systems

ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.