Advertisement

Evaluating Weighted Search Terms as Boolean Queries

  • H. P. Frei
  • S. Meienberg
Part of the Informatik-Fachberichte book series (INFORMATIK, volume 289)

Abstract

A method for automatically generating Boolean queries from weighted search terms is described. The method is intended to exploit traditional Boolean Information Retrieval Systems in a more user-friendly way. In addition, the method partitions the answer set delivered by the Boolean system into sorted subsets of information items. This, in turn, allows control of the size of an answer set by simply adjusting retrieval status value thresholds. The principal advantage of the method we present is that its computational complexity is low in comparison to many other known methods. It is shown that efficiency can be improved significantly by a query reduction method. In addition, we introduce a more sophisticated method which further enhances retrieval effectiveness through the use of maximum term frequencies.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bov 84]
    Bovey, J.D., Robertson, S.E.: An algorithm for weighted searching on a Boolean system. Information Technology: Research and Development 3 (1), 1984, pp. 84–87.Google Scholar
  2. [Coo 88]
    Cooper, W.S.: Getting beyond Boole. Information Technology: Information Processing amp; Management 24 (3), 1988, pp. 243–248.CrossRefGoogle Scholar
  3. [Fre 83]
    Frei, H.P., Jauslin, J.-F.: Graphical Presentation of Information and Services: A User-Oriented Interface. Information Technology: Research and Development 2 (1), Jan. 1983, pp. 23–42.Google Scholar
  4. Jam 79] Jamieson, S.H.: The economic implementation of experimental retrieval techniques on a very large scale using an intelligent terminal. Proc. 2nd Int. Conf. on Inf. Storage and Retr., Dallas, 1979, pp. 45–51Google Scholar
  5. [Nor 81]
    Noreault, T., McGill, M., Koll, M.B.: A Performance Evaluation of Similarity Measures, Document Term Weighting Schemes and Representations in a Boolean Environment In: Oddy, R.N. et al. Information Retrieval Research, Butterwortiis, London, 1981.Google Scholar
  6. [Pai 84]
    Paice, C.D.: Soft evaluation of Boolean search queries in information retrieval systems. Information Technology: Research and Development 3 (1), Jan. 1984.Google Scholar
  7. [Pan 86]
    Panyr, J.: Die Theorie der Fuzzy-Mengen und Information-Retrieval Systeme. Nachr. f Dokum. 37 (3), 1986.Google Scholar
  8. [Rad 82]
    Radecki, T.: Reducing die Perils of Merging Boolean and Weighted Retrieval. Journal of Documentation 38 (31 1982, pp. 207–211.Google Scholar
  9. [Sal 83]
    Saltón, G., Fox, E.: Extended Boolean Information Retrieval. Communication of the ACM 26 (11), 1983, pp. 1022–1036.CrossRefzbMATHGoogle Scholar
  10. [Sal 88a]
    Saltón, G.: A Simple Blueprint for Automatic Boolean Query Processing. Information Processing & Management 24 (3), 1988, pp. 269–280.CrossRefGoogle Scholar
  11. [Sal 88b]
    Saltón, G., Buckley, C.: Term-Weighting Approaches in Automatic Text Retrieval. Information Processing amp; Management 24 (5), 1988, pp. 513–523.CrossRefGoogle Scholar
  12. [Sal 89]
    Saltón, G.: Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley Publishing Company, 1989Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • H. P. Frei
    • 1
  • S. Meienberg
    • 1
  1. 1.Department of Computer ScienceSwiss Federal Institute of Technology (ETH) ZurichZurichSwitzerland

Personalised recommendations