{"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-stack-propagation-framework-with-token","title":"A Stack-Propagation Framework with Token-Level Intent Detection for Spoken Language Understanding","arxiv_id":"1909.02188","date":"2019-09-05","proceeding":"IJCNLP 2019 11","authors":["Libo Qin","Wanxiang Che","Yangming Li","Haoyang Wen","Ting Liu"],"abstract":"Intent detection and slot filling are two main tasks for building a spoken language understanding (SLU) system. The two tasks are closely tied and the slots often highly depend on the intent. In this paper, we propose a novel framework for SLU to better incorporate the intent information, which further guides the slot filling. In our framework, we adopt a joint model with Stack-Propagation which can directly use the intent information as input for slot filling, thus to capture the intent semantic knowledge. In addition, to further alleviate the error propagation, we perform the token-level intent detection for the Stack-Propagation framework. Experiments on two publicly datasets show that our model achieves the state-of-the-art performance and outperforms other previous methods by a large margin. Finally, we use the Bidirectional Encoder Representation from Transformer (BERT) model in our framework, which further boost our performance in SLU task.","url_abs":"https://arxiv.org/abs/1909.02188v1","url_pdf":"https://arxiv.org/pdf/1909.02188v1.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":[{"paper_slug":"a-stack-propagation-framework-with-token","repo_url":"https://github.com/LeePleased/StackPropagation-SLU","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"a-stack-propagation-framework-with-token","repo_url":"https://github.com/MetaronWang/StackPropagation-SLU-TF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"intent-detection","task_name":"Intent Detection"},{"task_slug":"slot-filling","task_name":"Slot Filling"},{"task_slug":"spoken-language-understanding","task_name":"Spoken Language Understanding"},{"task_slug":"slot-filling-1","task_name":"slot-filling"}],"methods":[{"method_slug":"absolute-position-encodings","method_name":"Absolute Position Encodings"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"label-smoothing","method_name":"Label Smoothing"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"position-wise-feed-forward-layer","method_name":"Position-Wise Feed-Forward Layer"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"transformer","method_name":"Transformer"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/intent-detection-on-atis","task":"Intent Detection","dataset":"ATIS","model":"Stack-Propagation (+BERT)","rank_in_archive_order":9,"of":16,"metrics":{"Accuracy":"97.50"},"uses_additional_data":false},{"leaderboard":"/sota/intent-detection-on-snips","task":"Intent Detection","dataset":"SNIPS","model":"Stack-Propagation (+BERT)","rank_in_archive_order":2,"of":10,"metrics":{"Accuracy":"99.0"},"uses_additional_data":false},{"leaderboard":"/sota/intent-detection-on-snips","task":"Intent Detection","dataset":"SNIPS","model":"Stack-Propagation","rank_in_archive_order":5,"of":10,"metrics":{"Accuracy":"98.00"},"uses_additional_data":false},{"leaderboard":"/sota/slot-filling-on-atis","task":"Slot Filling","dataset":"ATIS","model":"Stack-Propagation (+BERT)","rank_in_archive_order":5,"of":14,"metrics":{"F1":"0.9610"},"uses_additional_data":false},{"leaderboard":"/sota/slot-filling-on-snips","task":"Slot Filling","dataset":"SNIPS","model":"Stack-Propagation (+BERT)","rank_in_archive_order":3,"of":10,"metrics":{"F1":"97.00"},"uses_additional_data":false},{"leaderboard":"/sota/slot-filling-on-snips","task":"Slot Filling","dataset":"SNIPS","model":"Stack-Propagation","rank_in_archive_order":5,"of":10,"metrics":{"F1":"94.20"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1909.02188","atlas_url":"https://app.syntology.ai/?focus=1909.02188","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1909.02188"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1909.02188\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1909.02188"},"call":"get_concepts_for_paper(arxiv_id=\"1909.02188\")"}],"by_repo":[{"repo":"LeePleased/StackPropagation-SLU","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MetaronWang/StackPropagation-SLU-TF","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"64e3e15733536e5408842aea9593f057d953e22ea38468ee6dcbbf4c04c3d3a7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}