 In order to compute this penalty, unigrams are grouped into the fewest possible "chunks", where a chunk is defined as a set of unigrams that are adjacent in the hypothesis and in the reference.The longer the adjacent mappings between the candidate and the reference, the fewer chunks there are.A translation that is identical to the reference will give just one chunk.