{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LKQNE6CG2ZAV754UWPL3MXGCBO","short_pith_number":"pith:LKQNE6CG","schema_version":"1.0","canonical_sha256":"5aa0d27846d6415ff794b3d7b65cc20b8792bb7ba82195ebf47dbdb1fb1cd18d","source":{"kind":"arxiv","id":"1701.03163","version":1},"attestation_state":"computed","paper":{"title":"Parsing Universal Dependencies without training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Anders S{\\o}gaard, Barbara Plank, H\\'ector Mart\\'inez Alonso, \\v{Z}eljko Agi\\'c","submitted_at":"2017-01-11T20:56:29Z","abstract_excerpt":"We propose UDP, the first training-free parser for Universal Dependencies (UD). Our algorithm is based on PageRank and a small set of head attachment rules. It features two-step decoding to guarantee that function words are attached as leaf nodes. The parser requires no training, and it is competitive with a delexicalized transfer system. UDP offers a linguistically sound unsupervised alternative to cross-lingual parsing for UD, which can be used as a baseline for such systems. The parser has very few parameters and is distinctly robust to domain change across languages."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.03163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-01-11T20:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"cb750e4afd634f1aab6e66a5d650232edc0f782035b521f0f6b67146972d575f","abstract_canon_sha256":"357882b47d4900502457c2780627f0cea8be9bef1a40e1e43fbd180cd698ab1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:59.160185Z","signature_b64":"Yv4FUjoAHQ3AXMHBr8qCHFncEqbgmn0udHTUROGtUfPXPEVCrxbk9coSzx1wawCuIiERrcJMtTyTtzC/hWuKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa0d27846d6415ff794b3d7b65cc20b8792bb7ba82195ebf47dbdb1fb1cd18d","last_reissued_at":"2026-05-18T00:52:59.159642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:59.159642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parsing Universal Dependencies without training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Anders S{\\o}gaard, Barbara Plank, H\\'ector Mart\\'inez Alonso, \\v{Z}eljko Agi\\'c","submitted_at":"2017-01-11T20:56:29Z","abstract_excerpt":"We propose UDP, the first training-free parser for Universal Dependencies (UD). Our algorithm is based on PageRank and a small set of head attachment rules. It features two-step decoding to guarantee that function words are attached as leaf nodes. The parser requires no training, and it is competitive with a delexicalized transfer system. UDP offers a linguistically sound unsupervised alternative to cross-lingual parsing for UD, which can be used as a baseline for such systems. The parser has very few parameters and is distinctly robust to domain change across languages."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03163","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.03163","created_at":"2026-05-18T00:52:59.159722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03163v1","created_at":"2026-05-18T00:52:59.159722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03163","created_at":"2026-05-18T00:52:59.159722+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKQNE6CG2ZAV","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKQNE6CG2ZAV754U","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKQNE6CG","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LKQNE6CG2ZAV754UWPL3MXGCBO","json":"https://pith.science/pith/LKQNE6CG2ZAV754UWPL3MXGCBO.json","graph_json":"https://pith.science/api/pith-number/LKQNE6CG2ZAV754UWPL3MXGCBO/graph.json","events_json":"https://pith.science/api/pith-number/LKQNE6CG2ZAV754UWPL3MXGCBO/events.json","paper":"https://pith.science/paper/LKQNE6CG"},"agent_actions":{"view_html":"https://pith.science/pith/LKQNE6CG2ZAV754UWPL3MXGCBO","download_json":"https://pith.science/pith/LKQNE6CG2ZAV754UWPL3MXGCBO.json","view_paper":"https://pith.science/paper/LKQNE6CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03163&json=true","fetch_graph":"https://pith.science/api/pith-number/LKQNE6CG2ZAV754UWPL3MXGCBO/graph.json","fetch_events":"https://pith.science/api/pith-number/LKQNE6CG2ZAV754UWPL3MXGCBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKQNE6CG2ZAV754UWPL3MXGCBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKQNE6CG2ZAV754UWPL3MXGCBO/action/storage_attestation","attest_author":"https://pith.science/pith/LKQNE6CG2ZAV754UWPL3MXGCBO/action/author_attestation","sign_citation":"https://pith.science/pith/LKQNE6CG2ZAV754UWPL3MXGCBO/action/citation_signature","submit_replication":"https://pith.science/pith/LKQNE6CG2ZAV754UWPL3MXGCBO/action/replication_record"}},"created_at":"2026-05-18T00:52:59.159722+00:00","updated_at":"2026-05-18T00:52:59.159722+00:00"}