Caio Corro
Publications
Publications
|
|
CroissantLLM: A Truly Bilingual French-English Language ModelTransactions of Machine Learning Research, 2025 |
|
|
Discrete Latent Structure in Neural NetworksFoundations and Trends in Signal Processing, 2025, Foundations and Trends in Signal Processing, 19 (2), pp.99-211. ⟨10.1561/2000000134⟩ |
|
|
On Graph-based Reentrancy-free Semantic ParsingTransactions of the Association for Computational Linguistics, 2023, 11, pp.703-722. ⟨10.1162/tacl_a_00570⟩ |
|
|
EuroBERT: Scaling Multilingual Encoders for European LanguagesCOLM 2025 - Second Conference on Language Modeling, Oct 2025, Montreal, Canada. pp.1-28 |
|
|
Bregman Conditional Random Fields: Sequence Labeling with Parallelizable Inference AlgorithmsACL 2025 - 63rd Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, Jul 2025, Vienne, Austria. pp.29557-29574, ⟨10.18653/v1/2025.acl-long.1430⟩ |
|
|
Extraction of Contrastive Rules from Syntactic Treebanks: A Case Study in Romance LanguagesQUASY 2025 - Third Workshop on Quantitative Syntax, Aug 2025, Ljubljana, Slovenia. pp.26--38 |
|
|
Nested Named Entity Recognition as Single-Pass Sequence LabelingEMNLP 2025 - Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, Nov 2025, Suzhou, China. pp.9993-10002, ⟨10.18653/v1/2025.findings-emnlp.530⟩ |
|
|
Training LayoutLM from Scratch for Efficient Named-Entity Recognition in the Insurance DomainJoint Workshop of the 9th Financial Technology and Natural Language Processing (FinNLP), the 6th Financial Narrative Processing (FNP), and the 1st Workshop on Large Language Models for Finance and Legal (LLMFinLegal), Jan 2025, Abu Dabi, United Arab Emirates. pp.1-9 |
|
|
Few-Shot Domain Adaptation for Named-Entity Recognition via Joint Constrained k-Means and Subspace SelectionCOLING 2025 - 31st International Conference on Computational Linguistics, Jan 2025, Abu Dhabi, United Arab Emirates. pp.9902-9916, ⟨10.48550/arxiv.2412.00426⟩ |
|
|
Régression logistique parcimonieuse pour l'extraction automatique de règles de grammaire35èmes Journées d'Études sur la Parole (JEP 2024) 31ème Conférence sur le Traitement Automatique des Langues Naturelles (TALN 2024) 26ème Rencontre des Étudiants Chercheurs en Informatique pour le Traitement Automatique des Langues (RECITAL 2024), Jul 2024, Toulouse, France. pp.211-218 |
|
|
A Fast and Sound Tagging Method for Discontinuous Named-Entity RecognitionEMNLP 2024 - Conference on Empirical Methods in Natural Language Processing, Nov 2024, Miami, United States. pp.19506-19518, ⟨10.18653/v1/2024.emnlp-main.1087⟩ |
|
|
On the inconsistency of separable losses for structured prediction17th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2023), May 2023, Dubrovnik, Croatia. pp.1491-1498, ⟨10.18653/v1/2023.eacl-main.109⟩ |
|
|
Structural generalization in COGS: Supertagging is (almost) all you need2023 Conference on Empirical Methods in Natural Language Processing, Dec 2023, Singapour, Singapore. pp.1089-1101, ⟨10.18653/v1/2023.emnlp-main.69⟩ |
|
|
A dynamic programming algorithm for span-based nested named-entity recognition in O(n 2 )61st Annual Meeting of the Association for Computational Linguistics, Jul 2023, Toronto, Canada. pp.10712-10724, ⟨10.18653/v1/2023.acl-long.598⟩ |
|
|
GPU-Accelerated Forward-Backward Algorithm with Application to Lattice-Free MMIIEEE International Conference on Acoustics, Speech, and Signal Processing, May 2022, Singapour, Singapore. pp.8417-8421, ⟨10.1109/ICASSP43922.2022.9746824⟩ |
|
|
Ré-ordonnancement via programmation dynamique pour l'adaptation cross-lingue d'un analyseur en dépendances29ème Conférence sur le Traitement Automatique des Langues Naturelles (TALN 2022), Association pour le Traitement Automatique des Langues (ATALA); Laboratoire d’Informatique et Systèmes (LIS); Laboratoire Informatique d’Avignon (LIA), Jun 2022, Avignon, France. pp.183-197 |
|
|
Un algorithme d'analyse sémantique fondée sur les graphes via le problème de l'arborescence généralisée couvrante29e Conférence sur le Traitement Automatique des Langues Naturelles (TALN 2022), Jun 2022, Avignon, France. pp.226-235 |
|
|
Auto-encodeurs variationnels : contrecarrer le problème de posterior collapse grâce à la régularisation du décodeurTraitement Automatique des Langues Naturelles, 2021, Lille, France. pp.2-10 |
|
|
Sur l'impact des contraintes structurelles pour l'analyse en dépendances profondes fondée sur les graphes6e conférence conjointe Journées d'Études sur la Parole (JEP, 33e édition), Traitement Automatique des Langues Naturelles (TALN, 27e édition), Rencontre des Étudiants Chercheurs en Informatique pour le Traitement Automatique des Langues (RÉCITAL, 22e édition). Volume 2 : Traitement Automatique des Langues Naturelles, Jun 2020, Nancy, France. pp.197-204 |
|
|
Span-based discontinuous constituency parsing: a family of exact chart-based algorithms with time complexities from O(n^6) down to O(n^3)Empirical Methods in Natural Language Processing, Nov 2020, Punta Cana (virtual), Dominican Republic. pp.2753-2764, ⟨10.18653/v1/2020.emnlp-main.219⟩ |
|
|
Learning Latent Trees with Stochastic Perturbations and Differentiable Dynamic Programming57th annual meeting of Association for Computational Linguistics, Jul 2019, Florence, Italy |
|
|
Differentiable Perturb-and-Parse: Semi-Supervised Parsing with a Structured Variational Auto-EncoderInternational Conference on Learning Representations, May 2019, La Nouvelle-Orléans, United States |
|
|
Transforming Dependency Structures to LTAG Derivation Trees13th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+13), Sep 2017, Umea, Sweden. pp.112-121 |
|
|
Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence2017 Conference on Empirical Methods in Natural Language Processing, Sep 2017, Copenhagen, Denmark. pp.1644 - 1654 |
Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound54th Annual Meeting of the Association for Computational Linguistics, Aug 2016, Berlin, Germany |
|
|
Lagrangian Based Approaches for Lexicalized Tree Adjoining Grammar ParsingData Structures and Algorithms [cs.DS]. Université Sorbonne Paris Cité, 2018. English. ⟨NNT : 2018USPCD051⟩ |
|
|
Actes de la journée d'étude sur la robustesse des systemes de TAL2022 |
|
|
PFIA 2025Bulletin de l'Association Française pour l'Intelligence Artificielle, 130, 2025, Association Française pour l'Intelligence Artificielle |
|
|
IA & économieBulletin de l'Association Française pour l'Intelligence Artificielle, 129, pp.1-60, 2025, Association Française pour l'Intelligence Artificielle |
|
|
Fast and General Automatic Differentiation for Finite-State Methods2026 |