<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>8420</REFNUM><AUTHORS><AUTHOR>Azzopardi,L.</AUTHOR><AUTHOR>Losada,D.</AUTHOR></AUTHORS><YEAR>2006</YEAR><TITLE>The Efficient Computation of the Multiple Bernoulli Model</TITLE><PLACE_PUBLISHED>Proceedings of the European Conference in Information Retrieval (ECIR 2006)</PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><PAGES>480-483</PAGES><LABEL>Azzopardi:2006:8420</LABEL><KEYWORDS><KEYWORD>Language Model</KEYWORD></KEYWORDS<ABSTRACT>The Multiple Bernoulli (MB) Language Model has been gen- erally considered too computationally expensive for practical purposes and superseded by the more e±cient multinomial approach. While, the model has many attractive properties, little is actually known about the retrieval e®ectiveness of the MB model due to its high cost of execution. In this paper, we show how an e±cient implementation of this model can be achieved. The resulting method is comparable in terms of e±ciency to other standard term matching algorithms (such as the vector space model, BM25 and the multinomial Language Model).</ABSTRACT></RECORD></RECORDS></XML>