Shows the longest sequence of tokens that is the most common representation of the collocation. This is called longest-commonist match.