{"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-novel-bi-directional-interrelated-model-for","title":"A Novel Bi-directional Interrelated Model for Joint Intent Detection and Slot Filling","arxiv_id":"1907.00390","date":"2019-06-30","proceeding":"ACL 2019 7","authors":["Haihong E","Peiqing Niu","Zhongfu Chen","Meina Song"],"abstract":"A spoken language understanding (SLU) system includes two main tasks, slot filling (SF) and intent detection (ID). The joint model for the two tasks is becoming a tendency in SLU. But the bi-directional interrelated connections between the intent and slots are not established in the existing joint models. In this paper, we propose a novel bi-directional interrelated model for joint intent detection and slot filling. We introduce an SF-ID network to establish direct connections for the two tasks to help them promote each other mutually. Besides, we design an entirely new iteration mechanism inside the SF-ID network to enhance the bi-directional interrelated connections. The experimental results show that the relative improvement in the sentence-level semantic frame accuracy of our model is 3.79% and 5.42% on ATIS and Snips datasets, respectively, compared to the state-of-the-art model.","url_abs":"https://arxiv.org/abs/1907.00390v1","url_pdf":"https://arxiv.org/pdf/1907.00390v1.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-novel-bi-directional-interrelated-model-for","repo_url":"https://github.com/ZephyrChenzf/SF-ID-Network-For-NLU","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"a-novel-bi-directional-interrelated-model-for","repo_url":"https://github.com/Polly42Rose/SiriusIntentPredictionSlotFilling","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"intent-detection","task_name":"Intent Detection"},{"task_slug":"sentence","task_name":"Sentence"},{"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":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/intent-detection-on-atis","task":"Intent Detection","dataset":"ATIS","model":"SF-ID","rank_in_archive_order":7,"of":16,"metrics":{"Accuracy":"97.76"},"uses_additional_data":false},{"leaderboard":"/sota/intent-detection-on-atis","task":"Intent Detection","dataset":"ATIS","model":"SF-ID (BLSTM) network","rank_in_archive_order":8,"of":16,"metrics":{"Accuracy":"97.76"},"uses_additional_data":false},{"leaderboard":"/sota/intent-detection-on-snips","task":"Intent Detection","dataset":"SNIPS","model":"SF-ID","rank_in_archive_order":7,"of":10,"metrics":{"Accuracy":"97.43"},"uses_additional_data":false},{"leaderboard":"/sota/intent-detection-on-snips","task":"Intent Detection","dataset":"SNIPS","model":"SF-ID (BLSTM) network","rank_in_archive_order":8,"of":10,"metrics":{"Accuracy":"97.43"},"uses_additional_data":false},{"leaderboard":"/sota/slot-filling-on-atis","task":"Slot Filling","dataset":"ATIS","model":"SF-ID","rank_in_archive_order":9,"of":14,"metrics":{"F1":"0.958"},"uses_additional_data":false},{"leaderboard":"/sota/slot-filling-on-snips","task":"Slot Filling","dataset":"SNIPS","model":"SF-ID","rank_in_archive_order":7,"of":10,"metrics":{"F1":"92.23"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1907.00390","atlas_url":"https://app.syntology.ai/?focus=1907.00390","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":"1907.00390"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1907.00390\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1907.00390"},"call":"get_concepts_for_paper(arxiv_id=\"1907.00390\")"}],"by_repo":[{"repo":"ZephyrChenzf/SF-ID-Network-For-NLU","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Polly42Rose/SiriusIntentPredictionSlotFilling","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1902.10909"],"harvested_for_calls":[{"arxiv_id":"1902.10909","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1902.10909"},"call":"get_harvested_code_for_paper(arxiv_id=\"1902.10909\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"dbf9836034ae23f336140402442f575e6198a489b7d09ec9f2f90fa0bce0cc81","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}