{"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-conllu","entry":"load_conllu","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":5,"n_papers_ran":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":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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","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,"code_sha256_prefix":"6f11534db6a06f8e","mcp_get_code":{"code_sha256":"6f11534db6a06f8e"}},{"arxiv_id":"1904.02099","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,"code_sha256_prefix":"7db5fbed47b0c09d","mcp_get_code":{"code_sha256":"7db5fbed47b0c09d"}},{"arxiv_id":"1603.04351","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,"code_sha256_prefix":"6f11534db6a06f8e","mcp_get_code":{"code_sha256":"6f11534db6a06f8e"}},{"arxiv_id":"1603.04351","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,"code_sha256_prefix":"6d71b42e4dacd50b","mcp_get_code":{"code_sha256":"6d71b42e4dacd50b"}},{"arxiv_id":"1505.08075","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,"code_sha256_prefix":"6f11534db6a06f8e","mcp_get_code":{"code_sha256":"6f11534db6a06f8e"}},{"arxiv_id":"1505.08075","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,"code_sha256_prefix":"6d71b42e4dacd50b","mcp_get_code":{"code_sha256":"6d71b42e4dacd50b"}},{"arxiv_id":"1505.08075","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,"code_sha256_prefix":"898a8ab6ccbb4763","mcp_get_code":{"code_sha256":"898a8ab6ccbb4763"}},{"arxiv_id":"2023.acl-demo.52","paper":null,"title":"arXiv: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,"code_sha256_prefix":"c2ddc1335fe51654","mcp_get_code":{"code_sha256":"c2ddc1335fe51654"}},{"arxiv_id":"2023.acl-demo.52","paper":null,"title":"arXiv: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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2c2a1db10b9ea92a","mcp_get_code":{"code_sha256":"2c2a1db10b9ea92a"}}]}