Affiliation:
1. Univ. of Toronto, Toronto, Ont. Canada
2. Univ. of Waterloo, Waterloo, Ont. Canada
Abstract
We present a model for arbitrary passage retrieval using Boolean queries. The model is applied to the task of ranking documents, or other structural elements, in the order of their expected relevance. Features such as phrase matching, truncation, and stemming integrate naturally into the model. Properties of Boolean algebra are obeyed, and the exact-match semantics of Boolean retrieval are preserved. Simple inverted-list file structures provide an efficient implementation. Retrieval effectiveness is comparable to that of standard ranking techniques. Since global statistics are not used, the method is of particular value in distributed environments. Since ranking is based on arbitrary passages, the structural elements to be ranked may be specified at query time and do not need to be restricted to predefined elements.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,General Business, Management and Accounting,Information Systems
Reference58 articles.
1. Local Feedback in Full-Text Retrieval Systems
2. On the perils of merging Boolean and weighted retrieval systems;BOOKSTEIN A.;J. Am. Soc. Inf. Sci.,1978
3. Fuzzy requests: An approach to weighted Boolean searches;BOOKSTEIN;J. Am. Soc. Inf. Sci.,1980
4. BRENNER E. H. 1996. Beyond boolean--New approaches to information retrieval. National Federation of Abstracting and Information Services Philadelphia PA. BRENNER E. H. 1996. Beyond boolean--New approaches to information retrieval. National Federation of Abstracting and Information Services Philadelphia PA.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献