Ad Hoc Retrieval with the Persian Language [chapter]

Ljiljana Dolamic, Jacques Savoy
2010 Lecture Notes in Computer Science  
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
more » ... 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%).
doi:10.1007/978-3-642-15754-7_12 fatcat:bfxnaqu7fvcjbbmhluj5z6r7oe