On the equivalence of boolean and weighted searching based on the convertibility of query forms

Pauline V. Angione

Journal of the American Society for Information Science, 1975, vol. 26, issue 2, 112-124

Abstract: Consideration is given to the nature of the retrieval process with emphasis on the selection algorithm employed, and its relation to document set and query form. Proof is given of the equivalence of Boolean and weighted search methods, this proof being based on the ability to convert any Boolean search request to weighted form and, similarly, any weighted request to Boolean form.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asi.4630260207

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:26:y:1975:i:2:p:112-124

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().