HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Identification reversible dependency tree languages

Jérôme Besombes 1 Jean-Yves Marion 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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(n^2)$-time, in the example size, algorithm.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:43:37 PM
Last modification on : Friday, February 4, 2022 - 3:34:53 AM


  • HAL Id : inria-00100423, version 1



Jérôme Besombes, Jean-Yves Marion. Identification reversible dependency tree languages. 3rd Learning Language in Logic (LLL) Workshop, L. Popelinsky, M. Nepil, Sep 2001, Strasbourg, France, 12 p. ⟨inria-00100423⟩



Record views