Elamur Research⌕
☰
home / papers / 1991 / Aligning Sentences in Parallel Corpora

Aligning Sentences in Parallel Corpora

Summary

Brown, Lai and Mercer address sentence alignment: pairing each sentence in a bilingual corpus with its translation, even when one sentence becomes two or text is dropped on one side. Their data is the English-French Canadian Hansard proceedings (1973–1986), with roughly 3.5M English and 3.7M French sentences. The method has two stages. First, structural comments in the transcripts (speaker names, timestamps, session markers) serve as anchors and are matched by dynamic programming, which splits the corpora into short subsections. Second, sentences inside each subsection are aligned with a hidden Markov model. The model looks only at sentence lengths in tokens and at paragraph markers, never at the words themselves. Alignments are built from "beads" (1–1, 1–2, 2–1, 1–0, 0–1 groupings), and parameters are estimated with EM. A hand check of 1000 aligned pairs found 6 errors. Because the method ignores vocabulary, it is fast enough for very large corpora. It laid groundwork for building the sentence-pair data that statistical machine translation depends on.

Key points

  • Corpus statistics: the English portion contains 3,510,744 sentences totaling 85,016,286 tokens, while the French portion contains 3,690,425 sentences totaling 97,857,452 tokens. Average sentence length is 24.2 tokens for English and 26.5 for French, so French runs about 9.5% longer.
  • Anchor alignment:
    • Major anchors are aligned first, using costs of 0 for an exact match, 10 for a mismatch and 5 for a deletion. Names are scored by letter-level edit distance, scaled to the range 0–10.
    • Sections whose minor anchors (e.g., Mr. Speaker / M. le Président) do not line up are discarded, which removes about 10% of the data.
    • The remaining subsections average about ten sentences.
  • EM estimates: about 91% of English sentences and 98% of paragraph markers map one-to-one to French counterparts.
  • Simulated error rates:
    • About 0.9% with anchors and paragraph markers.
    • 2.0% with paragraph markers only.
    • 2.3% with anchors only.
    • 3.2% with neither.
  • Full run: 10 days on an IBM 3090 with 16 MB of virtual memory, producing 2,869,041 one-to-one beads. A manual check of 1000 of them found 6 incorrect.

Interesting ideas

  • I1. Length is a strong signal on its own. Sentence length, with no lexical features, is enough for a cheap and language-agnostic baseline aligner. This makes it attractive for low-resource language pairs where no bilingual dictionary exists.
  • I2. Use document metadata as anchors. Speaker tags, timestamps and section headers can be aligned first to cut a huge alignment problem into small, safe chunks. This applies to any parallel or comparable collection that has markup, such as subtitles, legal codes or parliamentary records.
  • I3. Throw away inconsistent chunks. Sections where secondary anchors disagree are rejected outright rather than force-aligned. Sacrificing about 10% of the data for higher precision is a sensible trade-off whenever the corpus is large.
  • I4. Estimate accuracy by simulation. The authors generate synthetic corpora from the fitted model and measure how well the aligner recovers the known alignment. They also switch features off one at a time to measure each one's contribution. This lets you predict accuracy before costly manual annotation.
  • I5. Use information theory as a feasibility check. Comparing the entropy of the bead process (1.26 bits) with the mutual information between sentence lengths (1.85 bits) shows whether a signal can, in principle, support alignment. This is a quick test worth reusing for other weak features.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

Fields: Linguistics & languages · Machine translation · Natural language processing

Cited by

164 papers of our library cite it (of the 140673 whose bibliographies we read); 10 of them have a page here, 154 not yet.

Cite

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.3115/981344.981366

@inproceedings{brown1991aligning,
  title = {{Aligning Sentences in Parallel Corpora}},
  author = {Brown, Peter F. and Lai, Jennifer C. and Mercer, Robert L.},
  booktitle = {29th Annual Meeting of the Association for Computational Linguistics},
  year = {1991},
  doi = {10.3115/981344.981366},
  url = {https://doi.org/10.3115/981344.981366}
}

References

12 references, 2 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. Baum, L. (1972). An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process. Inequalities, 3:1-8. find
  2. Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton N.J. find
  3. Brown, P., Spohrer, J., Hochschild, P., and Baker, J. (1982). Partial traceback and dynamic programming. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, pages 1629-1632, Paris, France. find
  4. Brown, P. F., Cocke, J., DellaPietra, S. A., DellaPietra, V. J., Jelinek, F., Lafferty, J. D., Mercer, R. L., and Roossin, P. S. (1990). A statisticM approach to machine translation. Computational Linguistics, 16(2):79-85. find
  5. Brown, P. F., Cocke, J., DellaPietra, S. A., DellaPietra., V. J., .le-linek, F., Mercer, R. L., and Roossin, P. S. (1988). A statistical approach to language Pareillelnent. ... en voulant m&lager la ch~vre et le choux ils n'arrivent 1)as k prendre patti. Elle semble en effet avoir un grief tout a fa… find
  6. Catizone, R., Russell, G., and Warwick, S. (1989). Deriving translation data [rom bilingual texts. In Proceedings of the First International Acquisition Workshop, Detroit, Michigan. find
  7. 977] Dempster, A., Laird, N., and Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(B):1-38. find
  8. Gale, W. A. and Church, K. W. (1991). A program for aligning sentences in bilingual corpora. In Proceedings of the 2gth Annual Meeting of the A ssociation for Computational Linguistics, Berkeley, California. find our card
  9. 991] Kay, M. (1991). Text-translation alignment. In ACII/ALLC '91: "Makin.q Connections" Conference Handbook, Tempe, Arizona. find our card
  10. Kiavans, .l. and Tzoukermann, E. (1990). The bicord system. ]n COLING-90, pages 174-179, Ilelsinki, Finland. find
  11. Sadler, V. (1989). The Bilingual Knowledge B a n k - A New Conceptual Basis for MT. BSO/Research, Utrecht. find
  12. Wa.rwick, S. and Russell, G. (1990). Bilingual concordancing and bilingnM lexicography. In EURALEX 4th International Congress, M~ilaga, Spain. find

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/brown-1991-aligning-sentences-parallel-corpora/