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.
Adam Kilgarriff Prize
Adam Kilgariff (1960-2015) was a British corpus linguist and founder of Lexical Computing, the company behind Sketch Engine. Adam devoted his whole life to research at the intersection of corpus linguistic, computational linguistics and lexicography.
To honour our brilliant and much-loved colleague, we established the Adam Kilgarriff Prize for outstanding work in the fields to which Adam contributed so much: corpus linguistics, computational linguistics, and lexicography.