Both the top-down and bottom-up processing are identified in language comprehension: the top-down processing depends on previous language experience and the bottom-up processing depends on instant language inputs. In speech perception, both types of processing are needed while perceiving pitch variations as lexical tones. In this paper, based on three ERP experiments, we propose a temporal mode...

Dehaene, Changeux, Naccache, Sackur, and Sergent (2006) and Koch and Tsuchiya (2007) recently proposed taxonomies that distinguish between four processing states, based on bottom-up stimulus strength and top-down attentional amplification. The aim of the present study was to empirically test these processing states using the priming paradigm. Our results showed that attention (prime attended or...

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...

Multiple stimuli present in the visual field at the same time compete for neural representation by mutually suppressing their evoked activity throughout visual cortex, providing a neural correlate for the limited processing capacity of the visual system. Competitive interactions among stimuli can be counteracted by top-down, goal-directed mechanisms such as attention, and by bottom-up, stimulus...

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...

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...