We extend the dependency grammar induction model of Klein and Manning (2004) to incorporate further valence information. Our extensions achieve significant improvements in the task of unsupervised dependency grammar induction. We use an expanded grammar which tracks higher orders of valence and allows each valence slot to be filled by a separate distribution rather than using one distribution f...

This paper presents a parsing algorithm in Prolog using GULP, based on dependency grammar and unification-based grammar.1 It parses declarative sentences of a free-word-order language, Korean. The dependency grammar accepts free order of the words in a sentence. Unification-based features separate the grammar from the parsing algorithm and also simplify the notation of the grammar. GULP (Graph ...

Extensible Dependency Grammar (XDG) is new, modular grammar formalism for natural language. An XDG analysis is a multi-dimensional dependency graph, where each dimension represents a different aspect of natural language, e.g. syntactic function, predicate-argument structure, information structure etc. Thus, XDG brings together two recent trends in computational linguistics: the increased applic...

Dependency grammar is usually interpreted as equivalent to a strict form of X–bar theory that forbids the stacking of nodes of the same bar level (e.g., N immediately dominating N with the same head). But adequate accounts of one–anaphora and of the semantics of multiple modifiers require such stacking and accordingly argue against dependency grammar. Dependency grammar can be salvaged by reint...

Dependency grammar is usually interpreted as equivalent to a strict form of X–bar theory that forbids the stacking of nodes of the same bar level (e.g., N immediately dominating N with the same head). But adequate accounts of one–anaphora and of the semantics of multiple modifiers require such stacking and accordingly argue against dependency grammar. Dependency grammar can be salvaged by reint...

This paper introduces a type system for Extensible Dependency Grammar (xdg) (Debusmann et al., 2004), a new, modular grammar formalism based on dependency grammar. As xdg is based on graph description, our emphasis is on capturing the notion of multigraph, a tuple of arbitrary many graphs sharing the same set of nodes. An xdg grammar consists of the stipulation of an extensible set of parametri...

Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency grammars, however the models employed are overly simplistic, particularly in comparison to supervised parsing models. In this paper we present an approach to dependency grammar induction using tree substitution grammar whi...

This article describes an attempt to implement a constraint-based dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Extensible Dependency Grammar (XDG). The grammar rules are automatically inferred from the Prague Dependency Treebank (PDT) and constrain dependency relations, modification frames and word order, including non-projectivity. Althoug...

This article describes an attempt to implement a constraintbased dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Extensible Dependency Grammar (XDG). The grammar rules are automatically inferred from the Prague Dependency Treebank (PDT) and constrain dependency relations, modification frames and word order, including non-projectivity. Although...