Document RAIRO-Theor. Inf. Appl. 42, 165-182 (2008)
DOI: 10.1051/ita:2007055
Learning discrete categorial grammars from structures
Jérôme Besombes1 and Jean-Yves Marion21 ONERA/DTIM (Traitement de l'Information et Modélisation); jerome.besombes@onera.fr
2 Nancy-Université, Loria-INPL-ENSMN; Jean-Yves.Marion@loria.fr
(Published online: 18 January 2008)
Abstract
We define the class of discrete classical categorial grammars, similar in
the spirit to the notion of reversible class of languages introduced by Angluin and
Sakakibara. We show that the class of discrete 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 discrete classical categorial grammars with linguistic examples.
Mathematics Subject Classification. 68Q32, 68T50, 03B47
Key words: Classical categorial grammar -- grammatical inference -- gold's identification in the limit -- types -- positive examples
© EDP Sciences 2007