Results 11 to 20 of about 749,254 (279)
Space-Efficient Re-Pair Compression [PDF]
, 2016 Re-Pair is an effective grammar-based compression scheme achieving strong compression rates in practice. Let $n$, $\sigma$, and $d$ be the text length, alphabet size, and dictionary size of the final grammar, respectively.
Bille, Philip +2 more
core +2 more sources
Fragment answers and double negation in strict negative concord languages [PDF]
, 2016 International audienceThis paper revisits the phenomenon of negative concord (NC) as an instance of polarity sensitivity. We shed light on a new set of data regarding n-words as fragment answers to negative questions and show that we find unexpected ...
Falaus, Anamaria, Nicolae, Andreea
core +5 more sources
Lyndon Array Construction during Burrows-Wheeler Inversion [PDF]
, 2017 In this paper we present an algorithm to compute the Lyndon array of a string $T$ of length $n$ as a byproduct of the inversion of the Burrows-Wheeler transform of $T$.
Louza, Felipe A. +3 more
core +3 more sources
'n Woord van AFRILEX/A few words from AFRILEX
Lexikos, 2012 Foreword by the president of ...
Rufus Gouws
doaj +1 more source
Semantic Bimodal Presentation Differentially Slows Working Memory Retrieval
Brain Sciences, 2023 Although evidence has shown that working memory (WM) can be differentially affected by the multisensory congruency of different visual and auditory stimuli, it remains unclear whether different multisensory congruency about concrete and abstract words ...
Jia Cheng +3 more
doaj +1 more source
Journal of Language Teaching and Research, 2022 This article investigates n-words in Dawurotsuwa, which is classified under the Omotic language family under the Afroasiatic phylum. Speakers of the language are found in Ethiopia, specifically in the southwest part of the country. The study aims to describe n-words in this language, which is one of the scarcely described languages in the area. N-words
openaire +1 more source
Path and Ancestor Queries over Trees with Multidimensional Weight Vectors [PDF]
, 2019 We consider an ordinal tree T on n nodes, with each node assigned a d-dimensional weight vector w in {1,2,...,n}^d, where d in N is a constant. We study path queries as generalizations of well-known {orthogonal range queries}, with one of the dimensions ...
He, Meng, Kazi, Serikzhan
core +1 more source
A Classification of Trapezoidal Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word
Gabriele Fici
doaj +1 more source
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words [PDF]
, 2012 Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional ...
Kao, Ming-Yang +3 more
core +2 more sources
A study on the classification of stylistic and formal features in English based on corpus data testing [PDF]
PeerJ Computer Science, 2023 The traditional statistical and rule combination algorithm lacks the determination of the inner cohesion of words, and the N-gram algorithm does not limit the length of N, which will produce a large number of invalid word strings, consume time and reduce
Shuhui Li
doaj +2 more sources