{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/load-trees","entry":"load_trees","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":7,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":5},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2509.20734","paper":"/paper/arxiv-2509-20734","title":"Probability Distribution Collapse: A Critical Bottleneck to Compact Unsupervised Neural Grammar Induction","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"GIST-IRR/CRNP","path":"utils.py","file_url":"https://github.com/GIST-IRR/CRNP/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d258d00327fa6982","mcp_get_code":{"code_sha256":"d258d00327fa6982"}},{"arxiv_id":"1907.02684","paper":"/paper/head-driven-phrase-structure-grammar-parsing","title":"Head-Driven Phrase Structure Grammar Parsing on Penn Treebank","date":"2019-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DoodleJZ/HPSG-Neural-Parser","path":"src_division/trees.py","file_url":"https://github.com/DoodleJZ/HPSG-Neural-Parser/blob/HEAD/src_division/trees.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d32f40efd7da15c3","mcp_get_code":{"code_sha256":"d32f40efd7da15c3"}},{"arxiv_id":"1805.01052","paper":"/paper/constituency-parsing-with-a-self-attentive","title":"Constituency Parsing with a Self-Attentive Encoder","date":"2018-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringos/nfc-parser","path":"src/analysis/trees.py","file_url":"https://github.com/ringos/nfc-parser/blob/HEAD/src/analysis/trees.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79f8c62f9471a066","mcp_get_code":{"code_sha256":"79f8c62f9471a066"}},{"arxiv_id":"1804.07853","paper":"/paper/whats-going-on-in-neural-constituency-parsers","title":"What's Going On in Neural Constituency Parsers? An Analysis","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dgaddy/parser-analysis","path":"src/trees.py","file_url":"https://github.com/dgaddy/parser-analysis/blob/HEAD/src/trees.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"08496ab8d64a4e5e","mcp_get_code":{"code_sha256":"08496ab8d64a4e5e"}},{"arxiv_id":"1702.02181","paper":"/paper/deep-learning-with-dynamic-computation-graphs","title":"Deep Learning with Dynamic Computation Graphs","date":"2017-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorflow/fold","path":"tensorflow_fold/blocks/examples/sentiment/sentiment.py","file_url":"https://github.com/tensorflow/fold/blob/HEAD/tensorflow_fold/blocks/examples/sentiment/sentiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"137e0ba52672b4b6","mcp_get_code":{"code_sha256":"137e0ba52672b4b6"}},{"arxiv_id":"1503.00075","paper":"/paper/improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","date":"2015-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vivswan/Sentiment-Analysis-TreeLSTM","path":"scripts/preprocess-sst.py","file_url":"https://github.com/Vivswan/Sentiment-Analysis-TreeLSTM/blob/HEAD/scripts/preprocess-sst.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"8817e369ca9baf24","mcp_get_code":{"code_sha256":"8817e369ca9baf24"}},{"arxiv_id":"2021.acl-long.205","paper":null,"title":"arXiv:2021.acl-long.205","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NP-NET-research/Recursive-Semi-Markov-Model","path":"src_cn/trees.py","file_url":"https://github.com/NP-NET-research/Recursive-Semi-Markov-Model/blob/HEAD/src_cn/trees.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5aa11900408131f7","mcp_get_code":{"code_sha256":"5aa11900408131f7"}}]}