Abstract As is well-known, code-mixing particularly frequent at clause boundaries and with elements expressing pragmatic meaning. However, most of the literature has focussed on switching simple such as conjunctions discourse markers. This paper, in contrast, analyses peripheral involving two complex constructions: left dislocations pseudo-clefts. The data are from English-Spanish bilingual con...

Sentential and diagrammatic representations are two different formalisms for describing domains and problems. Sentential descriptions are usually more expressive than diagrammatic ones, but tend to present a more complex and less intuitive notation. All modern planning domain description languages are sentential. The complexity of sentential formalisms has been of hindrance to the wider dissemi...

We present several ways of measuring the inter-annotator agreement in the ongoing annotation of semantic inter-sentential discourse relations in the Prague Dependency Treebank (PDT). Two ways have been employed to overcome limitations of measuring the agreement on the exact location of the start/end points of the relations. Both methods – skipping one tree level in the start/end nodes, and the ...

We present a new method for translating unrestricted natural language texts into predicate logic formulas. This relies on the semantic evaluation procedure of Scope Control Theory (SCT), a variant of Dynamic Semantic formalisms. The key benefit is that parsed syntactic structures are shown to form sufficient input for semantic evaluation, eliminating the need to build distinct semantic expressi...

Abstract As an essential component of human cognition, cause–effect relations appear frequently in text, and curating from text helps building causal networks for predictive tasks. Existing causality extraction techniques include knowledge-based, statistical machine learning (ML)-based, deep learning-based approaches. Each method has its advantages weaknesses. For example, knowledge-based metho...

This paper investigates the notion of the maximality effect and its formal implementation. It will be shown that the maximal witness sets that an anaphor can access are sensitive to the plural readings of the anaphor’s antecedents. It will also be shown that the formal semantics of the maximality effect should not be implemented on the interpretation of either determiners or anaphors. Instead, ...

ÐAll-to-all communication is one of the most dense communication patterns and occurs in many important applications in parallel computing. In this paper, we present a new all-to-all broadcast algorithm in all-port meshes and tori. The algorithm utilizes a controlled message flooding based on a novel broadcast pattern, which ensures a balanced traffic load in all dimensions in the network so tha...