Papers › A Transformer-based Threshold-Free Framework for Multi-Intent NLU
A Transformer-based Threshold-Free Framework for Multi-Intent NLU
Lisung Chen, Nuo Chen, Yuexian Zou, Yong Wang, Xinzhong Sun
Multi-intent natural language understanding (NLU) has recently gained attention. It detects multiple intents in an utterance, which is better suited to real-world scenarios. However, the state-of-the-art joint NLU models mainly detect multiple intents on threshold-based strategy, resulting in one main issue: the model is extremely sensitive to the threshold settings. In this paper, we propose a transformer-based Threshold-Free Multi-intent NLU model (TFMN) with multi-task learning (MTL). Specifically, we first leverage multiple layers of a transformer-based encoder to generate multi-grain representations. Then we exploit the information of the number of multiple intents in each utterance without additional manual annotations and propose an auxiliary detection task: Intent Number detection (IND). Furthermore, we propose a threshold-free intent multi-intent classifier that utilizes the output of IND task and detects the multiple intents without depending on the threshold. Extensive experiments demonstrate that our proposed model achieves superior results on two public multi-intent datasets.
Code
No code repository is listed for this paper in the archive or in Syntology's graph.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Intent Detection | MixATIS | TFMN | Accuracy | 79.8 | #6 of 15 | Archive leaderboard | report |
| Intent Detection | MixSNIPS | TFMN | Accuracy | 97.7 | #4 of 16 | Archive leaderboard | report |
| Slot Filling | MixATIS | TFMN | Micro F1 | 88.0 | #12 of 15 | Archive leaderboard | report |
| Slot Filling | MixSNIPS | TFMN | Micro F1 | 96.4 | #5 of 16 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections