To read this content please select one of the options below:

REDUCING THE PERILS OF MERGING BOOLEAN AND WEIGHTED RETRIEVAL SYSTEMS

TADEUSZ RADECKI (Postgraduate School of Librarianship and Information Science, University of Sheffield)

Journal of Documentation

ISSN: 0022-0418

Article publication date: 1 March 1982

54

Abstract

A need for developing an information retrieval technique maintaining the appeal of Boolean retrieval schemes and in addition providing the advantages of a ranked search output has been pointed out in the literature for many years. However, a previous attempt to incorporate into the Boolean retrieval schemes a weighting mechanism to produce ranked lists of documents has not been fully successful. Specifically, further research has demonstrated that the theory behind the previous approach is characterized by disturbing ambiguities and inconsistencies, with equivalent Boolean search request formulations yielding different rankings of documents retrieved. As a result of this more recent research an alternative approach has been outlined. However, a closer analysis of this second approach reveals that it is also not free from some intrinsic weaknesses. The present paper provides the results of this new analysis and suggests a more rigorous methodology.

Citation

RADECKI, T. (1982), "REDUCING THE PERILS OF MERGING BOOLEAN AND WEIGHTED RETRIEVAL SYSTEMS", Journal of Documentation, Vol. 38 No. 3, pp. 207-211. https://doi.org/10.1108/eb026729

Publisher

:

MCB UP Ltd

Copyright © 1982, MCB UP Limited

Related articles