This paper represents categorial grammar as an implicational type theory in the spirit of Girard's linear logic, and illustrates linguistic applications of a range of type-constructors over and above implication. The type theoretic perspective is concerned with a correspondence between the logic of types, and computational operations over the objects inhabiting types. In linguistic applications...

Stochastic context-free grammar (SCFG) has been successful in modeling biomolecular structures, typically RNA secondary structure, for statistical analysis and structure prediction. Context-free grammar rules specify parallel and nested co-occurren-ces of terminals, and thus are ideal for modeling nucleotide canonical base pairs that constitute the RNA secondary structure. Stochastic grammars h...

We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and terminating deterministic constraint solving procedure is given. Deterministic computational model is achieved by weakening the logic such that it is sufficient ...

The theoretical richness, formal rigor and computational versatility of Head-driven Phrase Structure Grammar (HPSG) preclude any kind of in-depth coverage of its content within the confines of an encyclopedia article such as this. Our objectives are accordingly far more modest: we seek to provide a kind of aerial view of the linguistic approach (§2), summarize the formal foundations (§3), and c...

Animations of American Sign Language (ASL) can make more information, websites, and services accessible for the significant number of deaf people in the United States with lower levels of written language literacy – ultimately leading to fuller social inclusion for these users. We are collecting and analyzing an ASL motion-capture corpus of multi-sentential discourse to seek computational model...

A model is presented that addresses both the distribution and comprehension of different forms of referring expressions in language. This model is expressed in a formalism (Kamp & Reyle, 1993) that uses interpretive rules to map syntactic representations onto representations of discourse. Basic interpretive rules are developed for names, pronouns, definite descriptions, and quantified descripti...

Double R Grammar is a linguistic theory of the grammatical encoding and integration of referential and relational meaning in English. Double R Grammar is fundamentally a Cognitive Linguistic theory (Langacker, 1987, 1991; Lakoff, 1988; Talmy, 2003) and the use of the term “grammar” encompasses both meaning and structure as it does in Cognitive Grammar (also known as Cognitive Semantics). Double...

This paper presents a mathematical de nition of Left-Associative Grammar, and describes its formal properties. Conceptually, LA-grammar is based on the notion of possible continuations, in contrast to more traditional systems such as Phrase Structure Grammar and Categorial Grammar, which are linguistically motivated in terms of possible substitutions. It is shown that LA-grammar generates all a...

Alpino is a wide-coverage computational analyzer of Dutch which aims at accurate, full, parsing of unrestricted text. We describe the head-driven lexicalized grammar and the lexical component, which has been derived from existing resources. The grammar produces dependency structures, thus providing a reasonably abstract and theory-neutral level of linguistic representation. An important aspect ...

We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call semidirectional. In semidirectional Lambek calculus SDL there is an additional nondirectional abstraction rule allowing the formula abstracted over to appear anywhere in the premise sequent’s left-hand side, thus permitting non-peripheral extraction. SDL grammars are able to gener...