LAST: Scalable Lattice-Based Speech Modelling in JAX

Despite these WFSA algorithms We refer readers to [8, 9] for a comprehensive introduction to being well-known in the literature, new challenges finite state automata and related algorithms. A weighted finite arise from performance characteristics of modern architectures, state automaton (WFSA) A = (Σ, Q, i, f, E) over a semiring and from nuances in automatic differentiation. We describe (K,,, 0, 1) is specified by a finite alphabet Σ, a finite set a suite of generally applicable techniques employed in of states Q, an initial state i Q, a final state f, and a finite LAST to address these challenges, and demonstrate their effectiveness set of arcs E Q (Σ {ǫ}) K Q (ǫ denotes the with benchmarks on TPUv3 and V100 GPU.