Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
We examine correlations between native speaker judgements on automatically generated German text against automatic evaluation metrics. We look at a number of metrics from the MT a...
In this paper we present RefGen, a reference chain identification module for French. RefGen algorithm uses genre specific properties of reference chains and an accessibility measur...
This paper presents the results of a qualitative research whose objective was to broaden the understanding on the participation of youngsters and adolescents on Internet-based soc...
Caroline Queiroz Santos, Ana Maria Pereira Cardoso