نتایج جستجو برای: determiners

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

Journal: :LSA Annual Meeting Extended Abstracts 2011

1995
Gabriele Scheler

In this paper, we present a model of grammatical category formation, applied to English plural determiners. We have identiied a set of semantic features for the description of relevant meanings of plural deeniteness. A small training set (30 sentences) was created by linguistic criteria, and a functional mapping from the semantic feature representation to the overt category of indeenite/deenite...

2001
Akira Watanabe

This paper investigates the factors that determine the typological distribution of headinternal relative clauses (HIRC), especially in view of the fact that there are two types of them. Our focus of attention is on the nature of determiners. Studies by Bonneau (1992), Basilico (1996), and Grosu and Landman (1998) all point to the determiner system as playing a crucial role in HIRC. None of thes...

2017
Richard Zuber

A type 〈1, 1〉 quantifier F is symmetric iff F (X, X)(Y ) = F (Y, Y )(X). It is shown that quantifiers denoted by irreducible binary determiners in natural languages are both conservative and symmetric and not only

2009
R. Zuber

Slavic possessive determiner SVOJ (and its plural form), meaning roughly his/her own (glosed by HOWN) can in addition to its bare form also be used in composition with other ordinary determiners. Such compositions form complex anaphoric possessive determiners (ADets), that is expressions which take CNs as arguments and form NPs denoting nominal anaphors. Thus one can have in various Slavic lang...

Journal: :Studies in Second Language Acquisition 2021

Abstract The present study uses event-related potentials (ERPs) to examine nonlocal agreement processing between native (L1) English speakers and Chinese–English second language (L2) learners, whose L1 lacks number agreement. We manipulated marking with determiners ( the vs. that/these ) see how determiner-specification influences both nonnative downstream for verbal Behavioral ERP results sugg...

Journal: :CoRR 2012
Nerio Borges

We here present a sufficient condition for general arrowing problems to be non definable in first order logic, based in well known tools of finite model theory e.g. Hanf’s Theorem and known concepts in finite combinatorics, like senders and determiners.

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

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