{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PGABCTMKVWSFKCD625UBILFMAO","short_pith_number":"pith:PGABCTMK","schema_version":"1.0","canonical_sha256":"7980114d8aada455087ed768142cac03927b8aa3fdd5813f2730adce1eca0ff5","source":{"kind":"arxiv","id":"1302.1572","version":1},"attestation_state":"computed","paper":{"title":"Lexical Access for Speech Understanding using Minimum Message Length Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bhavani Raskutti, David Albrecht, Ian Thomas, Ingrid Zukerman, Jonathan Oliver","submitted_at":"2013-02-06T15:59:24Z","abstract_excerpt":"The Lexical Access Problem consists of determining the intended sequence of words corresponding to an input sequence of phonemes (basic speech sounds) that come from a low-level phoneme recognizer.  In this paper we present an information-theoretic approach  based on the Minimum Message Length Criterion for solving the Lexical Access Problem.  We model sentences using phoneme realizations seen in training, and word and part-of-speech information obtained from text corpora. We show results on multiple-speaker, continuous, read speech and discuss a heuristic using equivalence classes of similar "},"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":"1302.1572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-02-06T15:59:24Z","cross_cats_sorted":[],"title_canon_sha256":"c5671363cc078a2733d8d642d59b2e4d69c4b186349561be7d300085af11f699","abstract_canon_sha256":"2a3ea4b4a8e3e897c32c0c250ef0678e58daf9aa873ffeebf1c51fb5a8e6206e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:15.392445Z","signature_b64":"nniyWd8WKuZMh9JnPrFGXOqYG/Sw94PLR0cCtezWavd3o2hVC+dHaVpjIJIMeY9e3pcLQPkLOvRr2tL50Lp5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7980114d8aada455087ed768142cac03927b8aa3fdd5813f2730adce1eca0ff5","last_reissued_at":"2026-05-18T03:34:15.391813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:15.391813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lexical Access for Speech Understanding using Minimum Message Length Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bhavani Raskutti, David Albrecht, Ian Thomas, Ingrid Zukerman, Jonathan Oliver","submitted_at":"2013-02-06T15:59:24Z","abstract_excerpt":"The Lexical Access Problem consists of determining the intended sequence of words corresponding to an input sequence of phonemes (basic speech sounds) that come from a low-level phoneme recognizer.  In this paper we present an information-theoretic approach  based on the Minimum Message Length Criterion for solving the Lexical Access Problem.  We model sentences using phoneme realizations seen in training, and word and part-of-speech information obtained from text corpora. We show results on multiple-speaker, continuous, read speech and discuss a heuristic using equivalence classes of similar "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1572","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":"1302.1572","created_at":"2026-05-18T03:34:15.391905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1572v1","created_at":"2026-05-18T03:34:15.391905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1572","created_at":"2026-05-18T03:34:15.391905+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGABCTMKVWSF","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGABCTMKVWSFKCD6","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGABCTMK","created_at":"2026-05-18T12:27:54.935989+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/PGABCTMKVWSFKCD625UBILFMAO","json":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO.json","graph_json":"https://pith.science/api/pith-number/PGABCTMKVWSFKCD625UBILFMAO/graph.json","events_json":"https://pith.science/api/pith-number/PGABCTMKVWSFKCD625UBILFMAO/events.json","paper":"https://pith.science/paper/PGABCTMK"},"agent_actions":{"view_html":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO","download_json":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO.json","view_paper":"https://pith.science/paper/PGABCTMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1572&json=true","fetch_graph":"https://pith.science/api/pith-number/PGABCTMKVWSFKCD625UBILFMAO/graph.json","fetch_events":"https://pith.science/api/pith-number/PGABCTMKVWSFKCD625UBILFMAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO/action/storage_attestation","attest_author":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO/action/author_attestation","sign_citation":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO/action/citation_signature","submit_replication":"https://pith.science/pith/PGABCTMKVWSFKCD625UBILFMAO/action/replication_record"}},"created_at":"2026-05-18T03:34:15.391905+00:00","updated_at":"2026-05-18T03:34:15.391905+00:00"}