Journal

Volume 7, Issue 1 (January 31, 2006)

3 articles

• A Type Composition Logic for Generative Lexicon
  by Nicholas Asher & James Pustejovsky
  J. CS. 2006, 7(1), 1-38;
  Abstract In this paper, we outline a model of semantics that integrates aspects of discourse-sensitive logics with the compositional mechanisms available from lexically-driven semantic interpretation. Specifically, we concentrate on developing a composition logic required to properly model complex types with... [Read more].
  Abstract In this paper, we outline a model of semantics that integrates aspects of discourse-sensitive logics with the compositional mechanisms available from lexically-driven semantic interpretation. Specifically, we concentrate on developing a composition logic required to properly model complex types within the Generative Lexicon (henceforth GL), for which we employ SDRT principles. As we are presently interested in the composition of information to construct logical forms, we will build on one standard way of arriving at such representations, the lambda calculus, in which functional types are exploited. We outline a new type calculus that captures one of the fundamental ideas of GL: providing a set of techniques governing type shifting possibilities for various lexical items so as to allow for the combination of lexical items in cases where there is an apparent type mismatch. These techniques themselves should follow from the structure of the lexicon and its underlying logic. [Collapse]
• Type Theory and Lexical Decomposition
  by James Pustejovsky
  J. CS. 2006, 7(1), 39-76;
  Abstract In this paper, I explore the relation between methods of lexical representation involving decomposition and the theory of types as used in linguistics and programming semantics. I identify two major approaches to lexical decomposition in grammar, what I call parametric and predicative strategies. I ... [Read more].
  Abstract In this paper, I explore the relation between methods of lexical representation involving decomposition and the theory of types as used in linguistics and programming semantics. I identify two major approaches to lexical decomposition in grammar, what I call parametric and predicative strategies. I demonstrate how expressions formed with one technique can be translated into expressions of the other. I then discuss argument selection within a type theoretic approach to semantics, and show how the predicative approach to decomposition can be modeled within a type theory with richer selectional mechanisms. In particular, I show how classic Generative Lexicon representations and operations can be viewed in terms of types and selection. [Collapse]
• Rule Expression in a Modified Serial Reaction Time Task
  by Yuh-shiow Lee
  J. CS. 2006, 7(1), 77-101;
  Abstract This study examined the nature of the knowledge that produced the results of a modified reaction time task described in Lee (1997). In this task, participants responded to visual stimuli appearing in one of six locations. In each run, six stimuli were presented in sequence, with a stimulus appearing... [Read more].
  Abstract This study examined the nature of the knowledge that produced the results of a modified reaction time task described in Lee (1997). In this task, participants responded to visual stimuli appearing in one of six locations. In each run, six stimuli were presented in sequence, with a stimulus appearing in each and every position exactly once in a random order. Thus, the inherent structure was not a repeating sequence, but rather the pattern that within a run of six trials, no stimulus would be repeated. Results from the experiment reported here, reanalyses of Lee (1997) and a simulation study suggest that when performing the task, participants registered the four immediate preceding trials and for each trial selected a stimulus different from all the registered stimuli. This result was discussed in terms of the effect of inhibition of return. [Collapse]