{"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/nine-features-in-a-random-forest-to-learn","title":"Nine Features in a Random Forest to Learn Taxonomical Semantic Relations","arxiv_id":"1603.08702","date":"2016-03-29","proceeding":"LREC 2016 5","authors":["Enrico Santus","Alessandro Lenci","Tin-Shing Chiu","Qin Lu","Chu-Ren Huang"],"abstract":"ROOT9 is a supervised system for the classification of hypernyms, co-hyponyms\nand random words that is derived from the already introduced ROOT13 (Santus et\nal., 2016). It relies on a Random Forest algorithm and nine unsupervised\ncorpus-based features. We evaluate it with a 10-fold cross validation on 9,600\npairs, equally distributed among the three classes and involving several\nParts-Of-Speech (i.e. adjectives, nouns and verbs). When all the classes are\npresent, ROOT9 achieves an F1 score of 90.7%, against a baseline of 57.2%\n(vector cosine). When the classification is binary, ROOT9 achieves the\nfollowing results against the baseline: hypernyms-co-hyponyms 95.7% vs. 69.8%,\nhypernyms-random 91.8% vs. 64.1% and co-hyponyms-random 97.8% vs. 79.4%. In\norder to compare the performance with the state-of-the-art, we have also\nevaluated ROOT9 in subsets of the Weeds et al. (2014) datasets, proving that it\nis in fact competitive. Finally, we investigated whether the system learns the\nsemantic relation or it simply learns the prototypical hypernyms, as claimed by\nLevy et al. (2015). The second possibility seems to be the most likely, even\nthough ROOT9 can be trained on negative examples (i.e., switched hypernyms) to\ndrastically reduce this bias.","url_abs":"http://arxiv.org/abs/1603.08702v1","url_pdf":"http://arxiv.org/pdf/1603.08702v1.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":"nine-features-in-a-random-forest-to-learn","repo_url":"https://github.com/esantus/ROOT9","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1603.08702","atlas_url":"https://app.syntology.ai/?focus=1603.08702","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":"1603.08702"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1603.08702\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1603.08702"},"call":"get_concepts_for_paper(arxiv_id=\"1603.08702\")"}],"by_repo":[{"repo":"esantus/ROOT9","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":"67caa931ba5bf1d976ee309669e575a78ed4ec222e506c391f989a49ac546b59","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}