Papers › Modeling Dual Read/Write Paths for Simultaneous Machine Translation

Modeling Dual Read/Write Paths for Simultaneous Machine Translation

17 Mar 2022ACL 2022 5arXiv:2203.09163archive 2025-07-28

Shaolei Zhang, Yang Feng

Simultaneous machine translation (SiMT) outputs translation while reading source sentence and hence requires a policy to decide whether to wait for the next source word (READ) or generate a target word (WRITE), the actions of which form a read/write path. Although the read/write path is essential to SiMT performance, no direct supervision is given to the path in the existing methods. In this paper, we propose a method of dual-path SiMT which introduces duality constraints to direct the read/write path. According to duality constraints, the read/write path in source-to-target and target-to-source SiMT models can be mapped to each other. As a result, the two SiMT models can be optimized jointly by forcing their read/write paths to satisfy the mapping. Experiments on En-Vi and De-En tasks show that our method can outperform strong baselines under all latency.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 9 code samples harvested from 2 repositories linked to this paper: 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 1 sample from 1 repository, 1 ran (0 with no instrument failure; 1 where Syntology's instrument failed); found in paper text by Syntology: 8 samples from 1 repository, 3 ran (2 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

ictnlp/dual-paths officialmentioned in paperpytorchSyntology: 1 sample, 1 ran (1 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested: 4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
1ran; the contract check could not run
2ran
5unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

ictnlp/dual-paths official repository 1 sample, 1 ran (1 instrument-failed) · 0 unverified
generate_dual_path fairseq/modules/dual_path.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted MIT (permissive) · b06a8bc83bad0d7d · report fixture: signature alpha:Tensor/3/float · returned Tensor · level recorded 2026-09-22
pytorch/fairseq found in paper text by Syntology 8 samples, 3 ran (1 instrument-failed) · 5 unverified
FairseqIncrementalState fairseq/sequence_generator.py ran MIT (permissive) · bfc25556c610f9a1 · report fixture: signature incremental_state:dict/0/?, key:str/0/str, value:dict/0/? · returned dict · level recorded 2026-09-24
NGramRepeatBlock fairseq/sequence_generator.py ran MIT (permissive) · f920993ca7cda2a9 · report fixture: signature tokens:Tensor/2/int, lprobs:Tensor/2/float, bsz:int/0/int, beam_size:int/0/int, step:int/0/int · returned Tensor · level recorded 2026-09-24
with_incremental_state in 12 papers fairseq/sequence_generator.py ran · our draft was wrong MIT (permissive) · a0f6171fabf48af6 · report fixture: signature cls:callable/0/? · returned type · level recorded 2026-09-22
EnsembleModel fairseq/sequence_generator.py unverified MIT (permissive) · a01ab4fabbe7ef3b · report
FairseqDecoder fairseq/sequence_generator.py unverified MIT (permissive) · 56c74cd2ed871afe · report
FairseqIncrementalDecoder fairseq/sequence_generator.py unverified MIT (permissive) · e67d47b827a110ab · report
SequenceGenerator fairseq/sequence_generator.py unverified MIT (permissive) · 2b54878118a0c256 · report
is_cuda_extension_usable fairseq/sequence_generator.py unverified MIT (permissive) · c06fe96f995054ea · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

2 assemblies on this paper: 2 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

2 sibling assemblies for dual-path SiMT (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for dual-path SiMT (graph method: dual-path SiMT). 1 brick; individually on a fixture: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. generate_dual_path entry · level 1 · ran; the contract check could not run (RAISES) · b06a8bc83bad0d7d

harvested Assembly for dual-path SiMT (graph method: dual-path SiMT). 8 bricks; individually on a fixture: 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. SequenceGenerator entry · level 0 · unverified · 2b54878118a0c256
  2. EnsembleModel helper · level 0 · unverified · a01ab4fabbe7ef3b
  3. NGramRepeatBlock helper · level 1 · ran · f920993ca7cda2a9
  4. FairseqIncrementalDecoder model · level 0 · unverified · e67d47b827a110ab
  5. is_cuda_extension_usable helper · level 0 · unverified · c06fe96f995054ea
  6. FairseqDecoder helper · level 0 · unverified · 56c74cd2ed871afe
  7. with_incremental_state helper · level 1 · ran · our draft was wrong · a0f6171fabf48af6
  8. FairseqIncrementalState helper · level 1 · ran · bfc25556c610f9a1

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2203.09163") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Machine TranslationSentenceTranslationde-en

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections