INTRODUCTION In this paper we compare three models of transformational grammar: the mathematical model of Ginsburg and Partee (1969) as applied by Salomaa (1971), the mathematical model of Peters and Ritchie (1971 and forthcoming), and the computer model of Friedman et al. (1971). All of these are, of course, based on the work of Chomsky as presented in Aspects of the Theory of Syntax (1965). W...

In this paper we demonstrate the computational benefits of a radically lexicalist generative grammar. We have developed a Prolog-parser on the basis of the new approach of Totally Lexicalist Morphology (TLM), which is developed out of Generative Argument Structure Grammar (GASG; [2]), a new and radical version of lexicalist generative grammar (in the spirit of e.g. Karttunen [5]). The parser de...

We present a type theoretic analysis of Latin grammar, which pays as much attention to inflectional morphology as to syntax. We assign different types to the finite forms of Latin verbs as well as to their infinitives. The rich repertory of agreement information exhibited by Latin is accounted for by a system of numerical indexes (superscripts and subscripts) attached to the types. Agreement co...

An important goal of modern linguistic theory is to characterize as narrowly as possible the class of natural languages. One classical approach to this characterization has been to investigate the generative capacity of grammatical systems specifiable within particular linguistic theories. Formal results along these lines have already been obtained for certain kinds of Transformational Generat ...

In this paper, I shall give an overview of HaG (=Hausa Grammar), an emerging computational grammar of Hausa1, developed within the framework of Head-driven Phrase Structure (Pollard and Sag, 1987, 1994; Sag, 1997). Since HPSG is an integrated theory of syntax and semantics, meaning representations are built up in tandem with syntactic analysis. Semantics in HaG are represented using Minimal Rec...

In this paper, we describe a multilingual open-source computational grammar of Persian, developed in Grammatical Framework (GF) – A type-theoretical grammar formalism. We discuss in detail the structure of different syntactic (i.e. noun phrases, verb phrases, adjectival phrases, etc.) categories of Persian. First, we show how to structure and construct these categories individually. Then we des...

The process of turning a “hand-written” HPSG theory into a working computational grammar requires complex considerations. Two leading platforms are available for implementing HPSG grammars: The LKB and TRALE. These platforms are based on different approaches, distinct in their underlying logics and implementation details. This paper adopts the perspective of a computational linguist whose goal ...

The computational problem of parsing a sentence in a tree-adjoining language is investigated. An interesting relation is studied between this problem and the well-known computational problem of Boolean matrix multiplication: it is shown that any algorithm for the solution of the former problem can easily be converted into an algorithm for the solution of the latter problem. This result bears on...