{"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-hierarchical-decoding-model-for-spoken","title":"A Hierarchical Decoding Model For Spoken Language Understanding From Unaligned Data","arxiv_id":"1904.04498","date":"2019-04-09","proceeding":null,"authors":["Zijian Zhao","Su Zhu","Kai Yu"],"abstract":"Spoken language understanding (SLU) systems can be trained on two types of\nlabelled data: aligned or unaligned. Unaligned data do not require word by word\nannotation and is easier to be obtained. In the paper, we focus on spoken\nlanguage understanding from unaligned data whose annotation is a set of\nact-slot-value triples. Previous works usually focus on improve slot-value pair\nprediction and estimate dialogue act types separately, which ignores the\nhierarchical structure of the act-slot-value triples. Here, we propose a novel\nhierarchical decoding model which dynamically parses act, slot and value in a\nstructured way and employs pointer network to handle out-of-vocabulary (OOV)\nvalues. Experiments on DSTC2 dataset, a benchmark unaligned dataset, show that\nthe proposed model not only outperforms previous state-of-the-art model, but\nalso can be generalized effectively and efficiently to unseen act-slot type\npairs and OOV values.","url_abs":"http://arxiv.org/abs/1904.04498v1","url_pdf":"http://arxiv.org/pdf/1904.04498v1.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-hierarchical-decoding-model-for-spoken","repo_url":"https://github.com/simplc/WCN-BERT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"spoken-language-understanding","task_name":"Spoken Language Understanding"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"pointer-net","method_name":"Pointer Network"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.04498","atlas_url":"https://app.syntology.ai/?focus=1904.04498","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":"1904.04498"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.04498\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.04498"},"call":"get_concepts_for_paper(arxiv_id=\"1904.04498\")"}],"by_repo":[{"repo":"simplc/WCN-BERT","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":"87f74dd04ae9233cd516ca81000d4c6bec4fa39276d67dd89ac2f2bebc04e519","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}