In this paper a self-learning classification method, able to deal with both qualitative and quantitative data, will be presented. This technique presents important advantages with respect to classical approaches, both numerical and symbolical ones : it is faster, less memory demanding, performs a sequential treatment and can carry out both supervised (non-iterative) and unsupervised learning . ...

Discourse connectives can be analyzed as discourse level predicates which project predicate-argument structure on a par with verbs at the sentence level. The Penn Discourse Treebank (PDTB) reflects this view in its design providing annotation of the discourse connectives and their arguments. Like verbs, discourse connectives have multiple senses. We present a set of manual sense annotation stud...

Combined connectives arise in combined logics. In fibrings, such combined connectives are known as shared connectives and inherit the logical properties of each component. A new way of combining connectives (and other language constructors of propositional nature) is proposed by inheriting only the common logical properties of the components. A sound and complete calculus is provided for reason...

Discourse connectives (e.g. however, because) are terms that can explicitly convey a discourse relation within a text. While discourse connectives have been shown to be an effective clue to automatically identify discourse relations, they are not always used to convey such relations, thus they should first be disambiguated between discourse-usage and non-discourse-usage. In this paper, we inves...

This thesis considers the automatic acquisition of knowledge about discourse connectives. It focuses in particular on their semantic properties, and on the relationships that hold between them. There is a considerable body of theoretical and empirical work on discourse connectives. For example, Knott (1996) motivates a taxonomy of discourse connectives based on relationships between them, such ...

In this paper we examine the issues that arise from the annotation of the discourse connectives for the Chinese Discourse Treebank Project. This project is based on the same principles as the PDTB, a project that annotates the English discourse connectives in the Penn Treebank. The paper begins by outlining range of discourse connectives under consideration in this project and examines the dist...

We present a novel way of using proof nets for the multimodal Lambek calculus, which provides a general treatment of both the unary and binary connectives. We also introduce a correctness criterion which is valid for a large class of structural rules and prove basic soundness, completeness and cut elimination results. Finally, we will present a correctness criterion for the original Lambek calc...

Let L be a propositional language, and let F1, . . . , Fn be all propositional connectives it involves. We shall denote the set of all formulas of L as L, and identify L with the algebra of formulas (L,F1, . . . , Fn) freely generated by the propositional letters p1, . . . , pi, . . .. Assume that T is a non-empty set of indices (points of reference, possible worlds) and assume that a certain s...

Translation of discourse connectives varies more in human translations than in machine translations. Building on Murray’s (1997) continuity hypothesis and Sanders’ (2005) causality-by-default hypothesis we investigate whether expectedness influences the degree of implicitation and explicitation of discourse relations. We manually analyze how source text connectives are translated, and where con...

Abstract While there is a substantial amount of evidence for language processing being highly incremental and predictive process, we still know relatively little about how top-down discourse based expectations are combined with bottom-up information such as connectives. The present article reports on three experiments investigating this question using different methodologies (visual world parad...