Results 21 to 30 of about 318,853 (271)
Decoding with Finite-State Transducers on GPUs [PDF]
Conference of the European Chapter of the Association for Computational Linguistics, 2017 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 ...
David Chiang, Arturo Argueta
semanticscholar +1 more source
Synthesis of Data Word Transducers [PDF]
, 2021 In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifications are usually modelled as logical formulae or automata over infinite
Exibard, Léo +2 more
core +4 more sources
Hidden semi-Markov Model based earthquake classification system using Weighted Finite-State Transducers [PDF]
Nonlinear Processes in Geophysics, 2011 Automatic earthquake detection and classification is required for efficient analysis of large seismic datasets. Such techniques are particularly important now because access to measures of ground motion is nearly unlimited and the target waveforms ...
M. Beyreuther, J. Wassermann
doaj +1 more source
FST-Based Pronunciation Lexicon Compression for Speech Engines
International Journal of Advanced Robotic Systems, 2012 Finite-state transducers are frequently used for pronunciation lexicon representations in speech engines, in which memory and processing resources are scarce. This paper proposes two possibilities for further reducing the memory footprint of finite-state
Žiga Golob +4 more
doaj +1 more source
On the Minimization of Finite State Trans- ducers over Semigroups
Моделирование и анализ информационных систем, 2016 Finite state transducers over semigroups are regarded as a formal model of sequential reactive programs that operate in the interaction with the environment.
V. A. Zakharov, G. G. Temerbekova
doaj +1 more source
On Functionality of Visibly Pushdown Transducers [PDF]
, 2010 Visibly pushdown transducers form a subclass of pushdown transducers that (strictly) extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations.
C. Koch +16 more
core +5 more sources
Modeling and analysis of the behavior of successive reactive programs
Труды Института системного программирования РАН, 2018 Finite state transducers extend the finite state automata to model functions on strings or lists. They may be used also as simple models of sequential reactive programs. These programs operate in the interaction with the environment permanently receiving
V. A. Zakharov
doaj +1 more source
The architecture of a system for full-text search by speech data based on a global search index [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2021 This paper presents the architecture of a system for full-text search by speech data based on a global search index that combines information about all speech recordings in the archive. The architecture includes two independent blocks: an indexing block,
Oleg E. Petrov
doaj +1 more source
Descriptional Complexity of Iterated Uniform Finite-State Transducers
Workshop on Descriptional Complexity of Formal Systems, 2019 We introduce the deterministic computational model of an iterated uniform finite-state transducer (iufst). A iufst performs the same length-preserving transduction on several left-to-right sweeps.
Martin Kutrib +3 more
semanticscholar +1 more source
A Generalised Twinning Property for Minimisation of Cost Register Automata [PDF]
, 2015 Weighted automata (WA) extend finite-state automata by associating with transitions weights from a semiring S, defining functions from words to S.
Alur R. +3 more
core +4 more sources