Lexical typology through similarity semantics: Toward a semantic map of motion verbs

This paper discusses a multidimensional probabilistic semantic map of lexical motion verb stems based on data collected from parallel texts (viz. translations of the Gospel according to Mark) for 100 languages from all continents. The crosslinguistic diversity of lexical semantics in motion verbs is illustrated in detail for the domain of `go', `come', and `arrive' type contexts. It is argued that the theoretical bases underlying probabilistic semantic maps from exemplar data are the isomorphism hypothesis (given any two meanings and their corresponding forms in any particular language, more similar meanings are more likely to be expressed by the same form in any language), similarity semantics (similarity is more basic than identity), and exemplar semantics (exemplar meaning is more fundamental than abstract concepts)

Processing of regular and irregular past tense morphology in highly proficient second language learners of English: a self-paced reading study

Dual-system models suggest that English past tense morphology involves two processing routes: rule application for regular verbs and memory retrieval for irregular verbs (Pinker, 1999). In second language (L2) processing research, Ullman (2001a) suggested that both verb types are retrieved from memory, but more recently Clahsen and Felser (2006) and Ullman (2004) argued that past tense rule application can be automatised with experience by L2 learners. To address this controversy, we tested highly proficient Greek-English learners with naturalistic or classroom L2 exposure compared to native English speakers in a self-paced reading task involving past tense forms embedded in plausible sentences. Our results suggest that, irrespective to the type of exposure, proficient L2 learners of extended L2 exposure apply rule-based processing

Towards a Theory of Regular MSC Languages

Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the earlydesign stages in domains such as telecommunication software. It isfruitful to have mechanisms for specifying and reasoning about collections of MSCs so that errors can be detected even at the requirements level. We propose, accordingly, a notion of regularity for collections of MSCs and explore its basic properties. In particular, weprovide an automata-theoretic characterization of regular MSC languages in terms of finite-state distributed automata called boundedmessage-passing automata. These automata consist of a set of sequential processes that communicate with each other by sending andreceiving messages over bounded FIFO channels. We also provide alogical characterization in terms of a natural monadic second-orderlogic interpreted over MSCs.A commonly used technique to generate a collection of MSCs isto use a Message Sequence Graph (MSG). We show that the class oflanguages arising from the so-called locally synchronized MSGs constitute a proper subclass of the languages which are regular in our sense.In fact, we characterize the locally synchronized MSG languages asthe subclass of regular MSC languages that are finitely generated

Computer simulations, mathematics and economics

Economists lise different kinds of computer simulation. However, there is little attention on the theory of simulation, which is considered either a technology or an extension of mathematical theory or, else, a way of modelling that is alternative to verbal description and mathematical models. The paper suggests a systematisation of the relationship between simulations, mathematics and economics. In particular, it traces the evolution of simulation techniques, comments some of the contributions that deal with their nature, and, finally, illustrates with some examples their influence on economie theory. Keywords: Computer simulation, economie methodology, multi-agent programming techniques.

Language and socio-cultural change in Ejagham

No Abstract

Syntactic discontinuous reduplication with antonymic pairs: A case study from Italian

open2noThis article aims at giving a comprehensive account of a so far undescribed reduplicative pattern in Italian named syntactic discontinuous reduplication with antonymic pairs (SDRA). This pattern, characterized by the non-contiguous repetition of the same element within a larger fixed configuration defined by two spatial antonyms, can be schematized as , where Adv1 and Adv2 are antonyms (e.g., di qua 'here' ∼di là 'there'). After describing its formal and functional properties, based on naturally occurring data extracted from the Italian Web 2016 corpus, the SDRA is analyzed as an independent 'construction' in the Construction Grammar sense. This construction is claimed to convey a general value of 'plurality' and to have developed a polysemy network of daughter constructions expressing more specific functions such as 'distributivity,' 'related variety,' and 'dispersion.' In addition, we propose considering the SDRA a 'multiple source construction,' originating from the blending of two independent constructions: syntactic reduplication and irreversible binomials with antonymic adverbs. Finally, we discuss SDRA-like patterns in other typologically different languages (Russian, Modern Hebrew, Mandarin Chinese, German), pointing out similarities and differences, and paving the way to a more systematic study of discontinuous reduplication in a crosslinguistic perspective.openMasini F.; Mattiola S.Masini F.; Mattiola S

Linguistic diversity and complexity

Peer reviewe