{"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":"/code/load-conllu","entry":"load_conllu","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":0,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2002.01685","arxiv_id_is_arxiv":true,"paper":"/paper/parsing-as-pretraining","title":"Parsing as Pretraining","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aghie/parsing-as-pretraining","path":"dep2labels/conll17_ud_eval.py","file_url":"https://github.com/aghie/parsing-as-pretraining/blob/HEAD/dep2labels/conll17_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f11534db6a06f8e","code_sha256_prefix":"6f11534db6a06f8e","mcp_get_code":{"code_sha256":"6f11534db6a06f8e"}},{"arxiv_id":"1904.02099","arxiv_id_is_arxiv":true,"paper":"/paper/75-languages-1-model-parsing-universal","title":"75 Languages, 1 Model: Parsing Universal Dependencies Universally","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyperparticle/udify","path":"udify/dataset_readers/conll18_ud_eval.py","file_url":"https://github.com/hyperparticle/udify/blob/HEAD/udify/dataset_readers/conll18_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7db5fbed47b0c09d","code_sha256_prefix":"7db5fbed47b0c09d","mcp_get_code":{"code_sha256":"7db5fbed47b0c09d"}},{"arxiv_id":"1603.04351","arxiv_id_is_arxiv":true,"paper":"/paper/simple-and-accurate-dependency-parsing-using","title":"Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations","date":"2016-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elikip/bist-parser","path":"bmstparser/src/utils/evaluation_script/conll17_ud_eval.py","file_url":"https://github.com/elikip/bist-parser/blob/HEAD/bmstparser/src/utils/evaluation_script/conll17_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f11534db6a06f8e","code_sha256_prefix":"6f11534db6a06f8e","mcp_get_code":{"code_sha256":"6f11534db6a06f8e"}},{"arxiv_id":"1603.04351","arxiv_id_is_arxiv":true,"paper":"/paper/simple-and-accurate-dependency-parsing-using","title":"Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations","date":"2016-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elikip/bist-parser","path":"barchybrid/src/utils/evaluation_script/conll17_ud_eval.py","file_url":"https://github.com/elikip/bist-parser/blob/HEAD/barchybrid/src/utils/evaluation_script/conll17_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6d71b42e4dacd50b","code_sha256_prefix":"6d71b42e4dacd50b","mcp_get_code":{"code_sha256":"6d71b42e4dacd50b"}},{"arxiv_id":"1505.08075","arxiv_id_is_arxiv":true,"paper":"/paper/transition-based-dependency-parsing-with-2","title":"Transition-Based Dependency Parsing with Stack Long Short-Term Memory","date":"2015-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yusics/bist-parser","path":"bmstparser/src/utils/evaluation_script/conll17_ud_eval.py","file_url":"https://github.com/Yusics/bist-parser/blob/HEAD/bmstparser/src/utils/evaluation_script/conll17_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f11534db6a06f8e","code_sha256_prefix":"6f11534db6a06f8e","mcp_get_code":{"code_sha256":"6f11534db6a06f8e"}},{"arxiv_id":"1505.08075","arxiv_id_is_arxiv":true,"paper":"/paper/transition-based-dependency-parsing-with-2","title":"Transition-Based Dependency Parsing with Stack Long Short-Term Memory","date":"2015-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yusics/bist-parser","path":"barchybrid/src/utils/evaluation_script/conll17_ud_eval.py","file_url":"https://github.com/Yusics/bist-parser/blob/HEAD/barchybrid/src/utils/evaluation_script/conll17_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6d71b42e4dacd50b","code_sha256_prefix":"6d71b42e4dacd50b","mcp_get_code":{"code_sha256":"6d71b42e4dacd50b"}},{"arxiv_id":"1505.08075","arxiv_id_is_arxiv":true,"paper":"/paper/transition-based-dependency-parsing-with-2","title":"Transition-Based Dependency Parsing with Stack Long Short-Term Memory","date":"2015-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mstrise/dep2label","path":"dep2label/eval_dep/conll18_ud_eval.py","file_url":"https://github.com/mstrise/dep2label/blob/HEAD/dep2label/eval_dep/conll18_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"898a8ab6ccbb4763","code_sha256_prefix":"898a8ab6ccbb4763","mcp_get_code":{"code_sha256":"898a8ab6ccbb4763"}},{"arxiv_id":"2023.acl-demo.52","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-demo.52","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"megagonlabs/ginza","path":"ginza_util/evaluate_conllu.py","file_url":"https://github.com/megagonlabs/ginza/blob/HEAD/ginza_util/evaluate_conllu.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c2a1db10b9ea92a","code_sha256_prefix":"2c2a1db10b9ea92a","mcp_get_code":{"code_sha256":"2c2a1db10b9ea92a"}},{"arxiv_id":"2023.acl-demo.52","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-demo.52","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ku-nlp/kwja","path":"src/kwja/metrics/conll18_ud_eval.py","file_url":"https://github.com/ku-nlp/kwja/blob/HEAD/src/kwja/metrics/conll18_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2ddc1335fe51654","code_sha256_prefix":"c2ddc1335fe51654","mcp_get_code":{"code_sha256":"c2ddc1335fe51654"}}],"record_sha256":"4770ba14d35424e32b38ddb356256ede8b91ee35d8772f125ec01865edf4850d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}