Skip to main content

Static Pruning of Terms in Inverted Files

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4425))

Abstract

This paper addresses the problem of identifying collection dependent stop-words in order to reduce the size of inverted files. We present four methods to automatically recognise stop-words, analyse the tradeoff between efficiency and effectiveness, and compare them with a previous pruning approach. The experiments allow us to conclude that in some situations stop-words pruning is competitive with respect to other inverted file reduction techniques.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bahle, D., Williams, H., Zobel, J.: Efficient phrase querying with an auxiliary index. In: Proc. of ACM SIGIR, pp. 215–221. ACM Press, New York (2002)

    Google Scholar 

  2. Carmel, D., et al.: Static index pruning for information retrieval systems. In: Proc. of ACM SIGIR, pp. 43–50. ACM Press, New York (2001)

    Google Scholar 

  3. Church, K., Gale, W.: Poisson mixtures. Natural Language Engineering 2(1), 163–190 (1995)

    Google Scholar 

  4. de Moura, E.S., et al.: Improving web search efficiency via a locality based static pruning method. In: Proc. of WWW, pp. 235–244 (2005)

    Google Scholar 

  5. Fox, C.: A stop list for general text. SIGIR Forum 24(1-2), 19–21 (1990)

    Article  Google Scholar 

  6. Lo, R.T.W., He, B., Ounis, I.: Automatically building a stopword list for an information retrieval system. In: Proc. of DIR’05, Utrecht, Netherlands (2005)

    Google Scholar 

  7. Moffat, A., Turpin, A.: Compression and Coding Algorithms. Kluwer Academic Publishers, Norwell (2002)

    Google Scholar 

  8. Rennie, J.D.M., Jaakkola, T.: Using term informativeness for named entity detection. In: Proc. of ACM SIGIR, pp. 353–360. ACM Press, New York (2005)

    Google Scholar 

  9. Robertson, S., Sparck Jones, K.: Relevance weighting of search terms. JASIS 27, 129–146 (1976)

    Article  Google Scholar 

  10. Robertson, S.E., Walker, S.: Okapi/Keenbow at TREC-8. In: Text REtrieval Conference, pp. 151–162 (2000)

    Google Scholar 

  11. Robertson, S.E., et al.: Okapi at TREC-4. In: Text REtrieval Conference, pp. 21–30 (1996)

    Google Scholar 

  12. Salton, G., Yang, C.S., Yu, C.T.: A theory of term importance in automatic text analysis. JASIS 26(1), 33–44 (1975)

    Article  Google Scholar 

  13. Turtle, H., Flood, J.: Query evaluation: Strategies and optimizations. IP&M 31(6), 831–850 (1995)

    Google Scholar 

  14. Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, San Francisco (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Giambattista Amati Claudio Carpineto Giovanni Romano

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Blanco, R., Barreiro, Á. (2007). Static Pruning of Terms in Inverted Files. In: Amati, G., Carpineto, C., Romano, G. (eds) Advances in Information Retrieval. ECIR 2007. Lecture Notes in Computer Science, vol 4425. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71496-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71496-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71494-1

  • Online ISBN: 978-3-540-71496-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics