نتایج جستجو برای: word derivation
تعداد نتایج: 136775 فیلتر نتایج به سال:
let $mathcal m$ be a factor von neumann algebra. it is shown that every nonlinear $*$-lie higher derivation$d={phi_{n}}_{ninmathbb{n}}$ on $mathcal m$ is additive. in particular, if $mathcal m$ is infinite type $i$factor, a concrete characterization of $d$ is given.
This research reveals the important role of dialectal word-formation in realizing associative potential noun stems Ukrainian language. The importance dictionary materials for establishing synonymous models inherent figurative derivation is emphasized. approach helps to show as fully possible potentialities language formation word-forming synonyms. Figurative derivatives, evidenced by word-forma...
A context-free grammar G is ambiguous if there is a word that can be generated by G with at least two different derivation trees. Ambiguous grammars are often distinguished by their degree of ambiguity, which is the maximal number of derivation trees for the words generated by them. If there is no such upper bound G is said to be ambiguous of infinite degree. By considering how many derivation ...
Let $mathfrak{A}$ be a Banach algebra. We say that a sequence ${D_n}_{n=0}^infty$ of continuous operators form $mathfrak{A}$ into $mathfrak{A}$ is a textit{local higher derivation} if to each $ainmathfrak{A}$ there corresponds a continuous higher derivation ${d_{a,n}}_{n=0}^infty$ such that $D_n(a)=d_{a,n}(a)$ for each non-negative integer $n$. We show that if $mathfrak{A}$ is a $C^*$-algebra t...
The Lie derivation of multivector fields along multivector fields has been introduced by Schouten (see cite{Sc, S}), and studdied for example in cite{M} and cite{I}. In the present paper we define the Lie derivation of differential forms along multivector fields, and we extend this concept to covariant derivation on tangent bundles and vector bundles, and find natural relations between them and...
A context-free grammar G is ambiguous if and only if there is a word that can be generated byG with at least two different derivation trees. Ambiguous grammars are often distinguished by their degree of ambiguity, which is the maximal number of derivation trees for the words generated by them. If there is no such upper bound G is said to be ambiguous of infinite degree. Here as a new tool for e...
The word is the smallest part in language that can be spoken or written which embodiment of thoughts used language. There are several processes formation words and divided into types their formation). research aims to analyze word-formation on social media. This a qualitative method expanded by observing events phenomena happening around us. also collects data incident happens across media gene...
Andrew Spencer, University of Essex, UK Paradigm-based (realizational-inferential) models of morphology are defined over a notion of ‘lexeme’. Inflectional morphology defines the set of word forms which realize various morphosyntactic properties sets (MSPSs) for a given lexeme (e.g. from PRINT, {print, prints, printing, printed}. By contrast, a derivational process, say, Subject Nominalization ...
Automatic phonetic transcription tools usually perform phonetic transcriptions directly from orthographic representations. Although these approaches often achieve good results, theoretical studies suggest that including morphophonological knowledge allows those systems to improve their performance. Following this idea, we developed a tool which first obtains an underlying representation of each...
The semantic behavior of derivational processes has been investigated with compositional distributional models relating the meaning of base, affix, and derivative (e.g., anti+capitalist→ anticapitalist). While broadly successful, these approaches model how the distributional behavior generally is affected by derivation. Meanwhile, their predictions can not be interpreted at the level of linguis...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید