English
Related papers

Related papers: Streaming Transformations of Infinite Ordered-Data…

200 papers

Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…

Logic in Computer Science · Computer Science 2025-02-11 Titouan Carette , Marc de Visme , Vivien Ducros , Victor Lutfalla , Etienne Moutot

Scene text recognition (STR) enables computers to recognize and read the text in various real-world scenes. Recent STR models benefit from taking linguistic information in addition to visual cues into consideration. We propose a novel…

Computer Vision and Pattern Recognition · Computer Science 2022-11-10 Jie Wu , Ying Peng , Shengming Zhang , Weigang Qi , Jian Zhang

There has been great progress in improving streaming machine translation, a simultaneous paradigm where the system appends to a growing hypothesis as more source content becomes available. We study a related problem in which revisions to…

Computation and Language · Computer Science 2020-07-01 Naveen Arivazhagan , Colin Cherry , Wolfgang Macherey , George Foster

Compression algorithms and streaming algorithms are both powerful tools for dealing with massive data sets, but many of the best compression algorithms -- e.g., those based on the Burrows-Wheeler Transform -- at first seem incompatible with…

Information Theory · Computer Science 2008-04-19 Travis Gagie

Speech Translation (ST) is a machine translation task that involves converting speech signals from one language to the corresponding text in another language; this task has two different approaches, namely the traditional cascade and the…

Computation and Language · Computer Science 2025-10-14 Nam Luu , Ondřej Bojar

A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regular, i.e. it can be computed by a deterministic two-way…

Formal Languages and Automata Theory · Computer Science 2022-11-04 Olivier Carton , Gaëtan Douéneau-Tabot

Letter-to-letter transducers are a standard formalism for modeling reactive systems. Often, two transducers that model similar systems differ locally from one another, by behaving similarly, up to permutations of the input and output…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Antonio Abu Nassar , Shaull Almagor

Speech-to-text translation pertains to the task of converting speech signals in a language to text in another language. It finds its application in various domains, such as hands-free communication, dictation, video lecture transcription,…

Computation and Language · Computer Science 2024-06-11 Nivedita Sethiya , Chandresh Kumar Maurya

Streaming processing of speech audio is required for many contemporary practical speech recognition tasks. Even with the large corpora of manually transcribed speech data available today, it is impossible for such corpora to cover…

Computation and Language · Computer Science 2021-04-12 Rodrigo Cabrera , Xiaofeng Liu , Mohammadreza Ghodsi , Zebulun Matteson , Eugene Weinstein , Anjuli Kannan

While large language models (LLMs) have been applied to automatic speech recognition (ASR), the task of making the model streamable remains a challenge. This paper proposes a novel model architecture, Transducer-Llama, that integrates LLMs…

Computation and Language · Computer Science 2024-12-24 Keqi Deng , Jinxi Guo , Yingyi Ma , Niko Moritz , Philip C. Woodland , Ozlem Kalinli , Mike Seltzer

Speech to speech translation (S2ST) is a transformative technology that bridges global communication gaps, enabling real time multilingual interactions in diplomacy, tourism, and international trade. Our review examines the evolution of…

Computation and Language · Computer Science 2025-03-10 Mohammad Sarim , Saim Shakeel , Laeeba Javed , Jamaluddin , Mohammad Nadeem

Regular model checking is an exploration technique for infinite state systems where state spaces are represented as regular languages and transition relations are expressed using rational relations over infinite (or finite) strings. We…

Logic in Computer Science · Computer Science 2021-07-13 Vrunda Dave , Taylor Dohmen , Shankara Narayana Krishna , Ashutosh Trivedi

String transductions that are definable in monadic second-order (mso) logic (without the use of parameters) are exactly those realized by deterministic two-way finite state transducers. Nondeterministic mso definable string transductions…

Logic in Computer Science · Computer Science 2008-11-24 Joost Engelfriet , Hendrik Jan Hoogeboom

In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Léo Exibard , Emmanuel Filiot , Nathan Lhote , Pierre-Alain Reynier

Some of the most relevant document schemas used online, such as XML and JSON, have a nested format. In the last decade, the task of extracting data from nested documents over streams has become especially relevant. We focus on the streaming…

Databases · Computer Science 2022-01-11 Martín Muñoz , Cristian Riveros

Recent research shows end-to-end ASR systems can recognize overlapped speech from multiple speakers. However, all published works have assumed no latency constraints during inference, which does not hold for most voice assistant…

Audio and Speech Processing · Electrical Eng. & Systems 2021-02-22 Ilya Sklyar , Anna Piunova , Yulan Liu

The recurrent neural network transducer (RNN-T) is a prominent streaming end-to-end (E2E) ASR technology. In RNN-T, the acoustic encoder commonly consists of stacks of LSTMs. Very recently, as an alternative to LSTM layers, the Conformer…

The Self-Optimal-Transport (SOT) feature transform is designed to upgrade the set of features of a data instance to facilitate downstream matching or grouping related tasks. The transformed set encodes a rich representation of high order…

Computer Vision and Pattern Recognition · Computer Science 2022-04-08 Daniel Shalam , Simon Korman

In real-world applications, users often require both translations and transcriptions of speech to enhance their comprehension, particularly in streaming scenarios where incremental generation is necessary. This paper introduces a streaming…

Computation and Language · Computer Science 2023-10-03 Sara Papi , Peidong Wang , Junkun Chen , Jian Xue , Jinyu Li , Yashesh Gaur

In this paper we present an end-to-end speech recognition model with Transformer encoders that can be used in a streaming speech recognition system. Transformer computation blocks based on self-attention are used to encode both audio and…

Audio and Speech Processing · Electrical Eng. & Systems 2020-02-18 Qian Zhang , Han Lu , Hasim Sak , Anshuman Tripathi , Erik McDermott , Stephen Koo , Shankar Kumar