Searching strategies for the Hungarian language
Résumé This paper reports on the underlying IR problems encountered when dealing with the complex morphology and compound constructions found in the Hungarian language. It describes evaluations carried out on two general stemming strategies for this language, and also demonstrates that a light stemming approach could be quite effective. Based on searches done on the CLEF test collection, we find that a more aggressive suffix-stripping approach may produce better MAP. When compared to an IR scheme without stemming or one based on only a light stemmer, we find the differences to be statistically significant. When compared with probabilistic, vector-space and language models, we find that the Okapi model results in the best retrieval effectiveness. The resulting MAP is found to be about 35% better than the classical tf Of approach, particularly for very short requests. Finally, we demonstrate that applying an automatic decompounding procedure for both queries and documents significantly improves IR performance (+10%), compared to word-based indexing strategies. (c) 2007 Elsevier Ltd. All rights reserved.
Mots-clés Hungarian information retrieval, Hungarian language, CLEF, evaluation, decompounding, n-gram indexing, TEXT RETRIEVAL, PROBABILISTIC MODELS, INFORMATION, CLEF-2003, ALGORITHM
Citation J. Savoy, "Searching strategies for the Hungarian language," Information Processing & Management, vol. 44, p. 310-324, 2008.
Type Article de périodique (Français)
Date de publication 2008
Nom du périodique Information Processing & Management
Volume 44
Numéro 1
Pages 310-324