Evènement pour le groupe Séminaire Méthodes Formelles

Date 2019-11-19  07:00-07:00
TitreLearning probabilistic context-free grammars 
RésuméIn this talk I will present a solution to the following problem: given a set of strings, learn the underlying probabilistic context-free grammar generating these strings. The main difficulty is that we observe strings and not (for instance) derivation trees. In general, strings are not enough to identify a unique grammar (as for instance the string abc can be generated in various ways). I will introduce some structural properties ensuring this identifiability, and show that the corresponding class of probabilistic context-free grammars can be efficiently learned. 
OrateurNathanaël Fijalkow 

Aucun document lié à cet événement.

Retour à l'index