English
Related papers

Related papers: Sequentiality of String-to-Context Transducers

200 papers

The question whether P equals NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine the analogous problem for finite transducers and automata. Every nondeterministic…

Computational Complexity · Computer Science 2021-05-03 Elisabet Burjons , Fabian Frei , Martin Raszyk

Sentence encoders, which produce sentence embeddings using neural networks, are typically evaluated by how well they transfer to downstream tasks. This includes semantic similarity, an important task in natural language understanding.…

Computation and Language · Computer Science 2018-11-02 Li Zhang , Steven R. Wilson , Rada Mihalcea

Several abstract machines that operate on symbolic input alphabets have been proposed in the last decade, for example, symbolic automata or lattice automata. Applications of these types of automata include software security analysis and…

Formal Languages and Automata Theory · Computer Science 2019-10-18 Andreas Stahlbauer

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

This work introduces TTS-Transducer - a novel architecture for text-to-speech, leveraging the strengths of audio codec models and neural transducers. Transducers, renowned for their superior quality and robustness in speech recognition, are…

Audio and Speech Processing · Electrical Eng. & Systems 2025-04-16 Vladimir Bataev , Subhankar Ghosh , Vitaly Lavrukhin , Jason Li

Many machine learning tasks can be expressed as the transformation---or \emph{transduction}---of input sequences into output sequences: speech recognition, machine translation, protein secondary structure prediction and text-to-speech to…

Neural and Evolutionary Computing · Computer Science 2012-11-16 Alex Graves

Context sensitive rewrite rules have been widely used in several areas of natural language processing, including syntax, morphology, phonology and speech processing. Kaplan and Kay, Karttunen, and Mohri & Sproat have given various…

Computation and Language · Computer Science 2007-05-23 Dale Gerdemann , Gertjan van Noord

We study two formalisms that allow to compare transducers over words under origin semantics: rational and regular resynchronizers, and show that the former are captured by the latter. We then consider some instances of the following…

Formal Languages and Automata Theory · Computer Science 2019-06-26 Sougata Bose , Shankara Narayanan Krishna , Anca Muscholl , Vincent Penelle , Gabriele Puppis

We answer an open question in the theory of transducer degrees on the existence of a diamond structure in the transducer hierarchy. Transducer degrees are the equivalence classes formed by word transformations which can be realized by a…

Formal Languages and Automata Theory · Computer Science 2025-12-17 Noah Kaufmann

String-to-string MSO interpretations are like Courcelle's MSO transductions, except that a single output position can be represented using a tuple of input positions instead of just a single input position. In particular, the output length…

Formal Languages and Automata Theory · Computer Science 2019-05-31 Mikołaj Bojańczyk , Sandra Kiefer , Nathan Lhote

Solving the challenges of automatic machine translation of Building Automation System text metadata is a crucial first step in efficiently deploying smart building applications. The vocabulary used to describe building metadata appears…

Computation and Language · Computer Science 2022-12-06 David Waterworth , Subbu Sethuvenkatraman , Quan Z. Sheng

The notion of delay between finite transducers is a core element of numerous fundamental results of transducer theory. The goal of this work is to provide a similar notion for more complex abstract machines: we introduce a new notion of…

Formal Languages and Automata Theory · Computer Science 2024-04-30 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

Sequential modelling entails making sense of sequential data, which naturally occurs in a wide array of domains. One example is systems that interact with users, log user actions and behaviour, and make recommendations of items of potential…

Information Retrieval · Computer Science 2021-09-15 Christian Hansen

Neural sequence-to-sequence models are well established for applications which can be cast as mapping a single input sequence into a single output sequence. In this work, we focus on one-to-many sequence transduction problems, such as…

Audio and Speech Processing · Electrical Eng. & Systems 2020-06-26 Jing Shi , Xuankai Chang , Pengcheng Guo , Shinji Watanabe , Yusuke Fujita , Jiaming Xu , Bo Xu , Lei Xie

MapReduce is a popular programming model for data parallel computation. In MapReduce, the reducer produces an output from a list of inputs. Due to the scheduling policy of the platform, the inputs may arrive at the reducers in different…

Formal Languages and Automata Theory · Computer Science 2016-10-03 Yu-Fang Chen , Lei Song , Zhilin Wu

Transformers have become the dominant architecture for sequence modeling tasks such as natural language processing or audio processing, and they are now even considered for tasks that are not naturally sequential such as image…

Machine Learning · Computer Science 2024-03-05 Jorg Bornschein , Yazhe Li , Amal Rannen-Triki

In-context learning refers to the ability of a model to condition on a prompt sequence consisting of in-context examples (input-output pairs corresponding to some task) along with a new query input, and generate the corresponding output.…

Computation and Language · Computer Science 2023-08-15 Shivam Garg , Dimitris Tsipras , Percy Liang , Gregory Valiant

Context-aware translation can be achieved by processing a concatenation of consecutive sentences with the standard Transformer architecture. This paper investigates the intuitive idea of providing the model with explicit information about…

Computation and Language · Computer Science 2023-04-06 Lorenzo Lupo , Marco Dinarelli , Laurent Besacier

In order to achieve deep natural language understanding, syntactic constituent parsing is a vital step, highly demanded by many artificial intelligence systems to process both text and speech. One of the most recent proposals is the use of…

Computation and Language · Computer Science 2022-12-26 Daniel Fernández-González , Carlos Gómez-Rodríguez

Hyperproperties are properties that relate multiple execution traces. Previous work on monitoring hyperproperties focused on synchronous hyperproperties, usually specified in HyperLTL. When monitoring synchronous hyperproperties, all traces…

Programming Languages · Computer Science 2023-08-08 Marek Chalupa , Thomas A. Henzinger