Learning Reversible Categorial Grammars from Structures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Learning Reversible Categorial Grammars from Structures

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.
Not file

Dates and versions

inria-00101086 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00101086 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More