Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Divide and Conquer: Text Semantic Matching with Disentangled Keywords and Intents (2203.02898v1)

Published 6 Mar 2022 in cs.CL

Abstract: Text semantic matching is a fundamental task that has been widely used in various scenarios, such as community question answering, information retrieval, and recommendation. Most state-of-the-art matching models, e.g., BERT, directly perform text comparison by processing each word uniformly. However, a query sentence generally comprises content that calls for different levels of matching granularity. Specifically, keywords represent factual information such as action, entity, and event that should be strictly matched, while intents convey abstract concepts and ideas that can be paraphrased into various expressions. In this work, we propose a simple yet effective training strategy for text semantic matching in a divide-and-conquer manner by disentangling keywords from intents. Our approach can be easily combined with pre-trained LLMs (PLM) without influencing their inference efficiency, achieving stable performance improvements against a wide range of PLMs on three benchmarks.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (8)
  1. Yicheng Zou (20 papers)
  2. Tao Gui (127 papers)
  3. Junzhe Wang (15 papers)
  4. Qi Zhang (785 papers)
  5. Meng Tang (24 papers)
  6. Haixiang Li (6 papers)
  7. Daniel Wang (21 papers)
  8. HongWei Liu (108 papers)
Citations (22)

Summary

We haven't generated a summary for this paper yet.