Results 191 to 200 of about 159,489 (252)
Enhancing Hindi OCR robustness with CRNN-ResNet50: a data augmentation approach on the devanagari dataset. [PDF]
Sci RepKumar S, Sourabh S, Pati J, Kumar S.
europepmc +1 more source
Exploring translator's style in children's literature: A case study of Nicky Harman's English translations of Huang Beijia's two works. [PDF]
PLoS OneHe H, Wang H.
europepmc +1 more source
Learning semantic similarity from sentence pairs using hybrid features centric approach and explainable siamese neural networks. [PDF]
PLoS OneZhao W, Hu C.
europepmc +1 more source
Adaptive and multi-scale feature fusion for Chinese news headline classification. [PDF]
PLoS OneYan Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Knowledge of word length does not constrain word identification
Psychological Research, 2003Use of word length for word identification was examined in three naming experiments and one sentence reading experiment in which a foveally presented cue either matched or mismatched the length of a subsequently presented target word. Properties of the target were also manipulated so that it was either a high- or low-frequency word or so that its ...
Albrecht W Inhoff, Inhoff Albrecht W
exaly +3 more sources
Information Processing Letters, 1987
Word chains are an extension of addition chains to words. We show that over a q-letter alphabet, any long enough word admits a word chain of length at most \((1+\epsilon)n/\log_ q n\), for a fixed arbitrary \(\epsilon >0\); there exist words with no chain shorter than \(n/\log_{q- 1} n\). Several examples are given. Finally, we show that words with few
Berstel, Jean, Brlek, Srečko
openaire +3 more sources
Word chains are an extension of addition chains to words. We show that over a q-letter alphabet, any long enough word admits a word chain of length at most \((1+\epsilon)n/\log_ q n\), for a fixed arbitrary \(\epsilon >0\); there exist words with no chain shorter than \(n/\log_{q- 1} n\). Several examples are given. Finally, we show that words with few
Berstel, Jean, Brlek, Srečko
openaire +3 more sources
The Word-length Effect and Disyllabic Words
The Quarterly Journal of Experimental Psychology Section A, 2000Three experiments compared immediate serial recall of disyllabic words that differed on spoken duration. Two sets of long- and short-duration words were selected, in each case maximizing duration differences but matching for frequency, familiarity, phonological similarity, and number of phonemes, and controlling for semantic associations. Serial recall
P, Lovatt, S E, Avons, J, Masterson
openaire +2 more sources