967 resultados para Meaning-Text Theory
Resumo:
Mode of access: Internet.
Resumo:
No notice of edition is given on v. 2 and 3.
Resumo:
Biography: p. iii.
Resumo:
Includes bibliographical references.
Resumo:
Includes indexes.
Outlines of psychology, with special reference to the theory of education. A text-book for colleges.
Resumo:
References at end of chapters.
Resumo:
Mode of access: Internet.
Resumo:
Added t.-p., illus.
Resumo:
Includes bibliographical references and indexes.
Resumo:
The book aims to introduce the reader to DEA in the most accessible manner possible. It is specifically aimed at those who have had no prior exposure to DEA and wish to learn its essentials, how it works, its key uses, and the mechanics of using it. The latter will include using DEA software. Students on degree or training courses will find the book especially helpful. The same is true of practitioners engaging in comparative efficiency assessments and performance management within their organisation. Examples are used throughout the book to help the reader consolidate the concepts covered. Table of content: List of Tables. List of Figures. Preface. Abbreviations. 1. Introduction to Performance Measurement. 2. Definitions of Efficiency and Related Measures. 3. Data Envelopment Analysis Under Constant Returns to Scale: Basic Principles. 4. Data Envelopment Analysis under Constant Returns to Scale: General Models. 5. Using Data Envelopment Analysis in Practice. 6. Data Envelopment Analysis under Variable Returns to Scale. 7. Assessing Policy Effectiveness and Productivity Change Using DEA. 8. Incorporating Value Judgements in DEA Assessments. 9. Extensions to Basic DEA Models. 10. A Limited User Guide for Warwick DEA Software. Author Index. Topic Index. References.
Resumo:
This work explores the relevance of semantic and linguistic description to translation, theory and practice. It is aimed towards a practical model of approach to texts to translate. As literary texts [poetry mainly] are the focus of attention, so are stylistic matters. Note, however, that 'style', and, to some extent, the conclusions of the work, are not limited to so-called literary texts. The study of semantic description reveals that most translation problems do not stem from the cognitive (langue-related), but rather from the contextual (parole-related) aspects of meaning. Thus, any linguistic model that fails to account for the latter is bound to fall short. T.G.G. does, whereas Systemics, concerned with both the 'Iangue' and 'parole' (stylistic and sociolinguistic mainly) aspects of meaning, provides a useful framework of approach to texts to translate. Two essential semantic principles for translation are: that meaning is the property of a language (Firth); and the 'relativity of meaning assignments' (Tymoczko). Both imply that meaning can only be assessed, correctly, in the relevant socio-cultural background. Translation is seen as a restricted creation, and the translator's encroach as a three-dimensional critical one. To encompass the most technical to the most literary text, and account for variations in emphasis in any text, translation theory must be based on typology of function Halliday's ideational, interpersonal and textual, or, Buhler's symbol, signal, symptom, Functions3. Function Coverall and specific] will dictate aims and method, and also provide the critic with criteria to assess translation Faithfulness. Translation can never be reduced to purely objective methods, however. Intuitive procedures intervene, in textual interpretation and analysis, in the choice of equivalents, and in the reception of a translation. Ultimately, translation, theory and practice, may perhaps constitute the touchstone as regards the validity of linguistic and semantic theories.
Resumo:
Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In this dissertation, our main object of study is minimal NFAs. In contrast with minimal DFAs, minimal NFAs are computationally challenging: first, there can be more than one minimal NFA recognizing a given language; second, the problem of converting an NFA to a minimal equivalent NFA is NP-hard, even for NFAs over a unary alphabet. Our study is based on the development of two main theories, inductive bases and partials, which in combination form the foundation for an incremental algorithm, ibas, to find minimal NFAs. An inductive basis is a collection of languages with the property that it can generate (through union) each of the left quotients of its elements. We prove a fundamental characterization theorem which says that a language can be recognized by an n-state NFA if and only if it can be generated by an n-element inductive basis. A partial is an incompletely-specified language. We say that an NFA recognizes a partial if its language extends the partial, meaning that the NFA’s behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language. We therefore direct our attention to minimal NFAs recognizing a given partial. Combining inductive bases and partials, we generalize our characterization theorem, showing that a partial can be recognized by an n-state NFA if and only if it can be generated by an n-element partial inductive basis. We apply our theory to develop and implement ibas, an incremental algorithm that finds minimal partial inductive bases generating a given partial. In the case of unary languages, ibas can often find minimal NFAs of up to 10 states in about an hour of computing time; with brute-force search this would require many trillions of years.
Resumo:
Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In this dissertation, our main object of study is minimal NFAs. In contrast with minimal DFAs, minimal NFAs are computationally challenging: first, there can be more than one minimal NFA recognizing a given language; second, the problem of converting an NFA to a minimal equivalent NFA is NP-hard, even for NFAs over a unary alphabet. Our study is based on the development of two main theories, inductive bases and partials, which in combination form the foundation for an incremental algorithm, ibas, to find minimal NFAs. An inductive basis is a collection of languages with the property that it can generate (through union) each of the left quotients of its elements. We prove a fundamental characterization theorem which says that a language can be recognized by an n-state NFA if and only if it can be generated by an n-element inductive basis. A partial is an incompletely-specified language. We say that an NFA recognizes a partial if its language extends the partial, meaning that the NFA's behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language. We therefore direct our attention to minimal NFAs recognizing a given partial. Combining inductive bases and partials, we generalize our characterization theorem, showing that a partial can be recognized by an n-state NFA if and only if it can be generated by an n-element partial inductive basis. We apply our theory to develop and implement ibas, an incremental algorithm that finds minimal partial inductive bases generating a given partial. In the case of unary languages, ibas can often find minimal NFAs of up to 10 states in about an hour of computing time; with brute-force search this would require many trillions of years.
Resumo:
Much has been written on the organizational power of metaphor in discourse, eg on metaphor ‘chains’ and ‘clusters’ of linguistic metaphor in discourse (Koller 2003, Cameron & Stelma 2004, Semino 2008) and the role of extended and systematic metaphor in organizing long stretches of language, even whole texts (Cameron et al 2009, Cameron & Maslen 2010, Deignan et al 2013, Semino et al 2013). However, at times, this work belies the intricacies of how a single metaphoric idea can impact on a text. The focus of this paper is a UK media article derived from a HM Treasury press release on alleviating poverty. The language of the article draws heavily on orientational (spatial) metaphors, particularly metaphors of movement around GOOD IS UP. Although GOOD IS UP can be considered a single metaphoric idea, the picture the reader builds up as they move line by line through this text is complex and multifaceted. I take the idea of “building up a picture” literally in order to investigate the schema of motion relating to GOOD IS UP. To do this, fifteen informants (Masters students at a London university), tutored in Cognitive Metaphor Theory, were asked to read the article and underline words and expressions they felt related to GOOD IS UP. The text was then read back to the informant with emphasis given to the words they had underlined, while they drew a pictorial representation of the article based on the meanings of these words, integrating their drawings into a single picture as they went along. I present examples of the drawings the informants produced. I propose that using Metaphor-led Discourse Analysis to produce visual material in this way offers useful insights into how metaphor contributes to meaning making at text level. It shows how a metaphoric idea, such as GOOD IS UP, provides the text producer with a rich and versatile meaning-making resource for constructing text; and gives a ‘mind-map’ of how certain aspects of a media text are decoded by the text receiver. It also offers a partial representation of the elusive, intermediate ‘deverbalized’ stage of translation (Lederer 1987), where the sense of the source text is held in the mind before it is transferred to the target language. References Cameron, L., R. Maslen, Z. Todd, J. Maule, P. Stratton & N. Stanley. 2009. ‘The discourse dynamic approach to metaphor and metaphor-led analysis’. Metaphor and Symbol, 24(2), 63-89. Cameron, L. & R. Maslen (eds). 2010. Metaphor Analysis: Research Practice in Applied Linguistics, Social Sciences and Humanities. London: Equinox. Cameron, L. & J. Stelma. 2004. ‘Metaphor Clusters in Discourse’. Journal of Applied Linguistics, 1(2), 107-136. Deignan, A., J. Littlemore & E. Semino. 2013. Figurative Language, Genre and Register. Cambridge: Cambridge University Press. Koller, V. 2003. ‘Metaphor Clusters, Metaphor Chains: Analyzing the Multifunctionality of Metaphor in Text’. metaphorik.de, 5, 115-134. Lederer, M. 1987. ‘La théorie interprétative de la traduction’ in Retour à La Traduction. Le Francais dans Le Monde. Semino, E. 2008. Metaphor in Discourse. Cambridge: Cambridge University Press. Semino, E., A. Deignan & J. Littlemore. 2013. ‘Metaphor, Genre, and Recontextualization’. Metaphor and Symbol. 28(1), 41-59.