{"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/learning-to-rank-question-answer-pairs-using","title":"Learning to Rank Question-Answer Pairs using Hierarchical Recurrent Encoder with Latent Topic Clustering","arxiv_id":"1710.03430","date":"2017-10-10","proceeding":"NAACL 2018 6","authors":["Seunghyun Yoon","Joongbo Shin","Kyomin Jung"],"abstract":"In this paper, we propose a novel end-to-end neural architecture for ranking\ncandidate answers, that adapts a hierarchical recurrent neural network and a\nlatent topic clustering module. With our proposed model, a text is encoded to a\nvector representation from an word-level to a chunk-level to effectively\ncapture the entire meaning. In particular, by adapting the hierarchical\nstructure, our model shows very small performance degradations in longer text\ncomprehension while other state-of-the-art recurrent neural network models\nsuffer from it. Additionally, the latent topic clustering module extracts\nsemantic information from target samples. This clustering module is useful for\nany text related tasks by allowing each data sample to find its nearest topic\ncluster, thus helping the neural network model analyze the entire data. We\nevaluate our models on the Ubuntu Dialogue Corpus and consumer electronic\ndomain question answering dataset, which is related to Samsung products. The\nproposed model shows state-of-the-art results for ranking question-answer\npairs.","url_abs":"http://arxiv.org/abs/1710.03430v3","url_pdf":"http://arxiv.org/pdf/1710.03430v3.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":"learning-to-rank-question-answer-pairs-using","repo_url":"https://github.com/david-yoon/QA_HRDE_LTC","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-rank-question-answer-pairs-using","repo_url":"https://github.com/aus10powell/Automated-Health-Responses","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-rank-question-answer-pairs-using","repo_url":"https://github.com/younggns/comparative-abusive-lang","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"answer-selection","task_name":"Answer Selection"},{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"},{"task_slug":"question-answering","task_name":"Question Answering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/answer-selection-on-ubuntu-dialogue-v1","task":"Answer Selection","dataset":"Ubuntu Dialogue (v1, Ranking)","model":"HRDE-LTC","rank_in_archive_order":1,"of":1,"metrics":{"1 in 10 R@1":"0.684","1 in 10 R@2":"0.822","1 in 10 R@5":"0.960","1 in 2 R@1":"0.916"},"uses_additional_data":false},{"leaderboard":"/sota/answer-selection-on-ubuntu-dialogue-v2","task":"Answer Selection","dataset":"Ubuntu Dialogue (v2, Ranking)","model":"HRDE-LTC","rank_in_archive_order":2,"of":2,"metrics":{"1 in 10 R@1":"0.652","1 in 10 R@2":"0.815","1 in 10 R@5":"0.966","1 in 2 R@1":"0.915"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1710.03430","atlas_url":"https://app.syntology.ai/?focus=1710.03430","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":"1710.03430"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1710.03430\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1710.03430"},"call":"get_concepts_for_paper(arxiv_id=\"1710.03430\")"}],"by_repo":[{"repo":"david-yoon/QA_HRDE_LTC","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"aus10powell/Automated-Health-Responses","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"younggns/comparative-abusive-lang","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":"c297d53b2b15b834e21d8bdbfad3f5900a3757369c3f4b58ad0af5dde3289ccd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}