Hanane Azzag
2026
PUMA: Projected Universal Multilingual ASR for Low-Resource Settings. Application to Diverse African Languages
Ilyes Oukid | Bilal Faye | Hanane Azzag | Mustapha Lebbah | Said Yacine Boulahia
Findings of the Association for Computational Linguistics: ACL 2026
Ilyes Oukid | Bilal Faye | Hanane Azzag | Mustapha Lebbah | Said Yacine Boulahia
Findings of the Association for Computational Linguistics: ACL 2026
Multilingual ASR systems often fail to generalize to low-resource and linguistically diverse languages while remaining costly to scale. We introduce PUMA, a unified multilingual ASR model that improves low-resource performance with reduced model complexity. PUMA employs a Universal Language Projection (ULP) module that integrates a learnable language token with acoustic representations, enabling language-aware processing through shared parameters. Experiments on diverse African languages show consistent word error rate reductions over strong multilingual baselines, highlighting improved robustness and generalization. Our code is available at the following GitHub URL: https://github.com/ilyes-okd/PUMA
2025
Leveraging Text-to-Text Transformers as Classifier Chain for Few-Shot Multi-Label Classification
Quang Anh Nguyen | Nadi Tomeh | Mustapha Lebbah | Thierry Charnois | Hanane Azzag
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Quang Anh Nguyen | Nadi Tomeh | Mustapha Lebbah | Thierry Charnois | Hanane Azzag
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Multilabel text classification (MLTC) is an essential task in NLP applications. Traditional methods require extensive labeled data and are limited to fixed label sets. Extracting labels by LLMs is more effective and universal, but incurs high computational costs. In this work, we introduce a distillation-based T5 generalist model for zero-shot MLTC and few-shot fine-tuning. Our model accommodates variable label sets with general domain-agnostic pertaining, while modeling dependency between labels. Experiments show that our approach outperforms baselines of similar size on three few-shot tasks.