arXiv Machine Learning By Anshul Garg, Pavni Tandon, Karan Bhukar, Tanmay Khandelwal, Ujjal Kumar Dutta

Low-Latency Spell Correction for Japanese Music Search Queries

Read the original on arXiv Machine Learning →

The paper introduces a compact BART-based sequence‑to‑sequence model for low‑latency spell correction of Japanese music search queries, addressing challenges posed by four writing scripts. It employs a script‑aware synthetic misspelling pipeline that blends keyboard‑layout models, phonetic confusion priors, consonant alternations, and kana case errors, and normalizes mixed‑script titles to a single canonical script to reduce hallucinations. Experiments show the model achieves 41.09% exact‑match accuracy and 11.62% CER, outperforming edit‑distance baselines while keeping inference latency under 4 ms on a single GPU.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Jun 24

Sarashina2.2-TTS: Tackling Kanji Polyphony in Japanese Speech Generation via Data Scaling and Targeted Data Synthesis

While large language model (LLM)-based text-to-speech (TTS) systems have achieved high-quality speech synthesis, most existing systems focus on English and Chinese. Japanese, however, remains under-explored, and its unique linguistic challenges, such as widespread context-dependent kanji polyphony, have yet to be adequately tackled.

arXiv Computation and Language
Aug 27

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

The paper introduces GUIDE, a generative unsupervised framework for Chinese query correction that uses shared-ID encoding for phonetically or visually confusable characters and an encoder–decoder architecture to reconstruct queries within plausible confusion neighborhoods. It incorporates a time‑decayed, query‑frequency‑weighted objective to adapt to rapidly changing query vocabularies. Experiments on QSpell 250K and the large‑scale KwaiSearch dataset demonstrate that GUIDE consistently outperforms strong baselines, with online A/B testing confirming improvements in correction quality and downstream engagement.

By Lei Yang, Binbin Huang, Jiwei Tan, Xuhui Sui, Chang Tu, Yi Wang, Han Li
arXiv Computation and Language
Oct 9

LMSpell: Spell Correction with Pre-Trained Language Models

The paper presents LMSpell, an empirical study evaluating how different pre‑trained language models (PLMs) perform at spell correction across multiple languages, including low‑resource languages (LRLs). It demonstrates that even relatively small PLMs such as Gemma 3 (270 M parameters) and mBART50, when fine‑tuned on only 5,000 sentences, can surpass rule‑based spell correctors. A case study on Sinhala illustrates the challenges of spell correction for LRLs.

By Akesh Gunathilake, Nadil Karunarathna, Tharusha Bandaranayake, Nisansa de Silva, Surangika Ranathunga, Nevidu Jayatilleke
arXiv Computation and Language
Oct 23

Synthetic-to-Real Code-Switched ASR: A Spontaneous Nepali-English Podcast Benchmark

The paper introduces a new benchmark of 13,044 spontaneous Nepali‑English code‑switched podcast utterances, totaling 15.45 h, and evaluates a two‑stage synthetic‑to‑real adaptation framework for ASR. Stage 1 uses supervised fine‑tuning on 0.95 h of synthetic speech, reducing Mixed Error Rate from 23.40 % to 21.52 % and switch‑point error rate from 35.89 % to 28.77 %. Stage 2 applies Group Relative Policy Optimization with script and transcription rewards, yielding modest but statistically significant further improvements, particularly in English script confusion and switch‑point accuracy. The study also shows that an auxiliary script reward term offers no benefit beyond MER‑only optimization in this setting, and that the synthetic SFT provides the main cross‑domain transfer to spontaneous human speech.

By Firoj Paudel