Learning Reversible Categorial Grammars from Structures

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 define the class of reversible classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakkakibara. We show that the class of reversible classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated to a word and the class is still identifiable in polynomial time. We illustrate the relevance of the class of reversible classical categorial grammars with linguistic examples.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00101086
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:56:10 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • HAL Id : inria-00101086, version 1

Collections

Citation

Jérôme Besombes, Jean-Yves Marion. Learning Reversible Categorial Grammars from Structures. Categorial Grammars, 2004, Montpellier, France, 10 p. ⟨inria-00101086⟩

Share

Metrics

Record views

140