Abstract
The Multiple Bernoulli (MB) Language Model has been generally considered too computationally expensive for practical purposes and superseded by the more efficient multinomial approach. While, the model has many attractive properties, little is actually known about the retrieval effectiveness of the MB model due to its high cost of execution. In this paper, we show how an efficient implementation of this model can be achieved. The resulting method is comparable in terms of efficiency to other standard term matching algorithms (such as the vector space model, BM25 and the multinomial Language Model).
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
Losada, D.E.: Language modeling for sentence retrieval: a comparison between multiple-bernoulli models and multinomial models. In: Information Retrieval and Theory Workshop, Glasgow, UK (2005)
Metlzer, D., Lavrenko, V., Croft, W.B.: Formal multiple-bernoulli models for language modeling. In: Proc. 27th ACM Conference on Research and Development in Information Retrieval, SIGIR 2004, Sheffield, UK, pp. 540–541. ACM press, New York (2004)
Ponte, J., Craft, 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)
Zhai, C., Lafferty, J.: A study of smoothing methods for language models applied to information retrieval. ACM Transactions on Information Systems 22(2), 179–214 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azzopardi, L., Losada, D.E. (2006). An Efficient Computation of the Multiple-Bernoulli Language Model. In: Lalmas, M., MacFarlane, A., Rüger, S., Tombros, A., Tsikrika, T., Yavlinsky, A. (eds) Advances in Information Retrieval. ECIR 2006. Lecture Notes in Computer Science, vol 3936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11735106_46
Download citation
DOI: https://doi.org/10.1007/11735106_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33347-0
Online ISBN: 978-3-540-33348-7
eBook Packages: Computer ScienceComputer Science (R0)