Shortest Substring Ranking (MultiText Experiments for TREC-4)

  title={Shortest Substring Ranking (MultiText Experiments for TREC-4)},
  author={Charles L. A. Clarke and Gordon V. Cormack and Forbes J. Burkowski},
To address the TREC-4 topics, we used a precise query language that yields and combines arbitrary intervals of text rather than pre-deened units like words and documents. Each solution was scored in inverse proportion to the length of the shortest interval containing it. Each document was scored by the sum of the scores of solutions within it. Whenever the above strategy yielded less than 1000 documents, documents satisfying successively weaker queries were added with lower rank. Our results… CONTINUE READING