Ralph Debusmann

Learn More
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutually constraining structures: a syntactic dependency tree and a topological dependency tree. The syntax tree is nonprojective and even non-ordered, while the topological tree is(More)
We propose a syntax-semantics interface that realises the mapping between syntax and semantics as a relation and does not make functionality assumptions in either direction. This interface is stated in terms of Extensible Dependency Grammar (XDG), a grammar formalism we newly specify. XDG’s constraint-based parser supports the concurrent flow of information(More)
Extensible Dependency Grammar (XDG) is a graph description language whose formulas can be solved by constraint programming. XDG is designed so as to yield a declarative approach to natural language processing, in particular to parsing and generation. In this paper, we present the XDG Development Kit (XDK), the first XDG-based grammar development system,(More)
We propose a formal characterization of variation in the syntactic realization of semantic arguments, using hierarchies of syntactic relations and thematic roles, and a mechanism of lexical inheritance to obtain valency frames from individual linking types. We embed the formalization in the new lexicalized, dependency-based grammar formalism of Topological(More)
We introduce a modular, dependency-based formalization of Information Structure (IS) based on Steedman’s prosodic account [1, 2]. We state it in terms of Extensible Dependency Grammar (XDG) [3], introducing two new dimensions modeling 1) prosodic structure, and 2) theme/rheme and focus/background partitionings. The approach goes without a non-standard(More)
The paper introduces a generalisation of Topological Dependency Grammar (TDG) (Duchier and Debusmann, 2001). The result, Extensible Dependency Grammar (XDG), is a description language for sets of labeled directed graphs. Lexicalisation turns XDG into a powerful meta grammar formalism. XDG can be instantiated to yield specific grammar formalisms based on(More)
We combine state-of-the-art techniques from computational linguistics and theorem proving to build an engine for playing text adventures, computer games with which the player interacts purely through natural language. The system employs a parser for dependency grammar and a generation system based on TAG, and has components for resolving and generating(More)
Grammar formalisms built on the notion of word-to-word dependencies make attractive alternatives to formalisms built on phrase structure representations. However, little is known about the formal properties of dependency grammars, and few such grammars have been implemented. We present results from two strands of research that address these issues. The aims(More)