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 non-projective and even non-ordered, while the topological tree is(More)
We propose a syntax-semantics interface that real-ises 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(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)
This paper introduces a parser system for the meta grammar formalism of Ex-tensible Dependency Grammar (XDG). XDG is a generalisation of Topological Dependency Grammar (TDG) (Duchier and Debusmann, 2001). The XDG parser system comprises a constraint-based parser for all possible instances of XDG, a statically typed grammar input language, and a flexible(More)
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(More)