A new probabilistic ranking model

Over the years a number of models have been introduced as solutions to the central IR problem of ranking documents given textual queries. Here we define another new model. It is a probabilistic model and has no term inter-dependencies, thus allowing calculation from inverted indices. It is based upon a simple core hypothesis, directly calculating a ranking score in terms of probability theory. Early results show that its performance is credible, even in the absence of parameters or heuristics. Its semantic basis gives absolute results, allowing different rankings to be compared with each other. The investigation of this model is at a very early stage; here, we simply propose the model for further investigation