{"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/dis-s2v-discourse-informed-sen2vec","title":"Dis-S2V: Discourse Informed Sen2Vec","arxiv_id":"1610.08078","date":"2016-10-25","proceeding":null,"authors":["Tanay Kumar Saha","Shafiq Joty","Naeemul Hassan","Mohammad Al Hasan"],"abstract":"Vector representation of sentences is important for many text processing\ntasks that involve clustering, classifying, or ranking sentences. Recently,\ndistributed representation of sentences learned by neural models from unlabeled\ndata has been shown to outperform the traditional bag-of-words representation.\nHowever, most of these learning methods consider only the content of a sentence\nand disregard the relations among sentences in a discourse by and large.\n  In this paper, we propose a series of novel models for learning latent\nrepresentations of sentences (Sen2Vec) that consider the content of a sentence\nas well as inter-sentence relations. We first represent the inter-sentence\nrelations with a language network and then use the network to induce contextual\ninformation into the content-based Sen2Vec models. Two different approaches are\nintroduced to exploit the information in the network. Our first approach\nretrofits (already trained) Sen2Vec vectors with respect to the network in two\ndifferent ways: (1) using the adjacency relations of a node, and (2) using a\nstochastic sampling method which is more flexible in sampling neighbors of a\nnode. The second approach uses a regularizer to encode the information in the\nnetwork into the existing Sen2Vec model. Experimental results show that our\nproposed models outperform existing methods in three fundamental information\nsystem tasks demonstrating the effectiveness of our approach. The models\nleverage the computational power of multi-core CPUs to achieve fine-grained\ncomputational efficiency. We make our code publicly available upon acceptance.","url_abs":"http://arxiv.org/abs/1610.08078v1","url_pdf":"http://arxiv.org/pdf/1610.08078v1.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":"dis-s2v-discourse-informed-sen2vec","repo_url":"https://github.com/tksaha/con-s2v","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"sentence","task_name":"Sentence"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1610.08078","atlas_url":"https://app.syntology.ai/?focus=1610.08078","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":"1610.08078"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1610.08078\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1610.08078"},"call":"get_concepts_for_paper(arxiv_id=\"1610.08078\")"}],"by_repo":[{"repo":"tksaha/con-s2v","kind":"official","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":"02c1c040fc26546bb47b24556d5f0d2462821e60fee4598ff0cfc5ff695cae12","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}