{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4N3KTN4RJB2OLHPDO745GTQE63","short_pith_number":"pith:4N3KTN4R","schema_version":"1.0","canonical_sha256":"e376a9b7914874e59de377f9d34e04f6f0aff70d095d574938b1d89330cf786c","source":{"kind":"arxiv","id":"1806.10654","version":1},"attestation_state":"computed","paper":{"title":"Generalized chart constraints for efficient PCFG and TAG parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander Koller, Sophie Henning, Stefan Gr\\\"unewald","submitted_at":"2018-06-27T19:36:05Z","abstract_excerpt":"Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up chart parsers for PCFGs. We generalize chart constraints to more expressive grammar formalisms and describe a neural tagger which predicts chart constraints at very high precision. Our constraints accelerate both PCFG and TAG parsing, and combine effectively with other pruning techniques (coarse-to-fine and supertagging) for an overall speedup of two orders of magnitude, while improving accuracy."},"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":"1806.10654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-27T19:36:05Z","cross_cats_sorted":[],"title_canon_sha256":"6fa24a3340a48de275269da4162d60412e6ab5b38c868f5ae3c04dd95f910a3d","abstract_canon_sha256":"f03cb1c7d3c391ecc90b624edd4af3c59a5618a6825a1f3290fe6e00eea5e7df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:08.337080Z","signature_b64":"pMNOCRiGrZ4sNn8TEt91R9dmEzLPq8fgUuWdAwIsYfP/Hd9qwxwiEmrDH/LoqSP1beCsESTQOrNnrSJmJbbMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e376a9b7914874e59de377f9d34e04f6f0aff70d095d574938b1d89330cf786c","last_reissued_at":"2026-05-18T00:12:08.336432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:08.336432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized chart constraints for efficient PCFG and TAG parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander Koller, Sophie Henning, Stefan Gr\\\"unewald","submitted_at":"2018-06-27T19:36:05Z","abstract_excerpt":"Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up chart parsers for PCFGs. We generalize chart constraints to more expressive grammar formalisms and describe a neural tagger which predicts chart constraints at very high precision. Our constraints accelerate both PCFG and TAG parsing, and combine effectively with other pruning techniques (coarse-to-fine and supertagging) for an overall speedup of two orders of magnitude, while improving accuracy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10654","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":"1806.10654","created_at":"2026-05-18T00:12:08.336545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10654v1","created_at":"2026-05-18T00:12:08.336545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10654","created_at":"2026-05-18T00:12:08.336545+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N3KTN4RJB2O","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N3KTN4RJB2OLHPD","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N3KTN4R","created_at":"2026-05-18T12:32:05.422762+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/4N3KTN4RJB2OLHPDO745GTQE63","json":"https://pith.science/pith/4N3KTN4RJB2OLHPDO745GTQE63.json","graph_json":"https://pith.science/api/pith-number/4N3KTN4RJB2OLHPDO745GTQE63/graph.json","events_json":"https://pith.science/api/pith-number/4N3KTN4RJB2OLHPDO745GTQE63/events.json","paper":"https://pith.science/paper/4N3KTN4R"},"agent_actions":{"view_html":"https://pith.science/pith/4N3KTN4RJB2OLHPDO745GTQE63","download_json":"https://pith.science/pith/4N3KTN4RJB2OLHPDO745GTQE63.json","view_paper":"https://pith.science/paper/4N3KTN4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10654&json=true","fetch_graph":"https://pith.science/api/pith-number/4N3KTN4RJB2OLHPDO745GTQE63/graph.json","fetch_events":"https://pith.science/api/pith-number/4N3KTN4RJB2OLHPDO745GTQE63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N3KTN4RJB2OLHPDO745GTQE63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N3KTN4RJB2OLHPDO745GTQE63/action/storage_attestation","attest_author":"https://pith.science/pith/4N3KTN4RJB2OLHPDO745GTQE63/action/author_attestation","sign_citation":"https://pith.science/pith/4N3KTN4RJB2OLHPDO745GTQE63/action/citation_signature","submit_replication":"https://pith.science/pith/4N3KTN4RJB2OLHPDO745GTQE63/action/replication_record"}},"created_at":"2026-05-18T00:12:08.336545+00:00","updated_at":"2026-05-18T00:12:08.336545+00:00"}