Composing Finite State Transducers on GPUs
Not on the map. Why?
Abstract (arXiv)
Weighted finite-state transducers (FSTs) are frequently used in language processing to handle tasks such as part-of-speech tagging and speech recognition. There has been previous work using multiple CPU cores to accelerate finite state algorithms, but limited attention has been given to parallel graphics processing unit (GPU) implementations. In this paper, we introduce the first (to our knowledge) GPU implementation of the FST composition operation, and we also discuss the optimizations used to achieve the best performance on this architecture. We show that our approach obtains speedups of up to 6x over our serial implementation and 4.5x over OpenFST.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 May 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1; 2025: 1.
4 papers.
- 2024Automata-based constraints for language model decodingcited by 51
- 2023Implementing contextual biasing in GPU decoder for online ASRcited by 4
- 2025Bregman Conditional Random Fields: Sequence Labeling with Parallelizable Inference Algorithmscited by 1
- 2021Parallel Composition of Weighted Finite-State Transducerscited by 0
- 2025Bregman Conditional Random Fields: Sequence Labeling with Parallelizable Inference Algorithms31 May 2025
- 2024Automata-based constraints for language model decoding11 Jul 2024
- 2023Implementing contextual biasing in GPU decoder for online ASR23 Jun 2023
- 2021Parallel Composition of Weighted Finite-State Transducers6 Oct 2021