Identification of reversible dependency tree languages

Jérôme Besombes and Jean-Yves Marion. In Lubos Popelínský and Miloslav Nepil, editors, Proceedings of the 3d Workshop on Learning Language in Logic, pages 11--22, Strasbourg, France, September 2001.

Abstract

We investigate learning dependency grammar from positive data, in Gold's identification in the limit model. Examples are dependency trees. For this, we introduce reversible lexical dependency grammars which generate a significant class of languages. We have demonstrated that reversible dependency languages are learnable. We provide a O(n2)-time, in the example size, algorithm.

BibTeX entry.

Other publications

by J Besombes,
by J Y Marion,
on Language Learning,
of 2001.