Ads
related to: adequacy and equivalence in translation examples math worksheets 1 5 free printable
Search results
Results From The WOW.Com Content Network
Formal equivalence is often more goal than reality, if only because one language may contain a word for a concept which has no direct equivalent in another language. In such cases, a more dynamic translation may be used or a neologism may be created in the target language to represent the concept (sometimes by borrowing a word from the source ...
The theory first appeared in an article published by linguist Hans Josef Vermeer in the German Journal Lebende Sprachen, 1978. [2]As a realisation of James Holmes’ map of Translation Studies (1972), [3] [4] skopos theory is the core of the four approaches of German functionalist translation theory [5] that emerged around the late twentieth century.
Equisatisfiability is generally used in the context of translating formulae, so that one can define a translation to be correct if the original and resulting formulae are equisatisfiable. Examples of translations that preserve equisatisfiability are Skolemization and some translations into conjunctive normal form such as the Tseytin transformation.
In formal language theory, weak equivalence of two grammars means they generate the same set of strings, i.e. that the formal language they generate is the same. In compiler theory the notion is distinguished from strong (or structural) equivalence, which additionally means that the two parse trees [clarification needed] are reasonably similar in that the same semantic interpretation can be ...
Adequality is a technique developed by Pierre de Fermat in his treatise Methodus ad disquirendam maximam et minimam [1] (a Latin treatise circulated in France c. 1636 ) to calculate maxima and minima of functions, tangents to curves, area, center of mass, least action, and other problems in calculus.
Example-based machine translation (EBMT) is a method of machine translation often characterized by its use of a bilingual corpus with parallel texts as its main knowledge base at run-time. It is essentially a translation by analogy and can be viewed as an implementation of a case-based reasoning approach to machine learning .