{"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/the-lifted-matrix-space-model-for-semantic","title":"The Lifted Matrix-Space Model for Semantic Composition","arxiv_id":"1711.03602","date":"2017-11-09","proceeding":"CONLL 2018 10","authors":["WooJin Chung","Sheng-Fu Wang","Samuel R. Bowman"],"abstract":"Tree-structured neural network architectures for sentence encoding draw\ninspiration from the approach to semantic composition generally seen in formal\nlinguistics, and have shown empirical improvements over comparable sequence\nmodels by doing so. Moreover, adding multiplicative interaction terms to the\ncomposition functions in these models can yield significant further\nimprovements. However, existing compositional approaches that adopt such a\npowerful composition function scale poorly, with parameter counts exploding as\nmodel dimension or vocabulary size grows. We introduce the Lifted Matrix-Space\nmodel, which uses a global transformation to map vector word embeddings to\nmatrices, which can then be composed via an operation based on matrix-matrix\nmultiplication. Its composition function effectively transmits a larger number\nof activations across layers with relatively few model parameters. We evaluate\nour model on the Stanford NLI corpus, the Multi-Genre NLI corpus, and the\nStanford Sentiment Treebank and find that it consistently outperforms TreeLSTM\n(Tai et al., 2015), the previous best known composition function for\ntree-structured models.","url_abs":"http://arxiv.org/abs/1711.03602v2","url_pdf":"http://arxiv.org/pdf/1711.03602v2.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":"the-lifted-matrix-space-model-for-semantic","repo_url":"https://github.com/NYU-MLL/spinn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"the-lifted-matrix-space-model-for-semantic","repo_url":"https://github.com/woojinchung/lms","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"semantic-composition","task_name":"Semantic Composition"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"NYU-MLL/spinn","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1603.06021"],"harvested_for_calls":[{"arxiv_id":"1603.06021","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1603.06021"},"call":"get_harvested_code_for_paper(arxiv_id=\"1603.06021\")"}]},{"repo":"woojinchung/lms","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"7b2209a99c276f1edfafa85632eefdfa6732d1a542470a431c4b3ef817070aca","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}