{"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/pair2vec-compositional-word-pair-embeddings","title":"pair2vec: Compositional Word-Pair Embeddings for Cross-Sentence Inference","arxiv_id":"1810.08854","date":"2018-10-20","proceeding":"NAACL 2019 6","authors":["Mandar Joshi","Eunsol Choi","Omer Levy","Daniel S. Weld","Luke Zettlemoyer"],"abstract":"Reasoning about implied relationships (e.g., paraphrastic, common sense,\nencyclopedic) between pairs of words is crucial for many cross-sentence\ninference problems. This paper proposes new methods for learning and using\nembeddings of word pairs that implicitly represent background knowledge about\nsuch relationships. Our pairwise embeddings are computed as a compositional\nfunction on word representations, which is learned by maximizing the pointwise\nmutual information (PMI) with the contexts in which the two words co-occur. We\nadd these representations to the cross-sentence attention layer of existing\ninference models (e.g. BiDAF for QA, ESIM for NLI), instead of extending or\nreplacing existing word embeddings. Experiments show a gain of 2.7% on the\nrecently released SQuAD2.0 and 1.3% on MultiNLI. Our representations also aid\nin better generalization with gains of around 6-7% on adversarial SQuAD\ndatasets, and 8.8% on the adversarial entailment test set by Glockner et al.\n(2018).","url_abs":"http://arxiv.org/abs/1810.08854v2","url_pdf":"http://arxiv.org/pdf/1810.08854v2.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":"pair2vec-compositional-word-pair-embeddings","repo_url":"https://github.com/mandarjoshi90/pair2vec","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"pair2vec-compositional-word-pair-embeddings","repo_url":"https://github.com/asahi417/relbert","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"pair2vec-compositional-word-pair-embeddings","repo_url":"https://github.com/ghlee0304/NLP-with-tensorflow-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"common-sense-reasoning","task_name":"Common Sense Reasoning"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"}],"methods":[{"method_slug":"esim","method_name":"ESIM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.08854","atlas_url":"https://app.syntology.ai/?focus=1810.08854","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":"1810.08854"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.08854\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.08854"},"call":"get_concepts_for_paper(arxiv_id=\"1810.08854\")"}],"by_repo":[{"repo":"mandarjoshi90/pair2vec","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"asahi417/relbert","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2005.14165"],"harvested_for_calls":[{"arxiv_id":"2005.14165","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2005.14165"},"call":"get_harvested_code_for_paper(arxiv_id=\"2005.14165\")"}]},{"repo":"ghlee0304/NLP-with-tensorflow-pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1301.3781","1310.4546"],"harvested_for_calls":[{"arxiv_id":"1301.3781","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1301.3781"},"call":"get_harvested_code_for_paper(arxiv_id=\"1301.3781\")"},{"arxiv_id":"1310.4546","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1310.4546"},"call":"get_harvested_code_for_paper(arxiv_id=\"1310.4546\")"}]}],"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":"3febb733944f35a48b223abb5a35d2b183776e2e3aa15aad6c9448dbd5a8ce34","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}