The ACT-R theory (Anderson, 1993; Anderson & Lebiere, 1998) is applied to the list memory paradigms of serial recall, recognition memory, free recall, and implicit memory. List memory performance in ACT-R is determined by the level of activation of declarative chunks which encode that items occur in the list. This level of activation is in turn determined by amount of rehearsal, delay, and asso...

Functional elements (determiners, complementizers, modals, degree words) are in many ways the syntactic analogues of affixes in morphology. Typically, functional elements are bound elements. Phonologically, they are clitics: syntactically, they are unable to appear without an associated thematic element (noun, verb, adjective). I would like to extend the analogy by showing that functional eleme...

Time reversal is often used in experimental studies on language perception and understanding, but little is known on its precise impact on speech sounds. Strikingly, some studies consider reversed speech chunks as “speech” stimuli lacking lexical information while others use them as “non speech” control conditions. The phonetic perception of reversed speech has not been thoroughly studied so fa...

We formulate an original model for statistical machine translation (SMT) inspired by characteristics of the Arabic-English translation task. Our approach incorporates part-of-speech tags and linguistically motivated phrase chunks in a 2-level shallow syntactic model of reordering. We implement and evaluate this model, showing it to have advantageous properties and to be competitive with an exis...

This paper describes investigations into using syntactic chunk information as the basis for determining the similarity of candidate texts at the semantic level. Two approaches were considered. The first was a corpus-based method that extracted lexical and semantic features from pairs of chunks from each sentence that were associated through a chunk alignment algorithm. The features were used as...

Chunks are a programming construct in PLAN, the Packet Language for Active Networks, comprised of a code segment and a suspended function call. In PLAN, chunks provide support for encapsulation and other packet programming techniques. This paper begins by explaining the semantics and implementation of chunks. We proceed, using several PLAN source code examples, to demonstrate the usefulness of ...

We describe a statistical signature of chunks and an algorithm for finding chunks. While there is no formal definition of chunks, they may be reliably identified as configurations with low internal entropy or unpredictability and high entropy at their boundaries. We show that the log frequency of a chunk is a measure of its internal entropy. The Voting-Experts exploits the signature of chunks t...

Reusability of project components, either at the code level or at the conceptual specification level, is considered a fundamental aspect in application development. More recently it as been argued that project histories can support reuse of design decisions. We propose a solution based on so-called process chunks which are generic process frames to resolve the issue stated by a generic requirem...

Dividing sentences in chunks of words is a useful preprocessing step for parsing, information extraction and information retrieval. (Ramshaw and Marcus, 1995) have introduced a "convenient" data representation for chunking by converting it to a tagging task. In this paper we will examine seven di erent data representations for the problem of recognizing noun phrase chunks. We will show that the...