An efficient computation of the multiple-Bernoulli language model

Azzopardi, L. and Losada, D. (2006) An efficient computation of the multiple-Bernoulli language model. Lecture Notes in Computer Science, 3936, pp. 480-483. (doi:10.1007/11735106_46)

Full text not currently available from Enlighten.


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).

Item Type:Articles
Glasgow Author(s) Enlighten ID:Azzopardi, Dr Leif
Authors: Azzopardi, L., and Losada, D.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
ISSN (Online):1611-3349

University Staff: Request a correction | Enlighten Editors: Update this record