We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
Surface realisation with grammars integrating flat semantics is known to be NP complete. In this paper, we present a new algorithm for surface realisation based on Feature Based T...
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures o...