# A Study of MatchPyramid Models on Ad-hoc Retrieval

arXiv: https://arxiv.org/abs/1606.04648 · HTML: https://mlsanity.com/paper/1606.04648/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Jun 2016.

## Built on by (most cited first, 6 of 6)

- [Neural ranking models for document retrieval](https://mlsanity.com/paper/2102.11903/) (2021)
- [Lexically-Accelerated Dense Retrieval](https://mlsanity.com/paper/2307.16779/) (2023)
- [Match-Ignition: Plugging PageRank into Transformer for Long-form Text Matching](https://mlsanity.com/paper/2101.06423/) (2021)
- [Divide & Conquer for Entailment-aware Multi-hop Evidence Retrieval](https://mlsanity.com/paper/2311.02616/) (2023)
- [Logically at Factify 2022: Multimodal Fact Verification](https://mlsanity.com/paper/2112.09253/) (2021)
- [Explainability of Text Processing and Retrieval Methods: A Survey](https://mlsanity.com/paper/2212.07126/) (2022)

## Abstract (arXiv)

Deep neural networks have been successfully applied to many text matching tasks, such as paraphrase identification, question answering, and machine translation. Although ad-hoc retrieval can also be formalized as a text matching task, few deep models have been tested on it. In this paper, we study a state-of-the-art deep matching model, namely MatchPyramid, on the ad-hoc retrieval task. The MatchPyramid model employs a convolutional neural network over the interactions between query and document to produce the matching score. We conducted extensive experiments to study the impact of different pooling sizes, interaction functions and kernel sizes on the retrieval performance. Finally, we show that the MatchPyramid models can significantly outperform several recently introduced deep matching models on the retrieval task, but still cannot compete with the traditional retrieval models, such as BM25 and language models.