Longest-commonest match

The longest-commonest match is a concept coined by Adam Kilgarriff to name the most common realisation of the collocational pair, i.e. the chunk of language in which the collocation appears most frequently. The longest-commonest match is part of the word sketch result screen to facilitate the understanding of how the collocation typically behaves.