Learning discrete categorial grammars from structures

Jérôme Besombes; Jean-Yves Marion

RAIRO - Theoretical Informatics and Applications (2008)

  • Volume: 42, Issue: 1, page 165-182
  • ISSN: 0988-3754

Abstract

top
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.

How to cite

top

Besombes, Jérôme, and Marion, Jean-Yves. "Learning discrete categorial grammars from structures." RAIRO - Theoretical Informatics and Applications 42.1 (2008): 165-182. <http://eudml.org/doc/250324>.

@article{Besombes2008,
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. },
author = {Besombes, Jérôme, Marion, Jean-Yves},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Classical categorial grammar; grammatical inference; gold's identification in the limit; types; positive examples; reversible class of languages},
language = {eng},
month = {1},
number = {1},
pages = {165-182},
publisher = {EDP Sciences},
title = {Learning discrete categorial grammars from structures},
url = {http://eudml.org/doc/250324},
volume = {42},
year = {2008},
}

TY - JOUR
AU - Besombes, Jérôme
AU - Marion, Jean-Yves
TI - Learning discrete categorial grammars from structures
JO - RAIRO - Theoretical Informatics and Applications
DA - 2008/1//
PB - EDP Sciences
VL - 42
IS - 1
SP - 165
EP - 182
AB - 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.
LA - eng
KW - Classical categorial grammar; grammatical inference; gold's identification in the limit; types; positive examples; reversible class of languages
UR - http://eudml.org/doc/250324
ER -

References

top
  1. D. Angluin, Inference of reversible languages. J. ACM29 (1982) 741–765.  Zbl0485.68066
  2. Y. Bar-Hillel, C. Gaifman, and E. Shamir, On categorial and phrase structure grammars. Bulletin of Research Council of Israel F(9) (1960) 1–16.  Zbl0158.25306
  3. R. Bonato and C. Retoré, Learning rigid lambek grammars and minimalist grammars from structured sentences, in Third Learning Language in Logic Workshop (LLL2001) (2001).  Zbl1285.03024
  4. W. Buszkowski and G. Penn, Categorial grammars determined from linguistic data by unification. Studia Logica49 (1990) 431–454.  Zbl0718.03020
  5. C. Costa Florêncio, Consistent identification in the limit of any of the classes -valued is np-hard, in Logical Aspects of Computational Linguistics, edited by C. Retoré, P. de Groote, G. Morrill. Lect. Notes Comput. Sci. (2001) 125–138.  Zbl0990.68080
  6. D. Dudau-Sofronie, Apprentissage de Grammaires Catégorielles pour simuler l'acquisition du Langage Naturel à l'aide d'informations sémantiques. Ph.D. thesis, Lille I University (2004).  
  7. M.E. Gold, Language identification in the limit. Inform. Control10 (1967) 447–474.  Zbl0259.68032
  8. M. Kanazawa, Learnable classes of Categorial Grammars. CSLI (1998).  Zbl0937.68130
  9. Yannick Le Nir, Structures des analyses syntaxiques catégorielles. Application à l'inférence grammaticale. Ph.D. thesis, Rennes 1 University (2003).  
  10. M. Moortgat, Categorial type logics, in Handbook of Logic and Language. North-Holland, J. van Benthem and A. ter Meulen edition (1996).  
  11. M. Moortgat, Structural equations in language learning, in Logical Aspects of Computational Linguistics, edited by C. Retoré, P. de Groote, G. Morrill. Lect. Notes Comput. Sci.2099 (2001) 1–16.  Zbl0990.03023
  12. G.V. Morril, Type Logical Grammar: categorial logic of signs. Kluwer (1994).  Zbl0848.03007
  13. C. Rétoré, The logic of categorial grammars. Technical Report 5703, INRIA (2005).  URIhttp://www.inria.fr/rrrt/rr-5703.html
  14. Y. Sakakibara, Efficient learning of context free grammars from positive structural examples. Inform. Comput.97 (1992) 23–60.  Zbl0764.68146
  15. I. Tellier, Modéliser l'acquisition de la syntaxe du langage naturel via l'hypothése de la primauté du sens. Ph.D. thesis, Lille I University (2005).  
  16. H.J. Tiede, Lambek calculus proofs and tree automata. Lect. Notes Comput. Sci.2014 (2001) 251–265.  Zbl0976.03024

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.