Several proof translations of classical mathematics into intuitionistic mathematics have been proposed in the literature over the past century. These are normally referred to as negative translations or double-negation translations. Among those, the most commonly cited are translations due to Kolmogorov, Gödel, Gentzen, Kuroda and Krivine (in chronological order). In this paper we propose a fra...

The present Critical Discourse Analysis (CDA) study aimed to explore the probable ideological manipu- lations exerted in three translations of an English political book entitled The Coup by Ervand Abraha- mian. This comparative qualitative study was conducted based on Farahzad‘s three-dimensional CDA model. The textual, paratextual, and ...

Given the significant improvements in Machine Translation (MT) quality and the increasing demand for translations, post-editing of automatic translations is becoming a popular practice in the translation industry. It has been shown to allow for larger volumes of translations to be produced, saving time and costs. In addition, the post-editing of automatic translations can help understand proble...

This paper presents a novel approach to machine translation evaluation by combining register features – characterised by particular distributions of lexico-grammatical features – with text classification techniques. The goal of this method is to compare machine translation output with comparable originals in the same language, as well as with human reference translations. The degree of similari...

The poems and translations of John Polwhele ( c.1606–1672) are preserved in a single autograph manuscript, Bodleian MS English poetry f. 16. Some have received intermittent scholarly attention recent times, often on account Polwhele's admiration for emulation Ben Jonson. As well as other classical translations, manuscript includes eleven passages from Horace, nearly all them versions odes epode...

This text aims at providing a bird’s eye view of possible-translations semantics ([10, 24]), defined, developed and illustrated as a very comprehensive formalism for obtaining or for representing semantics for all sorts of logics. With that tool, a wide class of complex logics will very naturally turn out to be (de)composable by way of some suitable combination of simpler logics. Several exampl...