Boolean queries and term dependencies in probabilistic retrieval models

W. Bruce Croft

Journal of the American Society for Information Science, 1986, vol. 37, issue 2, 71-77

Abstract: A method of integrating Boolean queries with probabilistic retrieval models is proposed. Boolean queries are interpreted as specifying term dependencies that can be used to correct the document scores obtained with a basic probabilistic model. Alternative methods of obtaining dependency information, such as user‐specified phrases, can also be used in this approach. The experimental results indicate that significant performance benefits can be obtained, particularly when dependencies are derived from term phrases identified in natural language queries. © 1986 John Wiley & Sons, Inc.

Date: 1986
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(198603)37:23.0.CO;2-4

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:37:y:1986:i:2:p:71-77

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 ().