“…We make use of the query generation techniques proposed by Baskaya et al [5], that were also used in previous simulation studies [27,33,34,36,40]. More specifically, the following strategies are considered and used in combination with the term candidates of T topic and T rel : the strategy S1 outputs single term queries q i following the ordering of term candidates (q 1 = {t 1 }; q 2 = {t 2 }; q 3 = {t 3 }; ...); S2 keeps the first candidate term fixed and composes query strings by replacing the second term for reformulations (q 1 = {t 1 , t 2 }; q 2 = {t 1 , t 3 }; q 3 = {t 1 , t 4 }; ...); S2 is similar to S2, but keeps two candidate terms fixed (q 1 = {t 1 , t 2 , t 3 }; q 2 = {t 1 , t 2 , t 4 }; q 3 = {t 1 , t 2 , t 5 }; ...); S3 starts with a single term query and incrementally adds query terms for reformulations (q 1 = {t 1 }; q 2 = {t 1 , t 2 }; q 3 = {t 1 , t 2 , t 3 }; ...); S3 is similar to S3, but starts with two candidate terms (q 1 = {t 1 , t 2 , t 3 }; q 2 = {t 1 , t 2 , t 3 , t 4 }; q 3 = {t 1 , t 2 , t 3 , t 4 , t 5 }; ...).…”