HyperMatch: long-form text matching via hypergraph convolutional networks

Semantic text matching plays a vital role in diverse domains, such as information retrieval, question answering, and recommendation. However, longer texts present challenges, including noise, long-range dependency, and cross-sentence inference. Graph-based approaches have shown effectiveness in addressing these challenges, but traditional graph structures struggle to model complex higher-order relationships in long-form texts. To overcome this limitation, we propose HyperMatch, a hypergraph-based method for long-form text matching. HyperMatch leverages hypergraph modeling to capture high-order relationships and enhance matching performance. Our approach involves constructing a keyword graph using document keywords as nodes, connecting sentences to nodes based on inclusion relationships, creating a hypergraph based on sentence similarity across nodes, and utilizing hypergraph convolutional networks to aggregate matching signals. Extensive experiments on benchmark datasets demonstrate the superiority of our model over state-of-the-art long-form text matching approaches.