An efficient computation of the multiple-bernoulli language model

Leif Azzopardi, David E. Losada

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

4 Citations (Scopus)

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).
Original languageEnglish
Title of host publicationAdvances in Information Retrieval
Subtitle of host publication28th European Conference on IR Research, ECIR 2006, London, UK, April 10-12, 2006. Proceedings
Place of PublicationBerlin, Heidelberg
PublisherSpringer-Verlag
Pages480-483
Number of pages4
Volume3936
ISBN (Print)978-3-540-33347-0
DOIs
Publication statusPublished - 2006

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume3936

Keywords

  • language modelling
  • retrieval efficiency

Cite this