Results 11 to 20 of about 1,103,073 (309)
Deep Adaptive Learning for Writer Identification based on Single Handwritten Word Images [PDF]
Pattern Recognition, 2018 There are two types of information in each handwritten word image: explicit information which can be easily read or derived directly, such as lexical content or word length, and implicit attributes such as the author's identity.
He, Sheng, Schomaker, Lambert
core +4 more sources
Skip-Gram-KR: Korean Word Embedding for Semantic Clustering
IEEE Access, 2019 Deep learning algorithms are used in various applications for pattern recognition, natural language processing, speech recognition, and so on. Recently, neural network-based natural language processing techniques use fixed length word embedding.
Sun-Young Ihm, Ji-Hye Lee, Young-Ho Park
doaj +2 more sources
A Word on Words in Words: How Do Embedded Words Affect Reading?
Journal of Cognition, 2018 A surprisingly small portion of reading research has been dedicated to investigating how the visual word recognition process is influenced by embedded words (e.g., ‘'arm'’ in ‘'charm'’), and no research has yet investigated embedded words in a natural ...
Joshua Snell +2 more
doaj +2 more sources
Cognitive Neuropsychology, 2022 There is debate regarding whether most articulatory planning occurs offline (rather than online) and whether the products of off-line processing are stored in a separate articulatory buffer until a large enough chunk is ready for production.
C. Romani +3 more
semanticscholar +1 more source
Faster Algorithms for Text-to-Pattern Hamming Distances [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2023 We study the classic Text-to-Pattern Hamming Distances problem: given a pattern P of length m and a text T of length n, both over a polynomial-size alphabet, compute the Hamming distance between P and $T[i \ldots i+m-1]$ for every shift i, under the ...
Timothy M. Chan +3 more
semanticscholar +1 more source
Checking whether a word is Hamming-isometric in linear time [PDF]
Theoretical Computer Science, 2021 A finite word $f$ is Hamming-isometric if for any two word $u$ and $v$ of same length avoiding $f$, $u$ can be transformed into $v$ by changing one by one all the letters on which $u$ differs from $v$, in such a way that all of the new words obtained in ...
M-P B'eal, M. Crochemore
semanticscholar +1 more source
Descent distribution on Catalan words avoiding a pattern of length at most three [PDF]
Discrete Mathematics, 2018 Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan words avoiding a pattern of length at most three: for each such a pattern $p$ we provide a bivariate generating ...
Baril, Jean-Luc +2 more
openaire +3 more sources
Современные информационные технологии и IT-образование, 2020 The method of estimating the period of an almost periodic sequence is proposed. The period of an almost periodic sequence is the length of the smallest periodic pattern that composes the corresponding completely periodic sequence by repetition.
Galina Zhukova +3 more
doaj +1 more source
Avoiding vincular patterns on alternating words [PDF]
, 2016 A word $w=w_1w_2\cdots w_n$ is alternating if either $w_1w_3\cdots$ (when the word is up-down) or $w_1 ...
Gao, Alice L. L. +2 more
core +2 more sources