RAIRO-Theor. Inf. Appl.
Volume 42, Number 1, January-March 2008A nonstandard spirit among computer scientists:a tribute to Serge Grigorieff at the occasion of his 60th birthday
|Page(s)||165 - 182|
|Published online||18 January 2008|
Learning discrete categorial grammars from structures
ONERA/DTIM (Traitement de l'Information et Modélisation); firstname.lastname@example.org
2 Nancy-Université, Loria-INPL-ENSMN; Jean-Yves.Marion@loria.fr
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.