As a first baseline we are searching for the most probable string with respect to the sentence cluster.
we use the Viterbi algorithm to find the sequence of words of a predefined length n which maximizes the bigram probability (MLEbased): Similar to the shortest path implementation, we specify compression length and set it also here to eight tokens.