Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Differentiable Perturb-and-Parse: Semi-Supervised Parsing with a Structured Variational Autoencoder., and . CoRR, (2018)Span-based discontinuous constituency parsing: a family of exact chart-based algorithms with time complexities from O(n\^6) down to O(n\^3).. EMNLP (1), page 2753-2764. Association for Computational Linguistics, (2020)Lagrangian Based Approaches for Lexicalized Tree Adjoining Grammar Parsing. (Approches fondées sur la relaxation Lagrangienne pour l'analyse syntaxique avec grammaires d'arbres adjoints).. Sorbonne Paris Cité, France, (2018)On graph-based reentrancy-free semantic parsing., and . CoRR, (2023)Preventing posterior collapse in variational autoencoders for text generation via decoder regularization., and . CoRR, (2021)Auto-encodeurs variationnels : contrecarrer le problème de posterior collapse grâce à la régularisation du décodeur (Variational auto-encoders : prevent posterior collapse via decoder regularization)., and . TALN (1), page 2-10. ATALA, (2021)Un algorithme d'analyse sémantique fondée sur les graphes via le problème de l'arborescence généralisée couvrante (A graph-based semantic parsing algorithm via the generalized spanning arborescence problem)., and . TALN-RECITAL, page 226-235. ATALA, (2022)Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound., , , , and . ACL (1), The Association for Computer Linguistics, (2016)SaulLM-7B: A pioneering Large Language Model for Law., , , , , , , , , and 1 other author(s). CoRR, (2024)Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence., , and . EMNLP, page 1644-1654. Association for Computational Linguistics, (2017)