{"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/ultradense-word-embeddings-by-orthogonal","title":"Ultradense Word Embeddings by Orthogonal Transformation","arxiv_id":"1602.07572","date":"2016-02-24","proceeding":"NAACL 2016 6","authors":["Sascha Rothe","Sebastian Ebert","Hinrich Schütze"],"abstract":"Embeddings are generic representations that are useful for many NLP tasks. In\nthis paper, we introduce DENSIFIER, a method that learns an orthogonal\ntransformation of the embedding space that focuses the information relevant for\na task in an ultradense subspace of a dimensionality that is smaller by a\nfactor of 100 than the original space. We show that ultradense embeddings\ngenerated by DENSIFIER reach state of the art on a lexicon creation task in\nwhich words are annotated with three types of lexical information - sentiment,\nconcreteness and frequency. On the SemEval2015 10B sentiment analysis task we\nshow that no information is lost when the ultradense subspace is used, but\ntraining is an order of magnitude more efficient due to the compactness of the\nultradense space.","url_abs":"http://arxiv.org/abs/1602.07572v2","url_pdf":"http://arxiv.org/pdf/1602.07572v2.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":"ultradense-word-embeddings-by-orthogonal","repo_url":"https://github.com/pdufter/densray","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"sentiment-analysis","task_name":"Sentiment Analysis"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.07572","atlas_url":"https://app.syntology.ai/?focus=1602.07572","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":"1602.07572"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.07572\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.07572"},"call":"get_concepts_for_paper(arxiv_id=\"1602.07572\")"}],"by_repo":[{"repo":"pdufter/densray","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1904.08654"],"harvested_for_calls":[{"arxiv_id":"1904.08654","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.08654"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.08654\")"}]}],"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":"82f8fae7695d17d494d98758816042be2d1bded2b81c7356fec429919d5e9f66","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}