Results 1 to 10 of about 318,734 (153)
Mlphon: A Multifunctional Grapheme-Phoneme Conversion Tool Using Finite State Transducers
IEEE Access, 2022 In this article we present the design and the development of a knowledge based computational linguistic tool, Mlphon for Malayalam language. Mlphon computationally models linguistic rules using finite state transducers and performs multiple functions ...
Kavya Manohar, A. R. Jayan, Rajeev Rajan
doaj +2 more sources
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power [PDF]
Beyond the Horizon of Computability16th Conference on Computability in Europe, 2020 An iterated uniform finite-state transducer (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin ...
Kutrib M +3 more
europepmc +2 more sources
Finite-State Complexity and the Size of Transducers [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the state-size of transducers needed for minimal descriptions of arbitrary strings and, as our main result ...
Cristian Calude +2 more
doaj +4 more sources
Computing and classifying reduplication with 2-way finite-state transducers
Journal of Language Modelling, 2020 This article describes a novel approach to the computational modeling of reduplication. Reduplication is often treated as a stumbling block within finite-state treatments of morphology because they cannot adequately capture the productivity of unbounded ...
Hossep Dolatian, Jeffrey Heinz
doaj +2 more sources
Transductions Computed by One-Dimensional Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to compute the ...
Martin Kutrib, Andreas Malcher
doaj +4 more sources
Automata in SageMath---Combinatorics meet Theoretical Computer Science [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved ...
Clemens Heuberger +2 more
doaj +3 more sources
Lipschitz Robustness of Finite-state Transducers [PDF]
Foundations of Software Technology and Theoretical Computer Science, 2014 We investigate the problem of checking if a finite-state transducer is robust to uncertainty in its input. Our notion of robustness is based on the analytic notion of Lipschitz continuity --- a transducer is K-(Lipschitz) robust if the perturbation in ...
Henzinger, Thomas A. +2 more
core +5 more sources
Logical and Algebraic Characterizations of Rational Transductions [PDF]
Logical Methods in Computer Science, 2019 Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic.
Emmanuel Filiot +2 more
doaj +4 more sources
On the model checking of finite state transducers over semigroups
Труды Института системного программирования РАН, 2018 Sequential reactive systems represent programs that interact with the environment by receiving signals or requests and react to these requests by performing operations with data.
A. R. Gnatenko, V. A. Zakharov
doaj +2 more sources
Finstreder: Simple and fast Spoken Language Understanding with Finite State Transducers using modern Speech-to-Text models [PDF]
arXiv.org, 2022 In Spoken Language Understanding (SLU) the task is to extract important information from audio commands, like the intent of what a user wants the system to do and special entities like locations or numbers.
Daniel Bermuth +2 more
semanticscholar +1 more source