We propose a format of a binary phrase structure grammar with composite labels. The grammar adopts binary rules so that the dependency between two sub-trees can be represented in the label of the tree. The label of a tree is composed of two attributes, each of which is extracted from each sub-tree, so that it can represent the compositional information of the tree. The composite label is genera...

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...

This paper describes a novel strategy for automatic induction of a monolingual dependency grammar under the guidance of bilingually-projected dependency. By moderately leveraging the dependency information projected from the parsed counterpart language, and simultaneously mining the underlying syntactic structure of the language considered, it effectively integrates the advantages of bilingual ...

In this paper, we propose a novel dependency-based bracketing transduction grammar for statistical machine translation, which converts a source sentence into a target dependency tree. Different from conventional bracketing transduction grammar models, we encode target dependency information into our lexical rules directly, and then we employ two different maximum entropy models to determine the...

This paper presents experiments which combine a grammar-driven and a datadriven parser. We show how the conversion of LFG output to dependency representation allows for a technique of parser stacking, whereby the output of the grammar-driven parser supplies features for a data-driven dependency parser. We evaluate on English and German and show significant improvements stemming from the propose...

We introduce an approach based on using the dependency grammar representations of sentences to compute sentence similarity for extractive multi-document summarization. We adapt and investigate the effects of two untyped dependency tree kernels, which have originally been proposed for relation extraction, to the multi-document summarization problem. In addition, we propose a series of novel depe...

We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of a single tree as well as a numerical method for optimizing a grammar of orderings over a set of dependency types. A grammar generated by minimizing dependency length in unordered trees from the Penn Treebank is found t...

What the thesis is about Extensible Dependency Grammar (XDG) new grammar formalism for natural language explores the combination of:

In the Lingenio analysis systems, the sentences are analyzed into syntactic slot grammar representations from which so called 'dependency trees' are derived which reduce the analyses to the semantically relevant nodes and decorate these by information from the semantic lexicon. Slot grammar is a unification-­‐based dependency grammar (cf. McCord 89). It has been used in the Logic based Machine ...