Filters








4 Hits in 2.3 sec

Shortest-substring retrieval and ranking

Charles L. A. Clarke, Gordon V. Cormack
2000 ACM Transactions on Information Systems  
Shortest-Substring Retrieval and Ranking • 45  ...  This criticism has primarily focused on the lack of support for relevance ranking and on the difficulties casual users experience when formulating Boolean queries.  ...  MultiText Experiments for TREC Shortest-substring ranking is the primary ranking method for the Multi-Text system, and as a result has been used in most MultiText experiments for the TREC conference series  ... 
doi:10.1145/333135.333137 fatcat:lxsz5tnppjevnj3q76ryuz5oji

Higher precision for two-word queries

K. L. Kwok
2002 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '02  
We look at how two-word queries may attain higher precision by re-ranking using word co-occurrence evidence in retrieved documents.  ...  Co-occurrence within document context is not sufficient, but window context including sentence context evidence can provide precision improvements at low recall region of 4 to 10% using initial retrieval  ...  Shortest substring ranking (Multitext experiments for TREC-4). In: The Fourth Text Retrieval Conference (TREC-4). NIST SP 500-236, pp.295-304. GPO: Washington, D.C. 1966.[5] Fagan, J.L.  ... 
doi:10.1145/564376.564461 dblp:conf/sigir/Kwok02 fatcat:2xhly7uksfckthputs5f2d5yge

Higher precision for two-word queries

K. L. Kwok
2002 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '02  
We look at how two-word queries may attain higher precision by re-ranking using word co-occurrence evidence in retrieved documents.  ...  Co-occurrence within document context is not sufficient, but window context including sentence context evidence can provide precision improvements at low recall region of 4 to 10% using initial retrieval  ...  Shortest substring ranking (Multitext experiments for TREC-4). In: The Fourth Text Retrieval Conference (TREC-4). NIST SP 500-236, pp.295-304. GPO: Washington, D.C. 1966.[5] Fagan, J.L.  ... 
doi:10.1145/564437.564461 fatcat:xftpiogyejewtcfey7oiqcmuge

Indexing time vs. query time

Stefan Büttcher, Charles L. A. Clarke
2005 Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05  
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions.  ...  As one of the main results of this paper, we demonstrate how security mechanisms necessary for multiuser support can be extended to realize efficient document deletions.  ...  Query Processing Wumpus' query processor is based the GCL query language and its shortest-substring paradigm [3] .  ... 
doi:10.1145/1099554.1099645 dblp:conf/cikm/ButtcherC05 fatcat:bz45mu7renbmziryddjexbqxxi