{"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/interactive-semantic-parsing-for-if-then","title":"Interactive Semantic Parsing for If-Then Recipes via Hierarchical Reinforcement Learning","arxiv_id":"1808.06740","date":"2018-08-21","proceeding":null,"authors":["Ziyu Yao","Xiujun Li","Jianfeng Gao","Brian Sadler","Huan Sun"],"abstract":"Given a text description, most existing semantic parsers synthesize a program\nin one shot. However, it is quite challenging to produce a correct program\nsolely based on the description, which in reality is often ambiguous or\nincomplete. In this paper, we investigate interactive semantic parsing, where\nthe agent can ask the user clarification questions to resolve ambiguities via a\nmulti-turn dialogue, on an important type of programs called \"If-Then recipes.\"\nWe develop a hierarchical reinforcement learning (HRL) based agent that\nsignificantly improves the parsing performance with minimal questions to the\nuser. Results under both simulation and human evaluation show that our agent\nsubstantially outperforms non-interactive semantic parsers and rule-based\nagents.","url_abs":"http://arxiv.org/abs/1808.06740v2","url_pdf":"http://arxiv.org/pdf/1808.06740v2.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":"interactive-semantic-parsing-for-if-then","repo_url":"https://github.com/LittleYUYU/Interactive-Semantic-Parsing","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"hierarchical-reinforcement-learning","task_name":"Hierarchical Reinforcement Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"semantic-parsing","task_name":"Semantic Parsing"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.06740","atlas_url":"https://app.syntology.ai/?focus=1808.06740","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":"1808.06740"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.06740\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.06740"},"call":"get_concepts_for_paper(arxiv_id=\"1808.06740\")"}],"by_repo":[{"repo":"LittleYUYU/Interactive-Semantic-Parsing","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1910.05389"],"harvested_for_calls":[{"arxiv_id":"1910.05389","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.05389"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.05389\")"}]}],"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":"765faefa08f38a1163e8fd91f97449153a918962c2de73c5ec6e46b88b184ea6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}