In most of the literature on English phonology, historically prefixed words such as contain, respect or submit are seen as having no morphological structure synchronically. However, such words were treated as complex in the early generative literature and are still analysed in that way in part of the literature. In this paper, we seek to review the evidence for the claim that such words are simplex words, which predicts that they should pattern with words with no internal structure in their phonological and morphological behaviours and in psycholinguistic experiments. We show that the evidence does not support that claim and shows that these words should be treated as morphologically complex units, although they differ from words with productive morphology. As these words tend to be partly or entirely opaque semantically, this raises the question of how such structures may be learned. We argue that the recurrence of forms is the main factor leading to their identification and lay out a possible order of acquisition of various morphological structures. Finally, we argue that theories of phonology may account for this by allowing the reference to morphological constituents whose semantics are impoverished.

This paper is concerned with the syntactic representation of inner aspect in Hungarian. We contribute to the extant research on inner aspectual markers by providing an analysis of entailed versus implied telicity as well as the (non)maximality effects with which telic predicates are associated. Although we focus on the grammar of Hungarian, we also draw parallels between typologically different languages like Finno-Ugric (e.g. Hungarian and Finnish) and Germanic (e.g. English) regarding their inner aspectual marking strategies, and the interaction of inner aspect and case assignment.

This article proposes a cognitive linguistic analysis of the prefix post- in contemporary English by looking into the possible motivations of the semantic changes which have led to the increasing applicability of the prefix. The prefix's productivity in combinations such as post-truth and post-fact calls for expanding its original definition. These recent combinations go beyond the main two established meanings of the prefix, namely the spatial and the temporal meaning. In order to explain this semantic extension a radial model of categorisation is proposed. Offering an analysis of contexts in which the prefix post- is used in British and American press coverage, especially in relation to the 2016 UK Brexit referendum and the 2016 US presidential campaign, the article claims that the appearance of the prefix in new combinations is motivated by the need to describe the changing reality (especially in political and media discourse).

The study explores the expression of the unexpected by English adjectives and participles prefixed in un- in The Picture of Dorian Gray. The study compares their oral realizations and translations in connection with the various modes of construction of otherness, which can either be a dual opposition between the expected and effective values, with participles and some adjectives, or a gradient between the two values with adjectives. In the case of dual opposition, ungradable adjectives tend to be translated using positive adjectives and there is clear acoustic prominence on the prefix, as in the case of special focus. “Constructed negation” in translation is illustrated by sans + (aucun) NOUN or the suffix -able, and corresponds to greater duration of the prefix. In other cases, the base is acoustically prominent, but translation techniques vary, although four techniques account for 80% of the entries, even if translator styles differ considerably.

Tabling in logic programming has been used to eliminate redundant computation and also to stop infinite loop. In this paper we investigate another possibility of tabling, i.e. to compute an infinite sum of probabilities for probabilistic logic programs. Using PRISM, a logic-based probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for probabilistic context-free grammars (PCFGs) to probabilistic logic programs. Given a top-goal, we search for all proofs with tabling and obtain an explanation graph which compresses them and may be cyclic. We then convert the explanation graph to a set of linear probability equations and solve them by matrix operation. The solution gives us the probability of the top-goal, which, in nature, is an infinite sum of probabilities. Our general approach to prefix probability computation through tabling not only allows to deal with non-probabilistic context-free grammars such as probabilistic left-corner grammars but has applications such as plan recognition and probabilistic model checking and makes it possible to compute probability for probabilistic models describing cyclic relations.