Boolean queries and term dependencies in probabilistic retrieval models

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,...

Full description

Saved in:
Bibliographic Details
Published inJournal of the American Society for Information Science Vol. 37; no. 2; pp. 71 - 77
Main Author Croft, W. Bruce
Format Journal Article
LanguageEnglish
Published Washington, D.C Wiley Subscription Services, Inc., A Wiley Company 01.03.1986
John Wiley & Sons
American Documentation Institute
Wiley Periodicals Inc
Subjects
Online AccessGet full text
ISSN0002-8231
1097-4571
DOI10.1002/(SICI)1097-4571(198603)37:2<71::AID-ASI3>3.0.CO;2-4

Cover

More Information
Summary: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.
Bibliography:istex:B73CC09A0F6446C6296C2695BDD4D5B54079CC33
ark:/67375/WNG-TG3BNXVS-B
National Science Foundation - No. IST-8414486
ArticleID:ASI3
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Statistics/Data Report-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0002-8231
1097-4571
DOI:10.1002/(SICI)1097-4571(198603)37:2<71::AID-ASI3>3.0.CO;2-4