Decoding with Finite-State Transducers on GPUs
원문 초록
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 tagging, chunking, named entity recognition, speech recognition, and others. Parallelizing finite state algorithms on graphics processing units (GPUs) would benefit many areas of NLP. Although researchers have implemented GPU versions of basic graph algorithms, limited previous work, to our knowledge, has been done on GPU algorithms for weighted finite automata. We introduce a GPU implementation of the Viterbi and forward-backward algorithm, achieving decoding speedups of up to 5.2x over our serial implementation running on different computer architectures and 6093x over OpenFST.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Selecting and Merging: Towards Adaptable and Scalable Named Entity Recognition with Large Language Models
Label-Guided In-Context Learning for Named Entity Recognition
Named Entity Recognition in Historical Italian: The Case of Giacomo Leopardi's Zibaldone
Flippi: End To End GenAI Assistant for E-Commerce
Better Semi-supervised Learning for Multi-domain ASR Through Incremental Retraining and Data Filtering
Efficient Data Selection for Domain Adaptation of ASR Using Pseudo-Labels and Multi-Stage Filtering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.