نتایج جستجو برای: literal transparency
تعداد نتایج: 29014 فیلتر نتایج به سال:
Idiomatic utterances contribute by virtue of their aspectual class to the temporal structure of discourse – hence it is essential that theories of aspect derivation and discourse structure should encompass them. A recent claim has been made (McGinnis 2002) that the aspectual class of idiomatic expressions can be derived compositionally, by the same process as in literal language. We examine thi...
organizational transparency has been considered by many experts in the past two decades. in the previous studies more attention has been taken to disclosure of the information; and the relations between the concepts of organizational transparency, organizational culture and performance has not been considered in this article as set forth. therefore, current research has been studied the effect ...
One of the most crucial texts for the futurist interpretation of prophecy concerning Israel is the vision of the prophet Ezekiel in chapters 40-48. In this text the prophet presents God’s instructions for the construction of a new Temple to be built as part of the promise of Israel’s divine restoration. The concern of the exiles, as exemplified by Daniel’s prayer, was for a literal rebuilding o...
Why do people so often use metaphorical expressions when literal paraphrases are readily available? This study focuses on a comparison of metaphorical statements involving the source domain of taste (e.g., "She looked at him sweetly") and their literal paraphrases (e.g., "She looked at him kindly"). Metaphorical and literal sentences differed only in one word and were normed for length, familia...
Since the previous studies on idiom translation mainly focus on the linguistic level, this paper mainly discusses the translation of idioms from a cognitive perspective, that is relevance theory. Three translation strategies are discussed under the framework of relevance theory: literal translation, literal translation with compensation and free translation.
We consider the threshold for the solvability of random k-SAT formulas (for k ≥ 3) using the pure literal rule. We demonstrate how this threshold can be found by using differential equations to determine the appropriate limiting behavior of the pure literal rule.
There exist various approaches in SAT solvers that aim at extending inference based on unit propagation. For instance, probing [5] simply applies unit propagation of literals at the root node in order to detect failed literals [3] or to populate literal implication lists. The latter information can then, for instance, be used to shrink clauses by hidden literal elimination (e.g., if a → b then ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید