When deciding the overall order for either ranking or classification model we used three search strategies: greedy, genetic and exhaustive (or brutal) algorithms.
we build the training examples for svm rank as follows: For a training query, which is a paragraph with n sequential sentences as 1 2 ... n s s s , we  where S is the set of all sentences in a paragraph and S is the number of sentences in S .