It can scarcely be denied that the supreme goal of all theory is to make the

This paper investigates the relationship between the probability with which a word appears in a given lexical context and the prosodic variability of that word. Regression analyses indicate that the higher the probability of a word in its lexical context, the lower the variability in the pitch

We define a new formal grammatical system called a link grammar . A sequence of words is in the language of a link grammar if there is a way to draw links between words in such a way that (1) the local requirements of each word are satisfied, (2) the links do not cross, and (3) the words form a

text corpora. The work described here is a step along the way toward a bootstrapping scheme that involves inducing a tagger from word distributions, a lowlevel “chunk ” parser from a tagged corpus, and lexical dependencies from a chunked corpus. In particular, I describe a chunk parsing technique based

on the dimension of single word detector activity is reached. Two additional criteria set on the dimensions of total lexical activity and time from stimulus onset are hypothesized to be operational in the lexical decision task. These additional criteria flexibly adjust to changes in stimulus material and task

SEQUITUR is an algorithm that infers a hierarchical structure from a sequence of discrete symbols by replacing repeated phrases with a grammatical rule that generates the phrase, and continuing this process recursively. The result is a hierarchical representation of the original sequence, which

, our results also indicate that current measures are limited in their ability to account for sequence typicality. © 2001 Academic Press Key Words: wordlikeness; phonotactics; token frequency; lexical neighborhood; sequence typicality. Any speaker of English can tell that Zbigniew

An important component of any generation system is the mapping dictionary, a lexicon of elementary semantic expressions and corresponding natural language realizations. Typically,

INTRODUCTION A lexical transducer, first discussed in Karttunen, Kaplan and Zaenen 1992, is a specialised finite-state automaton that maps inflected surface forms to lexical forms, and vice versa. The lexical form con- sists of a canonical representation of the word and a sequence of tags

The \size-change termination" principle for a rst-order functional language with well-founded data is: a program terminates on all inputs if every innite call sequence (following program control ow) would cause an innite descent in some data values. Size-change analysis is based only