However, such an approach would be infeasible already for medium keyword list sizes.
we use a beam search approach instead, which extends the keyword list iteratively and keeps only the n-best performing permutations.