Results 31 to 40 of about 8,270 (198)
Electronic Proceedings in Theoretical Computer Science, 2011 Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite partial word w,
Francine Blanchet-Sadri +4 more
doaj +1 more source
On infinite permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as a linear ordering of a finite or countable set. Then we introduce and characterize periodic permutations; surprisingly, for each period $t$ there is an ...
Dmitri G. Fon-Der-Flaass, Anna E. Frid
doaj +1 more source
EURASIP Journal on Audio, Speech, and Music Processing, 2023 This article presents the research work on improving speech recognition systems for the morphologically complex Malayalam language using subword tokens for language modeling.
Kavya Manohar, Jayan A R, Rajeev Rajan
doaj +1 more source
Decision Trees for Binary Subword-Closed Languages
Entropy, 2023 In this paper, we study arbitrary subword-closed languages over the alphabet {0,1} (binary subword-closed languages). For the set of words L(n) of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision ...
Mikhail Moshkov
doaj +1 more source
Graph Logics with Rational Relations [PDF]
Logical Methods in Computer Science, 2013 We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications.
Pablo Barcelo +2 more
doaj +1 more source
Morphology Matters: A Multilingual Language Modeling Analysis
Transactions of the Association for Computational Linguistics, 2021 Prior studies in multilingual language modeling (e.g., Cotterell et al., 2018; Mielke et al., 2019) disagree on whether or not inflectional morphology makes languages harder to model. We attempt to resolve the disagreement and extend those studies.
Hyunji Hayley Park +5 more
doaj +1 more source
What neural networks know about linguistic complexity
Russian Journal of Linguistics, 2022 Linguistic complexity is a complex phenomenon, as it manifests itself on different levels (complexity of texts to sentences to words to subword units), through different features (genres to syntax to semantics), and also via different tasks (language ...
Serge Aleksandrovich Sharoff
doaj +1 more source
On subword complexities of homomorphic images of languages [PDF]
RAIRO. Informatique théorique, 1982 Andrzej Ehrenfeucht, G. Rozenberg
openalex +3 more sources
Extremal sequences of polynomial complexity [PDF]
, 2013 The joint spectral radius of a bounded set of $d \times d$ real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn from that set is
Hare, Kevin G. +2 more
core +2 more sources
The Maximal Complexity of Quasiperiodic Infinite Words
Axioms, 2021 A quasiperiod of a finite or infinite string is a word whose occurrences cover every part of the string. An infinite string is referred to as quasiperiodic if it has a quasiperiod.
Ludwig Staiger
doaj +1 more source