A Generative Dependency Grammar
نویسنده
چکیده
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 categories; GDG the handling of discontinuous structures as gaps and non projective constructions). By generating a surface text using these GDG, the DT of the text is obtained too. We will present first of all some basic notions (chapter 2) that will be used to informally define the DT and some graphical notations (chapter 3) used to represent these DT. After the details about links in DT (chapter 4) we will give a formal definition of the DT (chapter 5), of the GDG (chapter 6) and of the substitution used in generation process (chapter 7). In the chapter 8 we will present the generation in GDG and some examples. In chapter 9 we will indicate some possibility to expand GDG formalism that is starting to be used for Romanian language, and other conclusions. GDG is useful in grammar representations for machine translation and the data retrieval.
منابع مشابه
GRAALAN – Grammar Abstract Language Basics
This paper gives an outline about most important features of GRAALAN (Grammar Abstract Language) used for linguistic knowledge description. GRAALAN is an implementation of theoretical concepts of GDGF (Generative Dependency Grammars with Features) and AVT (Attribute Value Trees). GDGF is based on dependency trees (DT) and a generative process. GDG eliminates some issues of Dependency Grammars D...
متن کاملNatural Language Processing Using Generative Indirect Dependency Grammar
Abstract. This paper presents an extension of the Generative Dependency Grammar (GDG) and GDG with Feature Structure (FS). The extension consist of the indirect dependency notion introduction. The direct dependencies allows to expres some relations between elements (for exemples non-terminals) belonging to the the right side of a single grammar rule. The indirect relations will allow to express...
متن کاملA Simple String-Rewriting Formalism For Dependency Grammar
Recently, dependency grammar has gained renewed attention as empirical methods in parsing have emphasized the importance of relations between words, which is what dependency grammars model explicitly, but context-free phrase-structure grammars do not. While there has been much work on formalizing dependency grammar and on parsing algorithms for dependency grammars in the past, there is not a co...
متن کاملThe string-generative capacity of regular dependency languages
This paper contributes to the formal theory of dependency grammar. We apply the classical concept of algebraic recognizability to characterize regular sets of dependency structures, and show how in this framework, two empirically relevant structural restrictions on dependency analyses yield infinite hierarchies of ever more expressive string languages.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002