Ad hoc retrieval with the Persian language

  • Authors:
  • Ljiljana Dolamic;Jacques Savoy

  • Affiliations:
  • Computer Science Department, University of Neuchatel, Neuchâtel, Switzerland;Computer Science Department, University of Neuchatel, Neuchâtel, Switzerland

  • Venue:
  • CLEF'09 Proceedings of the 10th cross-language evaluation forum conference on Multilingual information access evaluation: text retrieval experiments
  • Year:
  • 2009
  • CLEF 2009 ad hoc track overview: TEL and Persian tasks

    CLEF'09 Proceedings of the 10th cross-language evaluation forum conference on Multilingual information access evaluation: text retrieval experiments

  • UniNE at CLEF-IP 2009

    CLEF'09 Proceedings of the 10th cross-language evaluation forum conference on Multilingual information access evaluation: text retrieval experiments

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes our participation to the Persian ad hoc search during the CLEF 2009 evaluation campaign. In this task, we suggest using a light suffix-stripping algorithm for the Farsi (or Persian) language. The evaluations based on different probabilistic models demonstrated that our stemming approach performs better than a stemmer removing only the plural suffixes, or statistically better than an approach ignoring the stemming stage (around +4.5%) or a n-gram approach (around +4.7%). The use of a blind query expansion may significantly improve the retrieval effectiveness (between +7% to +11%). Combining different indexing and search strategies may further enhance the MAP (around +4.4%).