Skip to main content

Twisted Pair Grammar: Support for Rapid Development of Machine Translation for Low Density Languages

  • Conference paper
  • First Online:

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

Abstract

We describe a streamlined knowledge acquisition method for semi-automatically constructing knowledge bases for a Knowledge Based Machine Translation (KBMT) system. This method forms the basis of a very simple Java-based user interface that enables a language expert to build lexical and syntactic transfer knowledge bases without extensive specialized training as an MT system builder. Following [Wu 1997], we assume that the permutation of binary-branching structures is a sufficient reordering mechanism for MT. Our syntactic knowledge is based on a novel, highly constrained grammar construction environment in which the only re-ordering mechanism is the permutation of binary-branching structures (Twisted Pair Grammar). We describe preliminary results for several fully implemented components of a Hindi/Urdu to English MT prototype being built with this interface.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bains, Gurprit. 1989. Complex Structures in Hindi-Urdu: Explorations in Government and Binding Theory. Doctoral Dissertation, New York University.

    Google Scholar 

  2. Barker, Muhamed ABD-AL-Rahman, Hasan Jahangir Hamdani, Khwaja Muhammad Shafi Dihlari, and Shafiqur Rahman. 1993. Spoken Urdu: A Course in Urdu. Volume 1. Spoken Language Service, Inc.

    Google Scholar 

  3. Brill, Eric. 1995. Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part of Speech Tagging. (ACL)

    Google Scholar 

  4. Chomsky, Noam. 1995. The Minimalist Program. Current Studies in Linguistics. MIT Press.

    Google Scholar 

  5. Michael Collins. 1997. Three Generative, Lexicalised Models for Statistical Parsing. Proceedings of the 35th Annual Meeting of the ACL (jointly with the 8th Conference of the Linguistics. EACL), Madrid.

    Google Scholar 

  6. Davison, Alice. 1988. “Constituent Structures and the Realization of Agreement Features.” Proceedings of the 24th Meeting of the Chicago Linguistic Society, Parasession of Agreement in Grammatical Theory.

    Google Scholar 

  7. Dorr, Bonnie. 1993. Machine Translation: A View from the Lexicon. MIT Press.

    Google Scholar 

  8. Fung, Pascal and Dekai Wu. 1994. Statistical Augmentation of a Chinese Machine-Readable Dictionary. Available as cmp-lg/9406015.

    Google Scholar 

  9. Hatzivassiloglou, Vasileios and Kevin Knight. “Unification-Based Glossing”. 1995. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).

    Google Scholar 

  10. Kayne, Richard. 1994. The Antisymmetry of Syntax. Linguistic Inquiry Monograph 25. MIT Press.

    Google Scholar 

  11. Kayne, Richard. 1983. Connectedness and Binary Branching. Studies in Generative Grammar 16. Foris Publications.

    Google Scholar 

  12. Knight, Kevin and Steve Luk. “Building a Large-Scale Knowledge Base For Machine Translation. 1994. Proceedings of American Association for Artificial Intelligence.

    Google Scholar 

  13. Knight, Kevin, Ishwar Chandler, Matthew Haines, Vasileios Hatzivassigloglou, Eduard Hovy, Masayo Ida, Steve Luk, Richard Whitney, and Kenji Yamada. 1994. Integrating Knowledge Bases and Statistics in MT (AMTA-94)

    Google Scholar 

  14. Knight, Kevin, Ishwar Chandler, Matthew Haines, Vasileios Hatzivassigloglou, Eduard Hovy, Masayo Ida, Steve Luk, Akitoshi Okumura, Richard Whitney, and Kenji Yamada 1995. “Filing Knowledge Gaps in a Broad-Coverage Machine Translation System”. (IJCAI-95).

    Google Scholar 

  15. Nirenburg, Sergei and Victor Raskin. 1998. “Universal Grammar and Lexis for Quick Ramp-Up of MT Systems. (manuscript)

    Google Scholar 

  16. Nirenburg, Sergei, Jaime Carbonnel, M. Tomita, and K. Goodman. 1992. Machine Translation: A Knowledge-Based Approach. Morgan Kaufmann.

    Google Scholar 

  17. Shieber, Stuart. 1985. An Introduction to Unification-Based Approaches to Grammar. Center for the Study of Language and Information, University of Chicago Press.

    Google Scholar 

  18. Wu, Dekai and Xuanyin Xia. 1995. Large-Scale Automatic Extraction of an English-Chinese Translation Lexicon. Machine Translation. 9:3, 1–28.

    Article  MathSciNet  Google Scholar 

  19. Wu, Dekai. 1994. Aligning a Parallel English-Chinese Corpus Statistically with Lexical Criteria. Available as cmp-lg/9406007.

    Google Scholar 

  20. Wu, Dekai. 1997. Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora. Computational Linguistics. 21(4):377–404.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jones, D., Havrilla, R. (1998). Twisted Pair Grammar: Support for Rapid Development of Machine Translation for Low Density Languages. In: Farwell, D., Gerber, L., Hovy, E. (eds) Machine Translation and the Information Soup. AMTA 1998. Lecture Notes in Computer Science(), vol 1529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49478-2_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-49478-2_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49478-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics