Results 11 to 20 of about 318,853 (271)
Finite-state super transducers for compact language resource representation in edge voice-AI
Systems Science & Control Engineering, 2022 Finite-state transducers have been proven to yield compact representations of pronunciation dictionaries used for grapheme-to-phoneme conversion in speech engines running on low-resource embedded platforms.
Simon Dobrišek +2 more
doaj +1 more source
On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducers
RAIRO - Theoretical Informatics and Applications, 2021 Finite automata and finite state transducers belong to the bases of (theoretical) computer science with many applications. On the other hand, DNA computing and related bio-inspired paradigms are relatively new fields of computing.
B. Nagy, Zita Kovács
semanticscholar +1 more source
Composition of weighted finite transducers in MapReduce
Journal of Big Data, 2021 Weighted finite-state transducers have been shown to be a general and efficient representation in many applications such as text and speech processing, computational biology, and machine learning.
Bilal Elghadyry +2 more
doaj +1 more source
Neural Grammatical Error Correction with Finite State Transducers [PDF]
North American Chapter of the Association for Computational Linguistics, 2019 Grammatical error correction (GEC) is one of the areas in natural language processing in which purely neural models have not yet superseded more traditional symbolic models.
Felix Stahlberg +2 more
semanticscholar +1 more source
Fragile words and Cayley type transducers [PDF]
International Journal of Group Theory, 2018 We address the problem of finding examples of non-bireversible transducers defining free groups, we show examples of transducers with sink accessible from every state which generate free groups, and, in general, we link this problem to the non-existence ...
Daniele D'Angeli, Emanuele Rodaro
doaj +1 more source
Synthesis of Computable Regular Functions of Infinite Words [PDF]
Logical Methods in Computer Science, 2022 Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming $\omega$-string transducers as well as deterministic two-way transducers with look-ahead.
V. Dave, E. Filiot, S. Krishna, N. Lhote
doaj +1 more source
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
Моделирование и анализ информационных систем, 2020 Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of Finite-State Automaton. In these models an automaton controls two heads that read or write symbols on the tapes in the one-way mode.
Vladimir A. Zakharov
doaj +1 more source
Recurrent Pattern Modelling in a Corpus of Armenian Manuscript Colophons [PDF]
Journal of Data Mining and Digital Humanities, 2018 Colophons of Armenian manuscripts are replete with yet untapped riches. Formulae are not the least among them: these recurrent stereotypical patterns conceal many clues as to the schools and networks of production and diffusion of books in Armenian ...
Emmanuel Van Elverdinghe
doaj +3 more sources
Composing Finite State Transducers on GPUs [PDF]
Annual Meeting of the Association for Computational Linguistics, 2018 Weighted finite state transducers (FSTs) are frequently used in language processing to handle tasks such as part-of-speech tagging and speech recognition.
Arturo Argueta, David Chiang
semanticscholar +1 more source
On the Minimization Problem for Sequential Programs
Моделирование и анализ информационных систем, 2017 First-order program schemata is one of the simplest models of sequential imperative programs intended for solving verification and optimization problems.
Vladimir A. Zakharov +1 more
doaj +1 more source