نتایج جستجو برای: grammatical complexity

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

Journal: :the journal of applied linguistics and discourse analysis 2013
biook behnam bahram kazemian

language, science and politics go together and learning these genres is to learn a language created for codifying, extending and transmitting scientific and political knowledge. grammatical metaphor is divided into two broad areas: ideational and interpersonal.this paper focuses on the first type i.e. ideational grammatical metaphor (igm), which includes process types and nominalization.  the m...

Journal: :journal of english language teaching and learning 2013
mohammad ahmadi safa mohammad hadi mahmoodi

second language  learners often develop grammatical competence in the absence of concomitant pragmatic competence (kasper & roever, 2005) and the exact nature of the relationship between the two competences is still indistinct and in need of inquiries ( bardovi-harlig, 1999; khatib & ahmadisafa, 2011). this study is a partial attempt to address the lacuna and aims to see if any relation...

Journal: :British journal of psychology 2014
Benedetta A L Bassetti

It is generally assumed that speakers of grammatical gender languages consider grammatical gender arbitrary, but this assumption has never been tested. Research shows that the grammatical gender of nouns can affect perceptions of the masculinity or femininity of the noun's referent in speakers of languages with masculine and feminine noun classes. However, bilingualism facilitates the developme...

1998
Stephan Oepen Daniel P. Flickinger

An experiment with recent test suite and grammar (engineering) resources is outlined: a critical assessment of the EU-funded tsnlp (Test Suites for Natural Language Processing) package as a diagnostic and benchmarking facility for a distributed (multi-site) large-scale hpsg grammar engineering eeort. This paper argues for a generalized , systematic, and fully automated testing and diagnosis fac...

Journal: :International journal of medical informatics 2010
Gondy Leroy Stephen Helmreich James R. Cowie

PURPOSE Willingness and ability to learn from health information in text are crucial for people to be informed and make better medical decisions. These two user characteristics are influenced by the perceived and actual difficulty of text. Our goal is to find text features that are indicative of perceived and actual difficulty so that barriers to reading can be lowered and understanding of info...

Journal: :Frontiers in Communication 2021

Focusing on the work of John McWhorter and, to a lesser extent, Peter Trudgill, this paper critically examines some common themes in language complexity research from perspective intellectual history. The present-day conception that increase is somehow “natural” process which disturbed under “abnormal” circumstances contact shown be recapitulation essentially Romantic ideas go back beginnings d...

2005
Ryan K. Shosted

Proceeding from the assumption that all languages are equally complex, there exists a corollary, widely held but poorly documented, herein referred to as the negative correlation hypothesis. It states: if one component of language is simplified then another must be elaborated. Here, this assumption is reformulated in terms of a scientific hypothesis and subjected to statistical analysis. Thirty...

Journal: :Linguistics 2022

Abstract This article considers NP complexity and discontinuity in the Papuan language Coastal Marind. First, I give an overview of structure language, which is characterized by extremely limited possibility elaboration modification. connect this to observation that languages are exceptionally simple structures. The lack research makes it difficult evaluate significance such observations, but s...

2011
GF Johan H̊astad

We study the problem where we are given a system of polynomial equations defined by multivariate polynomials over GF [2] of fixed constant degree d > 1 and the aim is to satisfy the maximal number of equations. A random assignment approximates this problem within a factor 2−d and we prove that for any > 0, it is NP-hard to obtain a ratio 2−d+ . When considering instances that are perfectly sati...

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

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