We argue that traditional sequencing technology developed in the field of intelligent tutoring systems could find an immediate place in largescale web-based education. This paper discusses two models that have been explored by the authors – the dynamic course generation system DCG and the concept-based course maintenance system CoCoA. DCG includes components for domain authoring and for automat...

Existing captcha solutions on the Internet are a major source of user frustration. Game captchas are an interesting and, to date, little-studied approach claiming to make captcha solving a fun activity for the users. One broad form of such captchas – called Dynamic Cognitive Game (DCG) captchas – challenge the user to perform a game-like cognitive task interacting with a series of dynamic image...

Linear NDCG is used for measuring the performance of the Web content quality assessment in ECML/PKDD Discovery Challenge 2010. In this paper, we will prove that the DCG error equals a new pair-wise loss.

We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a function of the state complexity n of the languages. We prove that (n − 1)! is a tight upper bound for finite/cofinite languages and that it can be reached on...

this study investigated the relative effects of deductive and inductive form-focused instruction (ffi) on the acquisition of 4 non-generic definite article uses(cultural, situational, structural, and textual) as assessed by explicit and implicit outcome measures. the tests utilized to assess efl learners' acquisition of definite article uses were timed and untimed grammaticality judgment tests....

This paper introduces Stochastic Definite Clause Grammars, a stochastic variant of the wellknown Definite Clause Grammars. The grammar formalism supports parameter learning from annotated or unannotated corpora and provides a mechanism for parse selection by means of statistical inference. Unlike probabilistic contextfree grammars, it is a context-sensitive grammar formalism and it has the abil...

Kernel methods are widely used in statistical learning techniques. We recently introduced a general kernel framework based on weighted transducers or rational relations, rational kernels, to extend kernel methods to the analysis of variable-length sequences or more generally weighted automata. These kernels are efficient to compute and have been successfully used in applications such as spoken-...

Many information retrieval (IR) metrics are top-heavy, and some even have parameters for adjusting their discount curve. By choosing the right metric and parameters, the experimenter can arrive at a discount curve that is appropriate for their setting. However, in many cases changing the discount curve may not change the outcome of an experiment. This poster considers query-level directional ag...