In particular, 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.
the compressions obtained with this method are often unrelated to the main theme.