Mobile Keyboard Input Decoding with Finite-State Transducers

نویسندگان

  • Tom Ouyang
  • David Rybach
  • Françoise Beaufays
  • Michael Riley
چکیده

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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transliterated Mobile Keyboard Input via Weighted Finite-State Transducers

We present an extension to a mobile keyboard input decoder based on finite-state transducers that provides general transliteration support, and demonstrate its use for input of South Asian languages using a QWERTY keyboard. On-device keyboard decoders must operate under strict latency and memory constraints, and we present several transducer optimizations that allow for high accuracy decoding u...

متن کامل

Segmenting Sequences Semantically. Using Petri Net Transducers for the Translation from Sequential Data to Non-Sequential Models

In previous work we presented an extension and generalisation of finite state transducers (FSTs) to so-called Petri net transducers (PNTs). These are applicable to any form of transforming sequential input signals into non-sequential output structures – which can be used to represent the semantics of the input – by performing a weighted relation between partial languages, i.e. assigning one wei...

متن کامل

On the Existence of Universal Finite or Pushdown Automata

It is well known that there exist universal Turing machines (UTM). Such a UTM simulates any special Turing machine (TM) M in a certain way. There are several ways of simulation. One is that a UTM U simulating a TM M with input w halts if and only if M halts on input w. Another possibility is that any computation step of M is simulated by U using some number of steps which are be restricted by s...

متن کامل

A Brief Overview of Decoding Techniques for Large Vocabulary Continuous Speech Recognition

A number of decoding strategies for large vocabulary speech recognition are examined from the viewpoint of their search space representation. Different design solutions are compared with respect to the integration of linguistic and acoustic constraints, as implied by M-gram LMs and cross-word phonetic contexts. This study is articulated along two main axes, namely, the network expansion and the...

متن کامل

Efficient Path Counting Transducers for Minimum Bayes-Risk Decoding of Statistical Machine Translation Lattices

This paper presents an efficient implementation of linearised lattice minimum Bayes-risk decoding using weighted finite state transducers. We introduce transducers to efficiently count lattice paths containing n-grams and use these to gather the required statistics. We show that these procedures can be implemented exactly through simple transformations of word sequences to sequences of n-grams....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1704.03987  شماره 

صفحات  -

تاریخ انتشار 2017