In this paper, we endorse and advance an emerging bottomup approach to game studies that utilizes techniques from natural language processing. Our contribution is threefold: we present the first complete review of the growing body of work through which this methodology has been innovated; we present a latent semantic analysis model that constitutes the first application of this fundamental bott...

Online social platforms, e-commerce sites and technical fora support the unfolding of informal exchanges, e.g. debates or discussions, that may be topic-driven or serendipitous. We outline a methodology for analysing these exchanges in computational argumentation terms, thus allowing a formal assessment of the dialectical validity of the positions debated in or emerging from the exchanges. Our ...

We propose a bottom-up variant of Earley deduction. Bottom-up deduction is preferable to top-down deduction because it allows incrementai processing (even for head-driven grammars), it is data-driven, no subsumption check is needed, and preference values attached to lexical items can be used to guide best-first search. We discuss the scanning step for bottom-up Earley deduction and indexing sch...

The present study was conducted to explore the effects of teaching reading strategies on English as a Foreign Language (EFL) learners’ reading anxiety. To fulfill the purpose of this study, 55 intermediate EFL learners were selected among a total number of 90 through their performance on a sample piloted Preliminary English Test (PET), and then randomly assigned to two experimental and co...

These short notes provide descriptions and references relative to the construction of parsing tables for SLR(1), for LR(1), and for LALR(1) grammars. 1 Notation and basic definitions Basic definitions and notational conventions are summerized below. A context-free grammar is a tuple G = (V, T, S,P), where the elements of the tuple represent, respectively, the vocabulary of terminal and nontermi...