GUIDE: Generative Unsupervised Chinese Query Correction via Phonetic and Visual Shared-ID Encoding

• URL: http://arxiv.org/abs/2608.25343v2
• Date: Sun, 30 Aug 2026 08:43:11 GMT
• Title: GUIDE: Generative Unsupervised Chinese Query Correction via Phonetic and Visual Shared-ID Encoding
• Abstract summary: Chinese query correction (CQC) is important for search and query recommendation on content platforms.<n>We propose textscGUIDE, a generative unsupervised framework for CQC based on a confuse-then-clarify paradigm.<n>textscGUIDE encodes phonetically or visually confusable characters with shared-IDs and reconstructs the original query with an encoder-decoder architecture.
• Score: 14.765897981494186
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Chinese query correction (CQC) is important for search and query recommendation on content platforms, but supervised methods rely on large annotated correction pairs that are costly to maintain as query vocabularies evolve. Unsupervised correction with language models is attractive, yet in the short-query setting, unconstrained generation often over-corrects ambiguous inputs toward high-frequency phrases, causing intent drift. We propose \textsc{GUIDE}, a generative unsupervised framework for CQC based on a confuse-then-clarify paradigm. \textsc{GUIDE} encodes phonetically or visually confusable characters with shared-IDs and reconstructs the original query with an encoder--decoder architecture, which constrains correction to plausible confusion neighborhoods while learning from unlabeled query streams. A time-decayed, query-frequency-weighted objective further supports adaptation to rapidly changing query vocabularies. Experiments on \textit{QSpell 250K} and a large-scale real-world dataset (\textit{KwaiSearch}) show that \textsc{GUIDE} consistently outperforms strong baselines, while online A/B testing further confirms gains in correction quality and downstream engagement.

Related papers

• Graph-Based Phonetic Error Correction of Noisy ASR [15.765749498997442]
  We propose a structured ASR correction framework that combines phonetic graph modeling with contextual language understanding.<n>A graph neural network (GNN) first constructs acoustically plausible candidate neighborhoods for flagged tokens.<n>A masked language model (MLM) then provides local contextual scoring, and an instruction-tuned large language model (LLM) performs final context-aware re-ranking.
  arXiv  Detail & Related papers  (2026-04-29T13:57:11Z)
• Lost in Decoding? Reproducing and Stress-Testing the Look-Ahead Prior in Generative Retrieval [48.348257016776195]
  Generative retrieval (GR) ranks documents by autoregressively generating document identifiers.<n>Many GR methods rely on trie-latency beam search, they are vulnerable to early pruning of relevant prefixes under finite-beam decoding.<n>Planning Ahead in Generative Retrieval (PAG) mitigates this failure mode by using simultaneous decoding to compute a document-level look-ahead prior that guides subsequent sequential decoding.
  arXiv  Detail & Related papers  (2026-04-25T17:58:15Z)
• Chain of Correction for Full-text Speech Recognition with Large Language Models [21.37485126269991]
  Chain of Correction (CoC) is a multi-turn chat format to correct errors segment by segment, guided by pre-recognized text and full-text context for better semantic understanding.<n> Experiments show that CoC significantly outperforms baseline and benchmark systems in correcting full-text ASR outputs.
  arXiv  Detail & Related papers  (2025-04-02T09:06:23Z)
• SVTRv2: CTC Beats Encoder-Decoder Models in Scene Text Recognition [77.28814034644287]
  We propose SVTRv2, a CTC model endowed with the ability to handle text irregularities and model linguistic context.<n>We extensively evaluate SVTRv2 in both standard and recent challenging benchmarks.<n> SVTRv2 surpasses most EDTRs across the scenarios in terms of accuracy and inference speed.
  arXiv  Detail & Related papers  (2024-11-24T14:21:35Z)
• Improving Seq2Seq Grammatical Error Correction via Decoding Interventions [40.52259641181596]
  We propose a unified decoding intervention framework that employs an external critic to assess the appropriateness of the token to be generated incrementally. We discover and investigate two types of critics: a pre-trained left-to-right language model critic and an incremental target-side grammatical error detector critic. Our framework consistently outperforms strong baselines and achieves results competitive with state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-10-23T03:36:37Z)
• From Chaos to Clarity: Claim Normalization to Empower Fact-Checking [57.024192702939736]
  Claim Normalization (aka ClaimNorm) aims to decompose complex and noisy social media posts into more straightforward and understandable forms. We propose CACN, a pioneering approach that leverages chain-of-thought and claim check-worthiness estimation. Our experiments demonstrate that CACN outperforms several baselines across various evaluation measures.
  arXiv  Detail & Related papers  (2023-10-22T16:07:06Z)
• Optimizing Factual Accuracy in Text Generation through Dynamic Knowledge Selection [71.20871905457174]
  Language models (LMs) have revolutionized the way we interact with information, but they often generate nonfactual text. Previous methods use external knowledge as references for text generation to enhance factuality but often struggle with the knowledge mix-up of irrelevant references. We present DKGen, which divide the text generation process into an iterative process.
  arXiv  Detail & Related papers  (2023-08-30T02:22:40Z)
• Context Perception Parallel Decoder for Scene Text Recognition [52.620841341333524]
  Scene text recognition methods have struggled to attain high accuracy and fast inference speed. We present an empirical study of AR decoding in STR, and discover that the AR decoder not only models linguistic context, but also provides guidance on visual context perception. We construct a series of CPPD models and also plug the proposed modules into existing STR decoders. Experiments on both English and Chinese benchmarks demonstrate that the CPPD models achieve highly competitive accuracy while running approximately 8x faster than their AR-based counterparts.
  arXiv  Detail & Related papers  (2023-07-23T09:04:13Z)
• Noise-Robust Dense Retrieval via Contrastive Alignment Post Training [89.29256833403167]
  Contrastive Alignment POst Training (CAPOT) is a highly efficient finetuning method that improves model robustness without requiring index regeneration. CAPOT enables robust retrieval by freezing the document encoder while the query encoder learns to align noisy queries with their unaltered root. We evaluate CAPOT noisy variants of MSMARCO, Natural Questions, and Trivia QA passage retrieval, finding CAPOT has a similar impact as data augmentation with none of its overhead.
  arXiv  Detail & Related papers  (2023-04-06T22:16:53Z)
• Error-Robust Retrieval for Chinese Spelling Check [43.56073620728942]
  Chinese Spelling Check (CSC) aims to detect and correct error tokens in Chinese contexts. Previous methods may not fully leverage the existing datasets. We introduce our plug-and-play retrieval method with error-robust information for Chinese Spelling Check.
  arXiv  Detail & Related papers  (2022-11-15T01:55:34Z)
• Factual Error Correction for Abstractive Summaries Using Entity Retrieval [57.01193722520597]
  We propose an efficient factual error correction system RFEC based on entities retrieval post-editing process. RFEC retrieves the evidence sentences from the original document by comparing the sentences with the target summary. Next, RFEC detects the entity-level errors in the summaries by considering the evidence sentences and substitutes the wrong entities with the accurate entities from the evidence sentences.
  arXiv  Detail & Related papers  (2022-04-18T11:35:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.