This model learns the cost of putting a word immediately before another word and finds the best reordering by solving an instance of the Traveling Salesman Problem (TSP).
for efficiently solving the TSP, the model is restricted to pairwise features which examine only a pair of words and their neighborhood.