Italian tag questions and their conversational functions
نویسندگان
چکیده
منابع مشابه
Tag Questions in Persian: Investigating the Conversational Functions
This article intends to identify the use and typify the functions of tag questions (TQs) in Persian everyday conversations and dialogic interaction. The analyses were made based on two data sources: A documentary film titled Commander in which the participants are engaged in free interactions, and an audio-recorded instrument named CALLFRIEND which consists of Iranian native...
متن کاملTag Disambiguation in Italian
In this paper we argue in favour of syntactically based tagging by presenting data from a study of a 1,000,000 word corpus of Italian. Most papers present approaches on tagging which are statistically based. None of the statistically based analyses, however, produce an accuracy level comparable to the one obtained by means of linguistic rules [1]. Of course their data are strictly referred to E...
متن کاملProsody and the Interpretation of Tag Questions ∗
We provide an account of the alignment of linguistic form and discourse function with respect to English tag questions, adopting as a formal framework Segmented Discourse Representation Theory. SDRT models the discourse function of utterances via their rhetorical connection to the antecedent discourse. We pay particular attention to the prosodic features of tag questions and their contribution ...
متن کاملEthnomethodology and Conversational Analysis
In a speech community, people utilize their communicative competence which they have acquired from their society as part of their distinctive sociolinguistic identity. They negotiate and share meanings, because they have commonsense knowledge about the world, and have universal practical reasoning. Their commonsense knowledge is embodied in their language. Thus, not only does social life depend...
متن کاملTag systems and Collatz-like functions
Tag systems were invented by Emil Leon Post and proven recursively unsolvable by Marvin Minsky. These production systems have shown very useful in constructing small universal (Turing complete) systems for several different classes of computational systems, including Turing machines, and are thus important instruments for studying limits or boundaries of solvability and unsolvability. Although ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pragmatics
سال: 2015
ISSN: 0378-2166
DOI: 10.1016/j.pragma.2015.05.001