{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-transformer-based-threshold-free-framework-1","title":"A Transformer-based Threshold-Free Framework for Multi-Intent NLU","arxiv_id":null,"date":"2022-10-01","proceeding":"COLING 2022 10","authors":["Lisung Chen","Nuo Chen","Yuexian Zou","Yong Wang","Xinzhong Sun"],"abstract":"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.","url_abs":"https://aclanthology.org/2022.coling-1.629","url_pdf":"https://aclanthology.org/2022.coling-1.629.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"intent-detection","task_name":"Intent Detection"},{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"},{"task_slug":"natural-language-understanding","task_name":"Natural Language Understanding"},{"task_slug":"semantic-frame-parsing","task_name":"Semantic Frame Parsing"},{"task_slug":"slot-filling","task_name":"Slot Filling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/intent-detection-on-mixatis","task":"Intent Detection","dataset":"MixATIS","model":"TFMN","rank_in_archive_order":6,"of":15,"metrics":{"Accuracy":"79.8"},"uses_additional_data":false},{"leaderboard":"/sota/intent-detection-on-mixsnips","task":"Intent Detection","dataset":"MixSNIPS","model":"TFMN","rank_in_archive_order":4,"of":16,"metrics":{"Accuracy":"97.7"},"uses_additional_data":false},{"leaderboard":"/sota/slot-filling-on-mixatis","task":"Slot Filling","dataset":"MixATIS","model":"TFMN","rank_in_archive_order":12,"of":15,"metrics":{"Micro F1":"88.0"},"uses_additional_data":false},{"leaderboard":"/sota/slot-filling-on-mixsnips","task":"Slot Filling","dataset":"MixSNIPS","model":"TFMN","rank_in_archive_order":5,"of":16,"metrics":{"Micro F1":"96.4"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e276b3c9509301b8c73bc9ebdba1864fef3fe2cd71d5bda7075ddc13d1e178d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}