Taxonomy is indispensable in understanding natural language. A variety of large scale, usage-based, data-driven lexical taxonomies have been constructed in recent years. Hypernym-hyponym relationship, which is considered as the backbone of lexical taxonomies can not only be used to categorize the data but also enables generalization. In particular, we focus on one of the most prominent properti...

L1 transfer is generally regarded as an important characteristic of L2 acquisition, also one of the sources of learners’ errors. One of the primary transfer between English and Chinese lies in the verb usage since verbs that are transitive in Chinese may be intransitive in English, or vice versa. In the previous studies, the investigation on the syntactic transfer in verb transitivity is only o...

A 1-factorization F1 of the complement Σ7 of the perfect Hamming code in the 7cube graphQ7 is given explicitly. For i = 2, 3, the component 1-factors ofF1 can be reunited to form i-factorizations Fi of Σ7 for which the component i-factors are pairwise isomorphic. The smallest connected factors that can be obtained as edge-subset unions from factors of these two factorizations show differing tra...

We prove several results on the behavior of Kim-independence upon changing base in NSOP1 theories. As a consequence, we that satisfies transitivity and this characterizes NSOP1. Moreover, characterize witnesses to Kim-dividing as exactly -Morley sequences. give applications, answering number open questions concerning transitivity, Morley sequences, local character

This paper provides a brief introduction to the use and usefulness of Suzumura consistency, a coherence requirement for binary relations that weakens transitivity. The property is introduced by Suzumura (1976b) in the context of collective choice but, as demonstrated in some recent contributions, its applicability reaches beyond the boundaries of social-choice theory. In addition to a summary o...

A transitivity part of a relation on a set X is any subset of X on which the restriction of the relation is transitive. What can be recovered of a relation from the sole knowledge of its transitivity parts? In general, the relation itself cannot be recovered, because it has the same transitivity parts as its converse. In certain situations, the unordered pair formed by the relation and its conv...