نتایج جستجو برای: alphabetic method

تعداد نتایج: 1630969  

Journal: :Science 1971
N C Melchior G A Rechnitz M S Mohan

tem altogether, in contrast to our alphabet, which maps (at least in large part) into the level of phonemes. What is the critical feature of the difference between the Chinese logographic and the English alphabetic system which leads to reading difficulty? It could be the complete absence of sound mapping in Chinese; it could be the particular properties of the phoneme, rather than sound mappin...

Journal: :CoRR 2008
Stevan Harnad


Brian
Rotman
argues
that
(one)
“mind”
and
(one)
“god”
are
 only
conceivable,
literally,
because
of
(alphabetic)
literacy,
which
 allowed
us
to
designate
each
of
these
ghosts
as
an
incorporeal,
speaker‐ independent
“I”
(or,
in
the
case
of
infinity,
a
notional
agent
that
goes
on
 counting
forever).
I
argue
that
to
have
a
mind
is
to
have
the
capacity
to
 feel.
No
one
can
be
sure
which
organisms
f...

2014
Nattapong Tongtep Frans Coenen Thanaruk Theeramunkong

Text readability is typically defined in terms of “grade level”; the expected educational level of the reader at which the text is directed. Mechanisms for measuring readability in English documents are well established; however this is not in case in many other languages, such as syllabic alphabetic languages. In this paper seven different mechanisms for assessing the readability of syllabic a...

2005
Wengang Yin Brian Butterworth

A study of 11 Chinese brain-damaged patients with reading disorders indicates that reading aloud a nonalphabetic script, like reading alphabetic scripts, can be accomplished using two distinct routines: one which associates a whole written word with its complete pronunciation, and one which utilises parts of the written word. Each routine can be selectively impaired by brain-damage, resulting i...

Journal: :Nature Reviews Psychology 2022

Reading of alphabetic writing systems, such as English, has been extensively studied and most theories models reading are based on findings from these studies. This practice raises a practical question regarding whether systems can be extended to other Korean or Chinese, more fundamental about the universality mechanisms. In this Review, we discuss how different contribute an understanding univ...

Journal: :CoRR 2015
Nadia Ouali Sebti Djelloul Ziadi

The word position automaton was introduced by Glushkov and McNaughton in the early 1960. This automaton is homogeneous and has (||E || + 1) states for a word expression of alphabetic width ||E ||. This kind of automata is extended to regular tree expressions. In this paper, we give an efficient algorithm that computes the Follow sets, which are used in different algorithms of conversion of a re...

Journal: :Theor. Comput. Sci. 2012
Jean Berstel Luc Boasson Isabelle Fagnot

In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular) splicing systems within the Chomsky hierarchy. The two main results of the paper are the following. First, we show that it is decidable, given a circular splicing language and a regular language, whether they are equal. Second, we prove the language generated by an ...

2008
Harold W. Stevenson

nature and causes of reading disability. The question centers on the role that specific features of English orthography play in reading difficulties. Does the way words are represented in the English alphabet present unique problems for children as they learn to translate between written and spoken language? In his attempt to answer this question, Stevenson discusses similarities and difference...

Journal: :Vision Research 2009
Manuel Perea Joana Acha

Reading a text without spaces in an alphabetic language causes disruption at the levels of word identification and eye movement control. In the present experiment, we examined how word discriminability affects the pattern of eye movements when reading unspaced text in an alphabetic language. More specifically, we designed an experiment in which participants read three types of sentences: normal...

Journal: :Theor. Comput. Sci. 1997
Marek Karpinski Lawrence L. Larmore Wojciech Rytter

Several new observations which lead to new correctness proofs of two known algorithms (Hu-Tucker and Garsia-Wachs) for construction of optimal alphabetic trees are presented. A generalized version of the Garsia-Wachs algorithm is given. Proof of this generalized version works in a structured and illustrative way and clari es the usually poorly-understood behavior of both the Hu-Tucker and Garsi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید