This paper aims to introduce the process used to create a “Parallel Learners’ Corpus of Spanish and English” (CPATEI) by integrating the theories and techniques of Corpus Linguistics, and to investigate the conjunctions used by the Spanish learners in Taiwan. The collected data in CPATEI are contributed by learners of Spanish from two universities in Taiwan, including Spanish compositions and t...

I shall argue in this paper that it should.1 To begin with, I shall defend (CP) against several criticisms that have been launched against it. These criticisms are of two kinds, which I shall call internal and external respectively. Internal objections are that a theory that includes (CP) fails to give an account of what it is rational to believe that is satisfactory by its own standards. In pa...

We contribute to the theory of implications and conjunctions related by adjointness, in multiple-valued logics. We suggest their use in Zadeh s compositional rule of inference, to interpret generalized modus ponens inference schemata. We provide new complete characterizations of implications that distinguish left arguments, implications that satisfy the exchange principle, divisible conjunction...

The operation of negation on combinations of natural categories was examined in two experiments. In the first, category membership ratings of lists of items were obtained for pairs of concepts considered individually and in two logical combinations: conjunctions (e.g., "Tools which are also Weapons") and negated conjunctions--forms of those conjunctions in which the modifier noun category was n...

There exist eight conjunctions in Georgian used to express semantic or pragmatic contrast, which constitute an implicational hierarchy: aramed > oγond > tumca > magram > k'i//k'idev > xolo > tu > da. The given string is organized in such a way that the skill of conjunctions to express contrasting bindings is decreasing from the left to the right. On the basis of functional-semantic analysis of ...

We propose a probabilistic model for formulas, in which a formula’s probability decreases with the number of pre-defined constraints it contradicts. Probability of ground conjunctions can be computed by a series of subsumption checks. The probability is equivalent (up to a multiplicative constant) to that computed by a Markov Logic Network for conjunctions that fully describe a possible world. ...