This paper describes various techniques for enriching unification-based grammatical formalisms with notational devices that are compiled into categories and rules of a standard unification grammar. This enables grammarians to avail themselves of apparently richer notations which allow for the succinct and relatively elegant expression of grammatical facts, while still allowing for efficient pro...

finch,[email protected] [email protected] Abstract The set of features used by any predictive model is of pivotal importance to its performance. In this paper we show the utility and quantify the effect of adding features consisting of arrangements of words and tags (selected by an expert grammarian) in the local context of a trigram tagger. We look in detail at the effect, on tagging w...

An open problem in AI is the definition of meaningful information processing. That human interpretation and information processing by current computers can be different is well illustrated by Searle’s famous Chinese room argument thought experiment. In this paper we suggest that an answer to the above open problem of AI can be given by introducing a model of information processing which is embe...

Generative grammarians typically advocate for a rationalist understanding of language acquisition, according to which the structure developed faculty reflects innate guidance rather t...

We present the results of experimenting with schemes for learning probabilistic dependency grammars1 for English from corpora labelled with part-of-speech information. We intend our system to produce widecoverage grammars which have some resemblance to the standard 2 context-free grammars of English which grammarians and linguists commonly exhibit as exampies.

This paper describes various techniques for enriching unification-based grammatical formalisms with notational devices that are compiled into categories and rules of a standard unification grammar. This enables grammarians to avail themselves of apparently richer notations that allow for the succinct and relatively elegant expression of grammatical facts, while still allowing for efficient proc...

This paper contributes to the theory of substructural logics .that are of interest to categorial grammarians. Combining semantic ideas of Hepple [1990] and Mor-rill [1990], proof-theoretic ideas of Venema [1993b; 1993a] and the theory of equational specifications, a class of resource-preserving logics is defined, for which decidability and completeness theorems are established.