Skip to main content

Machine Translation Based on Constraint-Based Synchronous Grammar

  • Conference paper
Natural Language Processing – IJCNLP 2005 (IJCNLP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3651))

Included in the following conference series:

Abstract

This paper proposes a variation of synchronous grammar based on the formalism of context-free grammar by generalizing the first component of productions that models the source text, named Constraint-based Synchronous Grammar (CSG). Unlike other synchronous grammars, CSG allows multiple target productions to be associated to a single source production rule, which can be used to guide a parser to infer different possible translational equivalences for a recognized input string according to the feature constraints of symbols in the pattern. Furthermore, CSG is augmented with independent rewriting that allows expressing discontinuous constituents in the inference rules. It turns out that such grammar is more expressive to model the translational equivalences of parallel texts for machine translation, and in this paper, we propose the use of CSG as a basis for building a machine translation (MT) system for Portuguese to Chinese translation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rambow, O., Satta, G.: Synchronous Models of Language. In: Proceedings of 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz, California, USA, pp. 116–123. Morgan Kaufmann, San Francisco (1996)

    Chapter  Google Scholar 

  2. Lewis, P.M., Stearns, R.E.: Syntax-directed transduction. Journal of the Association for Computing Machinery 15(3), 465–488 (1968)

    MATH  Google Scholar 

  3. Shieber, S.M., Schabes, Y.: Synchronous Tree Adjoining Grammar. In: Proceedings of the 13th International Conference on Computational Linguistic, Helsinki (1990)

    Google Scholar 

  4. Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88(2), 191–229 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Melamed, I.D.: Multitext Grammars and Synchronous Parsers. In: Proceedings of NAACL/HLT 2003, Edmonton, pp. 79–86 (2003)

    Google Scholar 

  6. Wong, F., Hu, D.C., Mao, Y.H., Dong, M.C.: A Flexible Example Annotation Schema: Translation Corresponding Tree Representation. In: Proceedings of the 20th International Conference on Computational Linguistics, Switzerland, Geneva, pp. 1079–1085 (2004)

    Google Scholar 

  7. Wu, D.: Grammarless extraction of phrasal translation examples from parallel texts. In: Proceedings of TMI-1995, Sixth International Conference on Theoretical and Methodological Issues in Machine Translation, v2, Leuven Belgium, 354–372 (1995)

    Google Scholar 

  8. Aho, A.V., Ullman, J.D.: Syntax Directed Translations and the Pushdown Assembler. Journal of Computer and System Sciences 3, 37–56 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  9. Melamed, I.D., Satta, G., Wellington, B.: Generalized Multitext Grammars. In: Proceedings of 42th Annual Meeting of the Association for Computational Linguistics, Barcelona, Spain, pp. 661–668 (2004)

    Google Scholar 

  10. Kaplan, R.M., Bresnan, J.: Lexical-Functional Grammar: A Formal System for Grammatical Representation. In: Bresnan, J. (ed.) The Mental Representation of Grammatical Relations, pp. 173–281. MIT Press, Cambridge (1982)

    Google Scholar 

  11. Kaplan, R.M.: The Formal Architecture of Lexical-Functional Grammar. Information Science and Engineering 5, 30–322 (1989)

    Google Scholar 

  12. Wong, F., Mao, Y.H.: Framework of Electronic Dictionary System for Chinese and Romance Languages. Automatique des Langues (TAL) 44(2), 225–245 (2003)

    Google Scholar 

  13. Wong, F., Mao, Y.H., Dong, Q.F., Qi, Y.H.: Automatic Translation: Overcome the Barriers between European and Chinese Languages. In: Proceedings (CD Version) of First International UNL Open Conference, SuZhou China (2001)

    Google Scholar 

  14. Pollard, C., Sag, I.: Head-Driven Phrase Structure Grammar. University of Chicago Press, Chicago (1994)

    Google Scholar 

  15. Ide, N., Veronis, J.: Word Sense Disambiguation: The State of the Art. Computational Linguistics 24(1), 1–41 (1998)

    Google Scholar 

  16. Earley, J.: An Efficient Context-Free Parsing Algorithm. CACM 13(2), 94–102 (1970)

    MATH  Google Scholar 

  17. Tomita, M.: Computational Linguistics, 13(1-2), 31–46 (1987)

    Google Scholar 

  18. Aho, A.V., Sethi, R., Ullman, J.D.: Compiler: Principles, Techniques and Tools. Addison-Wesley, Reading (1986)

    Google Scholar 

  19. Hutchins, W.J., Somers, H.L.: An Introduction to Machine Translation. Academic Press, London (1992)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wong, F., Hu, DC., Mao, YH., Dong, MC., Li, YP. (2005). Machine Translation Based on Constraint-Based Synchronous Grammar. In: Dale, R., Wong, KF., Su, J., Kwong, O.Y. (eds) Natural Language Processing – IJCNLP 2005. IJCNLP 2005. Lecture Notes in Computer Science(), vol 3651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562214_54

Download citation

  • DOI: https://doi.org/10.1007/11562214_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29172-5

  • Online ISBN: 978-3-540-31724-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics