{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y455F3A7AQ36BG2QL4DCOVRWSY","short_pith_number":"pith:Y455F3A7","schema_version":"1.0","canonical_sha256":"c73bd2ec1f0437e09b505f06275636961a036f11f0a4245184a5ea94307a63a1","source":{"kind":"arxiv","id":"1711.00309","version":1},"attestation_state":"computed","paper":{"title":"Improving Neural Machine Translation through Phrase-based Forced Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Eiichro Sumita, Graham Neubig, Jingyi Zhang, Masao Utiyama, Satoshi Nakamura","submitted_at":"2017-11-01T12:25:20Z","abstract_excerpt":"Compared to traditional statistical machine translation (SMT), neural machine translation (NMT) often sacrifices adequacy for the sake of fluency. We propose a method to combine the advantages of traditional SMT and NMT by exploiting an existing phrase-based SMT model to compute the phrase-based decoding cost for an NMT output and then using this cost to rerank the n-best NMT outputs. The main challenge in implementing this approach is that NMT outputs may not be in the search space of the standard phrase-based decoding algorithm, because the search space of phrase-based SMT is limited by the "},"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":"1711.00309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-01T12:25:20Z","cross_cats_sorted":[],"title_canon_sha256":"8cc3459a988aa301051436b830dd35950fc0dbcfcd2fc953b94ec61d7343e25b","abstract_canon_sha256":"9fabf99d1cafd943f0815acf45d4664d2cf9937be4a65c6fd7f485346985a006"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:34.453000Z","signature_b64":"Lw5PvYtCJvbhMRuPoTRi3XJe0UPJijDHt/xTlTwQJkOe7vOpVEp1+FlAd5/KdyP0OLALJn5rWEkBn/iSFnSCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c73bd2ec1f0437e09b505f06275636961a036f11f0a4245184a5ea94307a63a1","last_reissued_at":"2026-05-18T00:31:34.452382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:34.452382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Neural Machine Translation through Phrase-based Forced Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Eiichro Sumita, Graham Neubig, Jingyi Zhang, Masao Utiyama, Satoshi Nakamura","submitted_at":"2017-11-01T12:25:20Z","abstract_excerpt":"Compared to traditional statistical machine translation (SMT), neural machine translation (NMT) often sacrifices adequacy for the sake of fluency. We propose a method to combine the advantages of traditional SMT and NMT by exploiting an existing phrase-based SMT model to compute the phrase-based decoding cost for an NMT output and then using this cost to rerank the n-best NMT outputs. The main challenge in implementing this approach is that NMT outputs may not be in the search space of the standard phrase-based decoding algorithm, because the search space of phrase-based SMT is limited by the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00309","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":"1711.00309","created_at":"2026-05-18T00:31:34.452469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00309v1","created_at":"2026-05-18T00:31:34.452469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00309","created_at":"2026-05-18T00:31:34.452469+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y455F3A7AQ36","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y455F3A7AQ36BG2Q","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y455F3A7","created_at":"2026-05-18T12:31:56.362134+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/Y455F3A7AQ36BG2QL4DCOVRWSY","json":"https://pith.science/pith/Y455F3A7AQ36BG2QL4DCOVRWSY.json","graph_json":"https://pith.science/api/pith-number/Y455F3A7AQ36BG2QL4DCOVRWSY/graph.json","events_json":"https://pith.science/api/pith-number/Y455F3A7AQ36BG2QL4DCOVRWSY/events.json","paper":"https://pith.science/paper/Y455F3A7"},"agent_actions":{"view_html":"https://pith.science/pith/Y455F3A7AQ36BG2QL4DCOVRWSY","download_json":"https://pith.science/pith/Y455F3A7AQ36BG2QL4DCOVRWSY.json","view_paper":"https://pith.science/paper/Y455F3A7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00309&json=true","fetch_graph":"https://pith.science/api/pith-number/Y455F3A7AQ36BG2QL4DCOVRWSY/graph.json","fetch_events":"https://pith.science/api/pith-number/Y455F3A7AQ36BG2QL4DCOVRWSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y455F3A7AQ36BG2QL4DCOVRWSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y455F3A7AQ36BG2QL4DCOVRWSY/action/storage_attestation","attest_author":"https://pith.science/pith/Y455F3A7AQ36BG2QL4DCOVRWSY/action/author_attestation","sign_citation":"https://pith.science/pith/Y455F3A7AQ36BG2QL4DCOVRWSY/action/citation_signature","submit_replication":"https://pith.science/pith/Y455F3A7AQ36BG2QL4DCOVRWSY/action/replication_record"}},"created_at":"2026-05-18T00:31:34.452469+00:00","updated_at":"2026-05-18T00:31:34.452469+00:00"}