This paper contributes to the debate on the analysis of linguistic tautologies—structures that state an unquestionable truth by virtue of their logical form and therefore require a reinterpretation to be informative. While there is a great number of studies of nominal tautologies of the form ‘Х is X’, clausal tautologies, i. e. conditionals ‘if P, P’, disjunctives ‘either P or not P’, free relatives ‘P, what P’, etc., are given less attention. This paper investigates one of such patterns, namely, correlative tautologies, where the subordinate clause precedes the main clause, that could be exemplified by the expression chto budet to (i) budet lit. ‘what will be that (EMPH) will be’. The data taken from the Russian National Corpus and Internet as well as dictionary definitions show that tautologies of this kind exhibit various peculiar properties. First, some correlative tautologies can receive opposite interpretations in different contexts, i. e. chto bylo, to bylo lit.’what has been that has been’ can mean both ‘this fact cannot be denied’ [Bylugina, Shmelev 1997] or ‘the past should be forgotten for the sake of the future’ [Active Dictionary of Russian]. Next, the particle i, which is commonly used in Russian correlatives, cf. [Mitrenina 2010], is acceptable for some tautologies but not licensed in others. I argue that for correlative tautologies the crucial ingredient is salience of the situation in question as presented by the speaker that, along with specific vs. generic readings available, results in four possible strategies of their interpretation.

Язык оригиналаанглийский
Страницы (с-по)775-790
Число страниц16
ЖурналКомпьютерная лингвистика и интеллектуальные технологии
Том2018-May
Номер выпуска17
СостояниеОпубликовано - 1 янв 2018
Событие2018 International Conference on Computational Linguistics and Intellectual Technologies, Dialogue 2018 - Moscow, Российская Федерация
Продолжительность: 30 мая 20182 июн 2018

    Предметные области Scopus

  • Языки и лингвистика
  • Языки и лингвистика
  • Прикладные компьютерные науки

ID: 36398068