SFL-MTSC: Leveraging Semantic Frame-Level Multi-Task Self-Consistency for Robust Multi-Intent Spoken Language Understanding

Po-Yen Chen, Berlin Chen
6/24/2026
cs.CLcs.AI

No official code found. Best implementation: boyan1001/SFL-MTSC (2 stars, MIT, last commit 2026-06-05).

Abstract

Prompt-based spoken language understanding (SLU) with large language models (LLMs) often suffers from inconsistent intent--slot structures due to decoding stochasticity, particularly in multi-intent scenarios. In view of this, we propose Semantic Frame-Level Multi-Task Self-Consistency (SFL-MTSC), a novel structured aggregation framework operating at the semantic frame level. Instead of output-level majority voting, SFL-MTSC decomposes predictions into intent-specific frames, applies domain--intent grouping and slot-level clustering, and evaluates cluster reliability using path support scoring. Reliable frames are retained and re-integrated to form the final prediction. Zero-shot experiments on the MAC-SLU benchmark dataset show improved slot F1 and overall accuracy over single-path inference, while intent accuracy remains largely stable across most settings.

View on arXivView PDF

Code Implementations(1)

boyan1001/SFL-MTSCCommunity73%
MIT

[Interspeech'26] Official repository for "SFL-MTSC: Leveraging Semantic Frame-Level Multi-Task Self-Consistency for Robust Multi-Intent Spoken Language Understanding"

20Feb 26, 20264 months agoMIT
sluspoken-language-processingspoken-language-understanding

Cite this paper

@article{chen2026sflmtsc,
  title  = {SFL-MTSC: Leveraging Semantic Frame-Level Multi-Task Self-Consistency for Robust Multi-Intent Spoken Language Understanding},
  author = {Po-Yen Chen and Berlin Chen},
  year   = {2026},
  eprint = {2606.25552},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.25552v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2606.25552.svg)](https://codeofpaper.com/paper/2606.25552)

Discussion