Publication details

Saarland University Computer Science

The string-generative capacity of regular dependency languages

Marco Kuhlmann, Mathias Möhl

Twelfth Conference on Formal Grammar (FG), 2007

This paper contributes to the formal theory of dependency grammar. We apply the classical concept of algebraic recognizability to characterize regular sets of dependency structures, and show how in this framework, two empirically relevant structural restrictions on dependency analyses yield infinite hierarchies of ever more expressive string languages.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy