Abstract
Terms which are not explicitly mentioned in the text of a document receive often a minor role in current retrieval systems. In this work we connect the management of such terms with the ability of the retrieval model to handle partial representations. A simple logical indexing process capable of expressing negated terms and omitting some other terms in the representation of a document was designed. Partial representations of documents can be built taking into account document length and global term distribution. A propositional model of information retrieval is used to exemplify the advantages from such expressive modeling. A number of experiments applying these partial representations are reported. The benefits of the expressive framework became apparent in the evaluation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Crestani, F., Lalmas, M., van Rijsbergen, C.J. (eds.): Information Retrieval, Uncertainty and Logics: advanced models for the representation and retrieval of information. Kluwer Academic, Norwell (1998)
Croft, W.B., Lafferty, J.: Language Modeling for Information Retrieval. Kluwer Academic, Dordrecht (2003)
Dalal, M.: Investigations into a theory of knowledge base revision:preliminary report. In: Proceedings of the 7th National Conference on Artificial Intelligence (AAAI 1988), Saint Paul, USA, pp. 475–479 (1988)
Losada, D., Barreiro, A.: Embedding term similarity and inverse document frequency into a logical model of information retrieval. Journal of the American Society for Information Science and Technology, JASIST 54(4), 285–301 (2003)
Losada, D., Barreiro, A.: Propositional logic representations for documents and queries: a large-scale evaluation. In: Sebastiani, F. (ed.) ECIR 2003. LNCS, vol. 2633, pp. 219–234. Springer, Heidelberg (2003)
Losada, D.E., Barreiro, A.: Using a belief revision operator for document ranking in extended boolean models. In: Proc. SIGIR 1999, the 22nd ACM Conference on Research and Development in Information Retrieval, Berkeley, USA, August 1999, pp. 66–73 (1999)
Losada, D.E., Barreiro, A.: Efficient algorithms for ranking documents represented as dnf formulas. In: Proc. SIGIR 2000 Workshop on Mathematical and Formal Methods in Information Retrieval, Athens, Greece, July 2000, pp. 16–24 (2000)
Losada, D.E., Barreiro, A.: A logical model for information retrieval based on propositional logic and belief revision. The Computer Journal 44(5), 410–424 (2001)
Ponte, J., Croft, W.B.: A language modeling approach to information retrieval. In: Proc. 21st ACM Conference on Research and Development in Information Retrieval, SIGIR 1998, Melbourne, Australia, pp. 275–281 (1998)
Porter, M.F.: An algorithm for suffix stripping. Program 14(3), 130–137 (1980)
Robertson, S., Walker, S.: Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval. In: Proc. SIGIR 1994, the 17th ACM Conference on Research and Development in Information Retrieval, Dublin, Ireland, July 1994, pp. 232–241 (1994)
Salton, G., Wong, A., Yang, C.: A vector space model for automatic indexing. Communications of the ACM 18, 613–620 (1975)
Singhal, A., Buckley, C., Mitra, M.: Pivoted document length normalization. In: Proc. SIGIR 1996, the 19th ACM Conference on Research and Development in Information Retrieval, Zurich, Switzerland, July 1996, pp. 21–29 (1996)
van Rijsbergen, C.J.: A theoretical basis for the use of co-occurrence data in information retrieval. Journal of Documentation 33(2), 106–119 (1977)
van Rijsbergen, C.J.: A non-classical logic for information retrieval. The Computer Journal 29, 481–485 (1986)
Zaragoza, H., Hiemstra, D., Tipping, M.: Bayesian extension to the language model for ad hoc information retrieval. In: Proc. 26th ACM Conference on Research and Development in Information Retrieval, SIGIR 2003, Toronto, Canada, pp. 4–9 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Losada, D.E., Barreiro, A. (2004). Negations and Document Length in Logical Retrieval. In: Apostolico, A., Melucci, M. (eds) String Processing and Information Retrieval. SPIRE 2004. Lecture Notes in Computer Science, vol 3246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30213-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-30213-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23210-0
Online ISBN: 978-3-540-30213-1
eBook Packages: Springer Book Archive