Deducing what a paper is about, titles are considered as the most important determinant of how many people will read the article. Therefore, studying the use of different syntactic structures and their rhetorical functions in titles is of great significance. The current study was set to investigate these structures used in research article titles in three disciplines of Applied Linguistics, Den...

Unlike Germanic, Italian and many other languages from different language families allow whclauses to occur as the complement of existential predicates and be interpreted as indefinites. I call these whclauses indefinite free relatives. A compositional semantics will be given for indefinite free relatives that is based on Jacobson’s (1995) proposal for the semantics of whwords. In a nutshell, I...

The present article aims to provide a synchronic study of the inflectional or morpho-syntactic categories of noun in Sistani dialect. These categories comprise person, number, gender or noun class, definiteness, case, and possession. Linguistic data was collected via recording free speech, and interviewing with 30 (15 females, 15 males) illiterate Sistani language consultants of age 40–102 year...

1 The Problem Argument structure has two faces, semantic and syntactic. On the semantic side, argument structure represents the core participants in events (states, processes) designated by a single predicator. From this point of view it appears as a type of representation of event structure. On the syntactic side, argument structure represents the minimal information needed to characterize the...

This paper investigates a special type of recurrent expressions, lexical bundles, defined as a sequence of three or more words that co-occur frequently in a particular register (Biber et al., 1999). Considering the importance of this group of multi-word sequences in academic prose, this study explores the forms and syntactic structures of three- and four-word bundles in English abstracts writte...

The notion of P-homomorphic signatures, introduced by Ahn et al. (TCC 2012), generalizes various approaches for public computations on authenticated data. For a given predicate P anyone can derive a signature for a message m′ from the signatures of a set of messages M , as long as P(M,m′) = 1. This definition hence comprises notions and constructions for concrete predicates P such as homomorphi...