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.
Type de document :
Communication dans un congrès
3rd Learning Language in Logic (LLL) Workshop, Sep 2001, Strasbourg, France, 12 p, 2001
Liste complète des métadonnées

https://hal.inria.fr/inria-00100423
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:43:37
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00100423, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

143