QazNLP: Constraint-Aware Multi-Task Sequence Labeling for Morphologically Rich Low-Resource Languages

2026

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.1109/access.2026.3691193
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Automatic processing of morphologically rich, agglutinative, and low-resource languages remains challenging because productive affixation increases lexical sparsity, weakens statistical generalization, and often produces inconsistent predictions across related linguistic annotation tasks. This study presents QazNLP, a constraint-aware multi-task framework for Kazakh that jointly performs morphological tagging, part-of-speech tagging, and named entity recognition using a shared transformer encoder with task-specific prediction heads. To improve structural reliability, the framework introduces differentiable cross-task compatibility penalties that discourage linguistically invalid label combinations during training and constrained decoding. The study further provides a reproducible evaluation setting based on a cleaned Kazakh news corpus with fixed data splits and robustness diagnostics for out-of-vocabulary tokens, long agglutinative word forms, reduced-data regimes, and cross-task contradiction analysis. In addition, the manuscript explicitly documents the encoder and tokenization setup, justifies the choice of pretrained encoder, reports decoding complexity, and situates the NER component with respect to the KazNERD benchmark. Experimental results show that the proposed model consistently outperforms competitive single-task and shared multi-task baselines in joint average F1, robustness under sparse-data conditions, and structural consistency of predicted labels. The findings indicate that explicit compatibility-aware optimization offers a practical and extensible direction for sequence labeling in morphologically rich low-resource languages.