English
Related papers

Related papers: Streaming Transformations of Infinite Ordered-Data…

200 papers

We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite…

Formal Languages and Automata Theory · Computer Science 2018-03-09 Jörg Endrullis , Juhani Karhumäki Jan Willem Klop , Aleksi Saarela

The Liquid Reasoning Transformer (LRT) is a transformer architecture designed for inference with adaptive depths using iterative changes, discard-based correction, and a learned stopping mechanism. Instead of relying on a single feedforward…

Machine Learning · Computer Science 2025-12-16 Shivansh Sahni , Wenzhi Zhang

The training of automatic speech recognition (ASR) with little to no supervised data remains an open question. In this work, we demonstrate that streaming Transformer-Transducer (TT) models can be trained from scratch in consumer and…

Speech Translation (ST) is the task of translating speech in one language into text in another language. Traditional cascaded approaches for ST, using Automatic Speech Recognition (ASR) and Machine Translation (MT) systems, are prone to…

Computation and Language · Computer Science 2021-07-14 Tu Anh Dinh

Speech-to-text translation (ST), which translates source language speech into target language text, has attracted intensive attention in recent years. Compared to the traditional pipeline system, the end-to-end ST model has potential…

Computation and Language · Computer Science 2019-12-17 Yuchen Liu , Jiajun Zhang , Hao Xiong , Long Zhou , Zhongjun He , Hua Wu , Haifeng Wang , Chengqing Zong

Standard Large Language Models (LLMs) are predominantly designed for static inference with pre-defined inputs, which limits their applicability in dynamic, real-time scenarios. To address this gap, the streaming LLM paradigm has emerged.…

Computation and Language · Computer Science 2026-04-21 Junlong Tong , Zilong Wang , YuJie Ren , Peiran Yin , Hao Wu , Wei Zhang , Xiaoyu Shen

In interactive automatic speech recognition (ASR) systems, low-latency requirements limit the amount of search space that can be explored during decoding, particularly in end-to-end neural ASR. In this paper, we present a novel streaming…

Audio and Speech Processing · Electrical Eng. & Systems 2024-01-29 Denis Filimonov , Prabhat Pandey , Ariya Rastrow , Ankur Gandhe , Andreas Stolcke

Sequence-to-sequence models have been widely used in end-to-end speech processing, for example, automatic speech recognition (ASR), speech translation (ST), and text-to-speech (TTS). This paper focuses on an emergent sequence-to-sequence…

The attention-based Transformer model has achieved promising results for speech recognition (SR) in the offline mode. However, in the streaming mode, the Transformer model usually incurs significant latency to maintain its recognition…

Audio and Speech Processing · Electrical Eng. & Systems 2020-05-05 Chengyi Wang , Yu Wu , Shujie Liu , Jinyu Li , Liang Lu , Guoli Ye , Ming Zhou

Word reordering is one of the most difficult aspects of statistical machine translation (SMT), and an important factor of its quality and efficiency. Despite the vast amount of research published to date, the interest of the community in…

Computation and Language · Computer Science 2017-02-27 Arianna Bisazza , Marcello Federico

An important yet rarely tackled problem in dialogue state tracking (DST) is scalability for dynamic ontology (e.g., movie, restaurant) and unseen slot values. We focus on a specific condition, where the ontology is unknown to the state…

Computation and Language · Computer Science 2019-07-09 Guan-Lin Chao , Ian Lane

In the cascaded approach to spoken language translation (SLT), the ASR output is typically punctuated and segmented into sentences before being passed to MT, since the latter is typically trained on written text. However, erroneous…

Computation and Language · Computer Science 2022-10-19 Sukanta Sen , Ondřej Bojar , Barry Haddow

This thesis studies the single-use restriction for register automata and transducers over infinite alphabets. The restriction requires that a read-access to a register should have the side effect of destroying its contents. This constraint…

Formal Languages and Automata Theory · Computer Science 2024-06-28 Rafał Stefański

We present a flexible rule compiler developed for a text-to-speech (TTS) system. The compiler converts a set of rules into a finite-state transducer (FST). The input and output of the FST are subject to parameterization, so that the system…

Computation and Language · Computer Science 2007-05-23 Wojciech Skut , Stefan Ulrich , Kathrine Hammervold

Transducers extend finite state automata with outputs, and describe transformations from strings to strings. Sequential transducers, which have a deterministic behaviour regarding their input, are of particular interest. However, unlike…

Logic in Computer Science · Computer Science 2019-03-01 Pierre-Alain Reynier , Didier Villevalois

While speech recognition Word Error Rate (WER) has reached human parity for English, long-form dictation scenarios still suffer from segmentation and punctuation problems resulting from irregular pausing patterns or slow speakers.…

Computation and Language · Computer Science 2022-12-07 Piyush Behre , Sharman Tan , Padma Varadharajan , Shuangyu Chang

We consider symbolic tree automata (sta) and symbolic tree transducers (stt). We characterize s-recognizable tree languages (which are the tree languages recognizable by sta) in terms of (classical) recognizable tree languages and…

Formal Languages and Automata Theory · Computer Science 2012-08-28 Zoltán Fülöp , Heiko Vogler

Streaming speech-to-text translation (StreamST) is the task of automatically translating speech while incrementally receiving an audio stream. Unlike simultaneous ST (SimulST), which deals with pre-segmented speech, StreamST faces the…

Sound · Computer Science 2024-06-11 Sara Papi , Marco Gaido , Matteo Negri , Luisa Bentivogli

Although Transformers have gained success in several speech processing tasks like spoken language understanding (SLU) and speech translation (ST), achieving online processing while keeping competitive performance is still essential for…

Computation and Language · Computer Science 2022-04-20 Keqi Deng , Shinji Watanabe , Jiatong Shi , Siddhant Arora

Transformer has achieved competitive performance against state-of-the-art end-to-end models in automatic speech recognition (ASR), and requires significantly less training time than RNN-based models. The original Transformer, with…

Audio and Speech Processing · Electrical Eng. & Systems 2020-08-14 Wenyong Huang , Wenchao Hu , Yu Ting Yeung , Xiao Chen
‹ Prev 1 3 4 5 6 7 10 Next ›