arXiv (All)
open access
Low-Latency Spell Correction for Japanese Music Search Queries
Spell correction for Japanese search queries presents unique challenges due to the co-existence of four writing scripts (Latin/romaji, hiragana, katakana, and kanji) and the distinct error patterns each script induces. We present a compact BART-based sequence-to-sequence model (3 encoder + 3 decoder
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fixation Sequences as Time Series: A Topological Approach to Dyslexia Detection#126518
- Evaluation of Phonetic Encoding Algorithms on Transcription Datasets#927684
- What a Retrieval Index Loses Before Anyone Notices: Three Silent Defects in Three Published Wikipedia Embedding Indexes#929007
- A comparison of a novel neural spell checker and standard spell checking algorithms#252405
- Arbitrary Cipher Attacks Against Large Language Models Do Not Require Fine-Tuning#987291
Record · ID 927562
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive