In this study, the researcher chose three different vocabulary techniques (Visual Representation, Textual Enhancement, and Glossing) and compared them with traditional method of teaching vocabulary. 80 advanced EFL Learners were assigned as four intact groups (three experimental and one control group) through using a proficiency test and a vocabulary test as a pre-test. In the visual group, stu...

We address in this report the problem of representing formally textual data. First, this problem is replaced in the context of automatic text processing. Then, the weaknesses of the basic document representation, i.e. the bag-of-words representation, are explained and some state-ofthe-art methods claiming to overcome these weaknesses are reviewed. Moreover we propose a novel graphical model, th...

Task: Discover and document text-based systems for the representation of illocutionary forces, predicate argument structures, and semantic relations and evaluations of such systems, with an emphasis on systems designed for use by lay users as well as domain experts, and designed for application to typologically diverse languages. 1 Disclaimer There may be systems that enable authors, writing in...

In this paper we define a measure for textual entailment recognition based on the graph matching theory applied to syntactic graphs. We describe the experiments carried out to estimate measure’s parameters with SVM and we report the results obtained on the Textual Entailment Challenge development and testing set.

In this work we investigate methods to enable the detection of a specific type of textual entailment (strict entailment), starting from the preliminary assumption that these relations are often clearly expressed in texts. Our method is a statistical approach based on what we call textual entailment patterns, prototypical sentences hiding entailment relations among two activities. We experimente...

In this paper we investigate the relation between positive and negative pairs in Textual Entailment (TE), in order to highlight the role of contradiction in TE datasets. We base our analysis on the decomposition of Text-Hypothesis pairs into monothematic pairs, i.e. pairs where only one linguistic phenomenon at a time is responsible for entailment judgment and we argue that such a deeper inspec...

Œis paper aŠempts a more formal approach to the legibility of text based programming languages, presenting, with proof, minimum possible ways of representing structure in text interleaved with information. Œis presumes that a minimalist approach is best for purposes of human readability, data storage and transmission, and machine evaluation. Several proposals are given for improving the express...