{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IOKGIAHDCT66QUEOV3POMWJ2HY","short_pith_number":"pith:IOKGIAHD","schema_version":"1.0","canonical_sha256":"43946400e314fde8508eaedee6593a3e279a5466904ef67380abb08f1e1d8674","source":{"kind":"arxiv","id":"2109.14420","version":4},"attestation_state":"computed","paper":{"title":"FastCorrect 2: Fast Error Correction on Multiple Candidates for Automatic Speech Recognition","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.SD","eess.AS"],"primary_cat":"cs.CL","authors_text":"Edward Lin, Jin Xu, Linchen Zhu, Linquan Liu, Rui Wang, Tao Qin, Tie-Yan Liu, Wenjie Liu, Xiang-Yang Li, Xu Tan, Yichong Leng","submitted_at":"2021-09-29T13:48:03Z","abstract_excerpt":"Error correction is widely used in automatic speech recognition (ASR) to post-process the generated sentence, and can further reduce the word error rate (WER). Although multiple candidates are generated by an ASR system through beam search, current error correction approaches can only correct one sentence at a time, failing to leverage the voting effect from multiple candidates to better detect and correct error tokens. In this work, we propose FastCorrect 2, an error correction model that takes multiple ASR candidates as input for better correction accuracy. FastCorrect 2 adopts non-autoregre"},"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":"2109.14420","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2021-09-29T13:48:03Z","cross_cats_sorted":["cs.LG","cs.SD","eess.AS"],"title_canon_sha256":"3bc6cf5b20ec21119dcc3ae7b6e21732e15f4a171ab20c242c1df4a62a51694c","abstract_canon_sha256":"ec47d713d4c70977508d5fb8c665d77135fc512f70736227a085683459465630"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:08.462646Z","signature_b64":"kfqmDmiV5Wj8RcQ2JJGN+9OA6xRJpbpDFOxvJk1n18q/fXpI7puKGmnug/8SEXRYsrFnOdL83jxnb/0XtIGEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43946400e314fde8508eaedee6593a3e279a5466904ef67380abb08f1e1d8674","last_reissued_at":"2026-07-05T05:20:08.462161Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:08.462161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FastCorrect 2: Fast Error Correction on Multiple Candidates for Automatic Speech Recognition","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.SD","eess.AS"],"primary_cat":"cs.CL","authors_text":"Edward Lin, Jin Xu, Linchen Zhu, Linquan Liu, Rui Wang, Tao Qin, Tie-Yan Liu, Wenjie Liu, Xiang-Yang Li, Xu Tan, Yichong Leng","submitted_at":"2021-09-29T13:48:03Z","abstract_excerpt":"Error correction is widely used in automatic speech recognition (ASR) to post-process the generated sentence, and can further reduce the word error rate (WER). Although multiple candidates are generated by an ASR system through beam search, current error correction approaches can only correct one sentence at a time, failing to leverage the voting effect from multiple candidates to better detect and correct error tokens. In this work, we propose FastCorrect 2, an error correction model that takes multiple ASR candidates as input for better correction accuracy. FastCorrect 2 adopts non-autoregre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.14420","kind":"arxiv","version":4},"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/2109.14420/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":"2109.14420","created_at":"2026-07-05T05:20:08.462225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.14420v4","created_at":"2026-07-05T05:20:08.462225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.14420","created_at":"2026-07-05T05:20:08.462225+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOKGIAHDCT66","created_at":"2026-07-05T05:20:08.462225+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOKGIAHDCT66QUEO","created_at":"2026-07-05T05:20:08.462225+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOKGIAHD","created_at":"2026-07-05T05:20:08.462225+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.07285","citing_title":"Non-Intrusive Automatic Speech Recognition Refinement: A Survey","ref_index":83,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IOKGIAHDCT66QUEOV3POMWJ2HY","json":"https://pith.science/pith/IOKGIAHDCT66QUEOV3POMWJ2HY.json","graph_json":"https://pith.science/api/pith-number/IOKGIAHDCT66QUEOV3POMWJ2HY/graph.json","events_json":"https://pith.science/api/pith-number/IOKGIAHDCT66QUEOV3POMWJ2HY/events.json","paper":"https://pith.science/paper/IOKGIAHD"},"agent_actions":{"view_html":"https://pith.science/pith/IOKGIAHDCT66QUEOV3POMWJ2HY","download_json":"https://pith.science/pith/IOKGIAHDCT66QUEOV3POMWJ2HY.json","view_paper":"https://pith.science/paper/IOKGIAHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.14420&json=true","fetch_graph":"https://pith.science/api/pith-number/IOKGIAHDCT66QUEOV3POMWJ2HY/graph.json","fetch_events":"https://pith.science/api/pith-number/IOKGIAHDCT66QUEOV3POMWJ2HY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOKGIAHDCT66QUEOV3POMWJ2HY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOKGIAHDCT66QUEOV3POMWJ2HY/action/storage_attestation","attest_author":"https://pith.science/pith/IOKGIAHDCT66QUEOV3POMWJ2HY/action/author_attestation","sign_citation":"https://pith.science/pith/IOKGIAHDCT66QUEOV3POMWJ2HY/action/citation_signature","submit_replication":"https://pith.science/pith/IOKGIAHDCT66QUEOV3POMWJ2HY/action/replication_record"}},"created_at":"2026-07-05T05:20:08.462225+00:00","updated_at":"2026-07-05T05:20:08.462225+00:00"}