Mova0.5 pre-release⌕
☰
home / docs / papers / Machine translation / SYSTRAN

SYSTRAN

What it is about

A short account of the SYSTRAN rule-based system, given as an oral presentation and written up afterwards. The main claim is that the system is reliable, economic and satisfies its users. The engine is separated from the linguistic data: dictionaries and rules can be changed without touching the programs, and a new language pair needs only a new source analysis module, with the dictionary lookup and the target synthesis reused. Rules are written in a macro language for linguists. The paper gives throughput figures: about 300,000 words per CPU hour in batch, and roughly 18 seconds of processor time per 1,000 words. It gives no accuracy numbers.

Ideas

For Mova

The paper suggests that a modular design is worth testing as a property, not only assumed: reader, standard encoder and stack should be separable, and a change in one should leave the others' outputs unchanged. This fits the layer-by-layer residual in exact mode. Override precedence is already present in the author DELTA, so the new part is the stage-level throughput record in tools/translate/src/measure.rs.

Topics: Machine translation

Cite

The paper itself, not this card. BibTeX from the library's record of the work.

@inproceedings{toma1976systran,
  title = {{SYSTRAN}},
  author = {Toma, Peter},
  booktitle = {Foreign Broadcast Information Service Seminar on Machine Translation},
  year = {1976},
  url = {https://aclanthology.org/1976.earlymt-1.11/}
}

This page in Markdown → https://md.mova.elamur.ai/free/en/docs/papers/toma-1976-systran/