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

Fingerprint

language
efficiency
costs

Keywords

  • language modelling
  • retrieval efficiency

Cite this

Azzopardi, L., & Losada, D. E. (2006). An efficient computation of the multiple-bernoulli language model. In Advances in Information Retrieval: 28th European Conference on IR Research, ECIR 2006, London, UK, April 10-12, 2006. Proceedings (Vol. 3936, pp. 480-483). (Lecture Notes in Computer Science; Vol. 3936). Berlin, Heidelberg: Springer-Verlag. https://doi.org/10.1007/11735106_46
Azzopardi, Leif ; Losada, David E. / An efficient computation of the multiple-bernoulli language model. Advances in Information Retrieval: 28th European Conference on IR Research, ECIR 2006, London, UK, April 10-12, 2006. Proceedings. Vol. 3936 Berlin, Heidelberg : Springer-Verlag, 2006. pp. 480-483 (Lecture Notes in Computer Science).
@inproceedings{31576fef6eee41b8a41f61fc4fb4a335,
title = "An efficient computation of the multiple-bernoulli language model",
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).",
keywords = "language modelling, retrieval efficiency",
author = "Leif Azzopardi and Losada, {David E.}",
year = "2006",
doi = "10.1007/11735106_46",
language = "English",
isbn = "978-3-540-33347-0",
volume = "3936",
series = "Lecture Notes in Computer Science",
publisher = "Springer-Verlag",
pages = "480--483",
booktitle = "Advances in Information Retrieval",

}

Azzopardi, L & Losada, DE 2006, An efficient computation of the multiple-bernoulli language model. in Advances in Information Retrieval: 28th European Conference on IR Research, ECIR 2006, London, UK, April 10-12, 2006. Proceedings. vol. 3936, Lecture Notes in Computer Science, vol. 3936, Springer-Verlag, Berlin, Heidelberg, pp. 480-483. https://doi.org/10.1007/11735106_46

An efficient computation of the multiple-bernoulli language model. / Azzopardi, Leif; Losada, David E.

Advances in Information Retrieval: 28th European Conference on IR Research, ECIR 2006, London, UK, April 10-12, 2006. Proceedings. Vol. 3936 Berlin, Heidelberg : Springer-Verlag, 2006. p. 480-483 (Lecture Notes in Computer Science; Vol. 3936).

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

TY - GEN

T1 - An efficient computation of the multiple-bernoulli language model

AU - Azzopardi, Leif

AU - Losada, David E.

PY - 2006

Y1 - 2006

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

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

KW - language modelling

KW - retrieval efficiency

U2 - 10.1007/11735106_46

DO - 10.1007/11735106_46

M3 - Conference contribution book

SN - 978-3-540-33347-0

VL - 3936

T3 - Lecture Notes in Computer Science

SP - 480

EP - 483

BT - Advances in Information Retrieval

PB - Springer-Verlag

CY - Berlin, Heidelberg

ER -

Azzopardi L, Losada DE. An efficient computation of the multiple-bernoulli language model. In Advances in Information Retrieval: 28th European Conference on IR Research, ECIR 2006, London, UK, April 10-12, 2006. Proceedings. Vol. 3936. Berlin, Heidelberg: Springer-Verlag. 2006. p. 480-483. (Lecture Notes in Computer Science). https://doi.org/10.1007/11735106_46