We introduce the new grammar formalism of Extensible Dependency Grammar (XDG), enabling us to take the different dimensions of linguistic description more seriously than existing grammar formalisms. XDG treats the different linguistic dimensions as separate, autonomous dependency graphs. We show how this allows us to naturally account for taxing phenomena such as free word order, control, and q...

POBJ PMOD DIROBJ DET PERFECT SUBJ she had given the book to me

A quick way of gaining a first impression of a formalism is looking at concrete examples. The sentence Arthur attends the Prague meeting. is turned into the following representation by the PLAIN parser: (UTTERANCE: assertion': clause type[main] (< PROPOSITION: attend: verb form[finite] tense[present] person[3rd] number[singular] (< SUBJECT: Arthur: noun person[3rd] number[singular]) (> DIROBJEC...

A grammar is a theory about a language. Theories may be formulated in a natural language, describing the properties of the object in question. Another way of providing information about an object is designing a model. A model is an artificial construct resembling the object in certain respects. In linguistics, formal models play a major role. A formal model (or formalism) consists of a set of s...

We propose to model multiword expressions as dependency subgraphs, and realize this idea in the grammar formalism of Extensible Dependency Grammar (XDG). We extend XDG to lexicalize dependency subgraphs, and show how to compile them into simple lexical entries, amenable to parsing and generation with the existing XDG constraint solver.

This document presents a new kind of grammar: the Generative Dependency Grammar (GDG). This type of grammar is based on dependency trees (DT) and a generative process. GDG will eliminate some issues of DG (by example the missing of phrasal categories) and GG (the problem of discontinuous structures) and will merge the advantages of the two types of grammar (GG the representation of phrasal cate...

This paper presents the development of an open-source Spanish Dependency Grammar implemented in FreeLing environment. This grammar was designed as a resource for NLP applications that require a step further in natural language automatic analysis, as is the case of Spanish-to-Basque translation. The development of wide-coverage rule-based grammars using linguistic knowledge contributes to extend...

This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a word order domain structure, which is linked but structurally dissimilar to the syntactic dependency tree. We then discuss the implementation of such a DG using constructs f...

In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a lexicalized grammar must search a large set of supertags to choose the right ones to combine for the parse of the sentence. We present techniques for disambi...

In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a lexicalized grammar must search a large set of supertags to choose the right ones to combine for the parse of the sentence. We present techniques for disambi...