{"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/semi-supervised-question-retrieval-with-gated","title":"Semi-supervised Question Retrieval with Gated Convolutions","arxiv_id":"1512.05726","date":"2015-12-17","proceeding":"NAACL 2016 6","authors":["Tao Lei","Hrishikesh Joshi","Regina Barzilay","Tommi Jaakkola","Katerina Tymoshenko","Alessandro Moschitti","Lluis Marquez"],"abstract":"Question answering forums are rapidly growing in size with no effective\nautomated ability to refer to and reuse answers already available for previous\nposted questions. In this paper, we develop a methodology for finding\nsemantically related questions. The task is difficult since 1) key pieces of\ninformation are often buried in extraneous details in the question body and 2)\navailable annotations on similar questions are scarce and fragmented. We design\na recurrent and convolutional model (gated convolution) to effectively map\nquestions to their semantic representations. The models are pre-trained within\nan encoder-decoder framework (from body to title) on the basis of the entire\nraw corpus, and fine-tuned discriminatively from limited annotations. Our\nevaluation demonstrates that our model yields substantial gains over a standard\nIR baseline and various neural network architectures (including CNNs, LSTMs and\nGRUs).","url_abs":"http://arxiv.org/abs/1512.05726v2","url_pdf":"http://arxiv.org/pdf/1512.05726v2.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":"semi-supervised-question-retrieval-with-gated","repo_url":"https://github.com/taolei87/rcnn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"question-answering","task_name":"Question Answering"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1512.05726","atlas_url":"https://app.syntology.ai/?focus=1512.05726","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":"1512.05726"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1512.05726\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1512.05726"},"call":"get_concepts_for_paper(arxiv_id=\"1512.05726\")"}],"by_repo":[{"repo":"taolei87/rcnn","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1606.04155"],"harvested_for_calls":[{"arxiv_id":"1606.04155","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1606.04155"},"call":"get_harvested_code_for_paper(arxiv_id=\"1606.04155\")"}]}],"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":"c8d3ca1b76bae9e69bfa790be81c84e4fffc03621e65dc5378f3161dbd1a980b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}