نتایج جستجو برای: formal words

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

2009
Christophe Roche Marie Calberg-Challot Luc Damas Philippe Rouard

Today, collaboration and the exchange of information are increasing steadily and players need to agree on the meaning of words. The first task is therefore to define the domain’s terminology. However, terminology building remains a demanding and time-consuming task, even in specialised domains where standards already exist. While reaching a consensus on the definition of terms written in natura...

2017
Mirjam Ernestus Iris Hanique Erik Verboom

This article presents two studies investigating how the situation in which speech is uttered affects the frequency with which words are reduced. Study 1 is based on the Spoken Dutch Corpus, which consists of 15 components, nearly all representing a different speech situation. This study shows that the components differ in how often ten semantically weak words are highly reduced. The differences...

Journal: :Journal of experimental child psychology 2016
Melissa E Libertus Darko Odic Lisa Feigenson Justin Halberda

Children can represent number in at least two ways: by using their non-verbal, intuitive approximate number system (ANS) and by using words and symbols to count and represent numbers exactly. Furthermore, by the time they are 5years old, children can map between the ANS and number words, as evidenced by their ability to verbally estimate numbers of items without counting. How does the quality o...

Journal: :J. Phonetics 2015
Mirjam Ernestus Iris Hanique Erik Verboom

This article presents two studies investigating how the situation in which speech is uttered affects the frequency with which words are reduced. Study 1 is based on the Spoken Dutch Corpus, which consists of 15 components, nearly all representing a different speech situation. This study shows that the components differ in how often ten semantically weak words are highly reduced. The differences...

Journal: :Série-Estudos - Periódico do Programa de Pós-Graduação em Educação da UCDB 2016

1997
Sarah Rees

A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This article surveys results for combable groups, in particular in the case where the combing is a formal language. AMS Classi cation 20F10, 20-04, 68Q40; 03D40

2015
Jittinart Rattanamoong Vichian Laohakosol Tuangrat Chaichana

The classical folding lemma is extended, in the field of formal series, to two-tier and three-tier folding lemmas covering all possible shapes of the words enclosing one and two middle terms. The two-fold and three-fold continued fraction identities so obtained are applied to derive a number of explicit continued fractions of certain series expansions, including those related to exponential ele...

2011
Ulrich Faigle Alexander Schönhuth

Introduction Let X be a set and X * := [ t≥0 X t are words over X , a semigroup with the concatenation operation (v , w) → vw, neutral element. Definition Let K be a field. A power series f ∈ K X * is a formal sum f = X w ∈X * fw w (fw ∈ K).

Journal: :Theor. Comput. Sci. 2012
Roman Kolpakov

Combinatorial properties of maximal repetitions (runs) in formal words are studied. We classify all maximal repetitions in a word as primary and secondary where the set of all primary repetitions determines all the other repetitons in the word. Essential combinatorial properties of primary repetitions are established.

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

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