Bridging the Gap between Relevance Matching and Semantic Matching for Short Text Similarity Modeling (D19-1)
Copied to clipboard
| Challenge: | Existing techniques for relevance and semantic matching cannot be easily adapted to the other. |
| Approach: | They propose a model that incorporates a hybrid encoder module, a relevance matching module and co-attention mechanisms that capture context-aware semantic relatedness. |
| Outcome: | The proposed model incorporates a hybrid encoder module, a relevance matching module and co-attention mechanisms that capture context-aware semantic relatedness. |
Similar Papers
Pathway to Relevance: How Cross-Encoders Implement a Semantic Variant of BM25 (2025.emnlp-main)
Copied to clipboard
| Challenge: | Interpretability in information retrieval (IR) models is coarse-grained and poorly understood . a cross-encoder model extracts traditional relevance signals, such as term frequency and inverse document frequency . |
| Approach: | They analyze how a common IR model extracts traditional relevance signals . this is similar to the probabilistic ranking function BM25 . |
| Outcome: | The proposed model extracts traditional relevance signals in early-to-middle layers, similar to BM25 . the model then combine these concepts in later layers, laying the groundwork for future interventions . |
Semantic Linking in Convolutional Neural Networks for Answer Sentence Selection (D18-1)
Copied to clipboard
| Challenge: | Recent NLP approaches that model relations between text use complex architectures and attention. |
| Approach: | They propose to use labelled data to model semantic relations between two pieces of text . they use word representations to encode matching features directly in the word representation . |
| Outcome: | The proposed approach beats tree kernel models and neural models with similar input encodings while keeping the model simple and fast to train. |
Divide and Conquer: Text Semantic Matching with Disentangled Keywords and Intents (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing text semantic matching models do not provide granularity for text comparison. |
| Approach: | They propose a simple yet effective training strategy for text semantic matching by disentangling keywords from intents. |
| Outcome: | The proposed approach achieves stable performance improvements against a wide range of models on three benchmarks. |
MATCH: Modulating Attention via In-Context Retrieval for Long-Context Transformers (2026.acl-long)
Copied to clipboard
Linrui Ma, Chun Hei Lo, Xinyu Wang, Peng Lu, Xihao Yuan, Hanting Chen, Kai Han, Xinghao Chen, Chengjun Zhan, Hanlin xu, Yichun Yin, Lifeng Shang, Feng Wen, Boxing Chen, Yufei Cui
| Challenge: | Existing approaches to improve efficiency often enforce rigid structural constraints such as local attention windows. |
| Approach: | They propose a framework that augments sparse-attention mechanisms with dynamically integrated in-context information through an efficient retrieval system. |
| Outcome: | Empirical results show that MATCH significantly improves the performance of sparse-attention models on synthetic and real-world natural-language tasks. |
Deep Relevance Ranking Using Enhanced Document-Query Interactions (D18-1)
Copied to clipboard
| Challenge: | Document relevance ranking is the task of ranking documents from a large collection using the query and the text of each document only. |
| Approach: | They propose to use convolutional n-gram matching to inject rich context-sensitive encodings into their models, inspired by PACRR's convolution-based ngram matching features. |
| Outcome: | The proposed models outperform baselines, DRMM, and PACRR on the BIOASQ and TREC ROBUST questions and document inputs. |
Going Beyond Sentence Embeddings: A Token-Level Matching Algorithm for Calculating Semantic Textual Similarity (2023.acl-short)
Copied to clipboard
| Challenge: | Semantic Textual Similarity (STS) measures the degree to which the underlying semantics of paired sentences are equivalent. |
| Approach: | They propose a token-level matching inference algorithm which can be applied on top of any language model to improve its performance on STS task. |
| Outcome: | The proposed method improves the performance of almost all language models, with up to 12.7% gain in Spearman’s correlation. |
Multi-Granularity Fusion Text Semantic Matching Based on WoBERT (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing text-matching methods struggle with semantic nuances in short texts . a novel approach to improve text semantic matching is being developed . |
| Approach: | They propose a multi-granularity fusion model that harnesses a pre-trained language model to capture text semantic nuances. |
| Outcome: | The proposed model improves on Chinese short text matching datasets compared to traditional methods . the proposed model captures individual text semantic nuances and improves accuracy . |
Original Semantics-Oriented Attention and Deep Fusion Network for Sentence Matching (D19-1)
Copied to clipboard
| Challenge: | Sentence matching is a key issue in natural language inference and paraphrase identification. |
| Approach: | They propose a semantics-oriented attention and deep fusion network (OSOA-DFN) that is oriented to the original semantic representation of another sentence and propagates attention information at each matching layer. |
| Outcome: | The proposed model can model sentence matching more precisely on three sentence matching benchmark datasets. |
Cross-sentence Pre-trained Model for Interactive QA matching (2020.lrec-1)
Copied to clipboard
| Challenge: | Existing methods for semantic matching do not examine each sentence individually, but consider syntactic context inside a sentence. |
| Approach: | They propose a semantic matching model that takes a cross-sentence context-aware architecture and incorporates a quantity of context information jump to facilitate attention weight formulation. |
| Outcome: | The proposed model outperforms state-of-the-art models on the Yahoo! community question dataset and the TREC library. |
Match More, Extract Better! Hybrid Matching Model for Open Domain Web Keyphrase Extraction (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing models for keyphrase extraction use noisy information to filter the salient phrases from the document. |
| Approach: | They propose a hybrid matching model that combines representation-focused and interaction-based matching modules into a unified framework for improving keyphrase extraction. |
| Outcome: | The proposed model outperforms state-of-the-art keyphrase extraction models on the OpenKP dataset. |