Abstract
One of important problems of dependence retrieval model is the challenge to integrate both single words and dependencies in one weighting schema. Although there are many retrieval models that exploit term dependencies in language modeling framework, seldom of them simultaneously study the problem on different query types, e.g., short queries and verbose queries. In this paper, we derive an axiomatic dependence model by defining several basic desirable constraints that a retrieval model should meet. The experiment results show that our model significantly and robustly improves retrieval accuracy over the baseline (unigram model) in verbose queries and achieves better performance than some state-of-art dependence models. © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Ding, F., & Wang, B. (2008). An axiomatic approach to exploit term dependencies in language model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4993 LNCS, pp. 586–591). https://doi.org/10.1007/978-3-540-68636-1_68
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.