2017/04/13 by Tom Ouyang, David Rybach, Ouyang, Tom +5 · 1 citation
Computer Science · #Computation and Language (cs.CL) #FOS: Computer and information sciences #Speech Recognition and Synthesis #Speech and Audio Processing #Speech and dialogue systems #cs.CL
paper · pdf · doi:10.48550/arxiv.1704.03987
arxiv created 2017/04/13 · openalex publication_date 2017/04/13 · arxiv updated 2017/04/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose a finite-state transducer (FST) representation for the models used to decode keyboard inputs on mobile devices. Drawing from learnings from the field of speech recognition, we describe a decoding framework that can satisfy the strict memory and latency constraints of keyboard input. We extend this framework to support functionalities typically not present in speech recognition, such as literal decoding, autocorrections, word completions, and next word predictions. We describe the general framework of what we call for short the keyboard "FST decoder" as well as the implementation details that are new compared to a speech FST decoder. We demonstrate that the FST decoder enables new UX features such as post-corrections. Finally, we sketch how this decoder can support advanced features such as personalization and contextualization.