{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:4SQN5M6WVOLX5O2567VJ5GIIEE","short_pith_number":"pith:4SQN5M6W","schema_version":"1.0","canonical_sha256":"e4a0deb3d6ab977ebb5df7ea9e9908213a51653613f6c21d6fe193336d2cca8b","source":{"kind":"arxiv","id":"cmp-lg/9805007","version":1},"attestation_state":"computed","paper":{"title":"Parsing Inside-Out","license":"","headline":"","cross_cats":["cs.CL"],"primary_cat":"cmp-lg","authors_text":"Joshua Goodman (Harvard University)","submitted_at":"1998-05-19T16:43:26Z","abstract_excerpt":"The inside-outside probabilities are typically used for reestimating Probabilistic Context Free Grammars (PCFGs), just as the forward-backward probabilities are typically used for reestimating HMMs. I show several novel uses, including improving parser accuracy by matching parsing algorithms to evaluation criteria; speeding up DOP parsing by 500 times; and 30 times faster PCFG thresholding at a given accuracy level. I also give an elegant, state-of-the-art grammar formalism, which can be used to compute inside-outside probabilities; and a parser description formalism, which makes it easy to de"},"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":"cmp-lg/9805007","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cmp-lg","submitted_at":"1998-05-19T16:43:26Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"8d1e3a1632cfb9544fa072b209df3cde8144d543458ac1507b0b26a4117a3d71","abstract_canon_sha256":"005c5ed353565f9c59883306afc4caacf99cf42ab5bb40c62c9af2e2ec318245"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:17:39.095407Z","signature_b64":"1rR1xbI85lAcwavXUG6BqqjwRY0zwZQBB5Tvhml/orgYrqtx78uweB7GXeFCbwAcBylTQfXSD/8KjnoaB1YVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4a0deb3d6ab977ebb5df7ea9e9908213a51653613f6c21d6fe193336d2cca8b","last_reissued_at":"2026-07-04T14:17:39.094931Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:17:39.094931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parsing Inside-Out","license":"","headline":"","cross_cats":["cs.CL"],"primary_cat":"cmp-lg","authors_text":"Joshua Goodman (Harvard University)","submitted_at":"1998-05-19T16:43:26Z","abstract_excerpt":"The inside-outside probabilities are typically used for reestimating Probabilistic Context Free Grammars (PCFGs), just as the forward-backward probabilities are typically used for reestimating HMMs. I show several novel uses, including improving parser accuracy by matching parsing algorithms to evaluation criteria; speeding up DOP parsing by 500 times; and 30 times faster PCFG thresholding at a given accuracy level. I also give an elegant, state-of-the-art grammar formalism, which can be used to compute inside-outside probabilities; and a parser description formalism, which makes it easy to de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cmp-lg/9805007","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cmp-lg/9805007/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cmp-lg/9805007","created_at":"2026-07-04T14:17:39.094989+00:00"},{"alias_kind":"arxiv_version","alias_value":"cmp-lg/9805007v1","created_at":"2026-07-04T14:17:39.094989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cmp-lg/9805007","created_at":"2026-07-04T14:17:39.094989+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SQN5M6WVOLX","created_at":"2026-07-04T14:17:39.094989+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SQN5M6WVOLX5O25","created_at":"2026-07-04T14:17:39.094989+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SQN5M6W","created_at":"2026-07-04T14:17:39.094989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19338","citing_title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4SQN5M6WVOLX5O2567VJ5GIIEE","json":"https://pith.science/pith/4SQN5M6WVOLX5O2567VJ5GIIEE.json","graph_json":"https://pith.science/api/pith-number/4SQN5M6WVOLX5O2567VJ5GIIEE/graph.json","events_json":"https://pith.science/api/pith-number/4SQN5M6WVOLX5O2567VJ5GIIEE/events.json","paper":"https://pith.science/paper/4SQN5M6W"},"agent_actions":{"view_html":"https://pith.science/pith/4SQN5M6WVOLX5O2567VJ5GIIEE","download_json":"https://pith.science/pith/4SQN5M6WVOLX5O2567VJ5GIIEE.json","view_paper":"https://pith.science/paper/4SQN5M6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cmp-lg/9805007&json=true","fetch_graph":"https://pith.science/api/pith-number/4SQN5M6WVOLX5O2567VJ5GIIEE/graph.json","fetch_events":"https://pith.science/api/pith-number/4SQN5M6WVOLX5O2567VJ5GIIEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SQN5M6WVOLX5O2567VJ5GIIEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SQN5M6WVOLX5O2567VJ5GIIEE/action/storage_attestation","attest_author":"https://pith.science/pith/4SQN5M6WVOLX5O2567VJ5GIIEE/action/author_attestation","sign_citation":"https://pith.science/pith/4SQN5M6WVOLX5O2567VJ5GIIEE/action/citation_signature","submit_replication":"https://pith.science/pith/4SQN5M6WVOLX5O2567VJ5GIIEE/action/replication_record"}},"created_at":"2026-07-04T14:17:39.094989+00:00","updated_at":"2026-07-04T14:17:39.094989+00:00"}