نتایج جستجو برای: valency
تعداد نتایج: 1518 فیلتر نتایج به سال:
Any attempt to characterize valency patterns within and across languages confronts the phenomenon of verb or valency classes: sets of semantically-related verbs sharing a range of linguistic properties, such as the possible realizations of their arguments and the particular interpretation associated with each possible argument realization. The Leipzig Valency Classes Project provides an excelle...
This paper looks at the use in machine Translation systems of the linguistic models of Case and Valency. It is argued that neither of these models was originally developed with this use in mind, and both must be adapted somewhat to meet this purpose. In particular, the traditional Valency distinction of complements and adjuncts leads to conflicts when valency frames in different languages are c...
1 THE FRAMEWORK The Functional Generative Description (FGD, see Sgall, 1967, Sgall et al., 1986) was applied as a general framework for the development of the valency theory (see Panevová, 1974-75, 1980, 1994) as well as for the design of the Czech syntactically annotated corpus (PDT, see Hajič, 1998, Hajičová et al., 2001). Valency is understood as a lexico-syntactic attribute of a word – more...
Cerium and its technologically relevant compounds are examples of anomalous mixed valency, originating from two competing oxidation states—itinerant Ce4+ and localized Ce3+. Under applied stress, anomalous transitions are observed but not well understood. Here we treat mixed valency as an “alloy” problem involving two valences with competing and numerous site-occupancy configurations. We use de...
We construct continuum many non-isomorphic countable digraphs which are highly arc-transitive, have finite out-valency and infinite in-valency, and whose automorphism groups are primitive. 2000 Mathematics Subject Classification: 20B07, 20B15, 03C50, 05C20.
It is shown that there are infinitely many connected vertex-transitive graphs that have no Hamilton decomposition, including infinitely many Cayley graphs of valency 6, and including Cayley graphs of arbitrarily large valency.
There are only finitely many distance-regular graphs of fixed valency greater than two Abstract In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.
This paper introduces valency as an adaptive mechanism. It has been previously hypothesised that valency assesses the agent’s behavioural patterns and guides adaptation. However, we argue that it acts furthermore as a mechanism guiding the interaction between learning and evolution. Unlike previous studies, we hypothesise that behaviour related information must be underspecified in the genes an...
It is known that bipartite distance-regular graphs with diameter D > 3, valency k > 3, intersection number c2 > 2 and eigenvalues k = θ0 > θ1 > · · · > θD satisfy θ1 6 k− 2 and thus θD−1 > 2− k. In this paper we classify non-complete distanceregular graphs with valency k > 2, intersection number c2 > 2 and an eigenvalue θ satisfying −k < θ 6 2 − k. Moreover, we give a lower bound for valency k ...
Under the term grammaticalized alternations, we understand changes in valency frames of verbs corresponding to different surface syntactic structures of the same lexical unit of a verb. Czech grammaticalized alternations are expressed either (i) by morphological means (diatheses), or (ii) by syntactic means (reciprocity). These changes are limited to changes in morphemic form(s) of valency comp...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید