Composing Finite State Transducers on GPUs

2018-05-16 · ACL 2018 7 · Arturo Argueta, David Chiang

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.

📄 PDF Abstract BibTeX arXiv:1805.06383

Code (0)

등록된 구현이 없습니다.

Tasks

CPUGPUPart-Of-Speech Tagging speech-recognition Speech Recognition

Decoding with Finite-State Transducers on GPUs

2017-01-11 · EACL 2017 4 · Arturo Argueta, David Chiang

Weighted finite automata and transducers (including hidden Markov models and conditional random fields) are widely used in natural language processing (NLP) to perform tasks such as morphological analysis, part-of-speech…

Chunking GPU Morphological Analysis named-entity-recognition+5

Finite-state Model of Shupamem Reduplication

2021-08-01 · ACL (SIGMORPHON) 2021 8 · Magdalena Markowska, Jeffrey Heinz, Owen Rambow

Shupamem, a language of Western Cameroon, is a tonal language which also exhibits the morpho-phonological process of full reduplication. This creates two challenges for finite-state model of its morpho-syntax and morphop…

model

Composing extended top-down tree transducers

2012-04-01 · EACL 2012 4 · Aur{\'e}lie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti

Machine Translation

Finite-state morphological transducers for three Kypchak languages

2014-05-01 · LREC 2014 5 · Jonathan Washington, Ilnar Salimzyanov, Francis Tyers

This paper describes the development of free/open-source finite-state morphological transducers for three Turkic languages―Kazakh, Tatar, and Kumyk―representing one language from each of the three sub-branches of the Kyp…

Machine Translation

A Transaction Represented with Weighted Finite-State Transducers

2023-02-01 · J. Nathaniel Holmes, Homayoon Beigi

Not all contracts are good, but all good contracts can be expressed as a finite-state transition system ("State-Transition Contracts"). Contracts that can be represented as State-Transition Contracts discretize fat-taile…