Skip to main content

Message Automata for Messages with Variants, and Methods for Their Translation

  • Conference paper
Computational Linguistics and Intelligent Text Processing (CICLing 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3406))

Abstract

In messages with variables and variants, such as “the imag.fr $n-[st|nd|rd|th] trial was successful, and the $p file[|s] found [is|are] satisfactory.”, variable types are specific (cardinal, ordinal, politeness...) and induce different “variant cases” in each language. Controlled loop-free FSAs, called here “message automata” (MAs), are proposed to model such messages. To translate a MA, one generates an instance of it for each possible variant in the target language. After translation, the values used in the instances are discarded and a target language MA is built by factorization (not classical minimization), using an original dynamic programming algorithm. A library for handling catalogues of MAs, GetAMsg, has been implemented in C, and can be used from many usual programming languages. A still speculative idea is to use a UNL graph conform to the official specifications, but with some special conventions, to represent a message with variables, and generate the language-specific MAs from it.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Boitet, C.: Le point sur ARIANE-78 début, 3 volumes, Partie 1, GETA-CHAMPOLLION, CAP SOGETI-France, avril 1982 (1982)

    Google Scholar 

  2. Boitet, C.: 1980 – 1990: TAO du réviseur et TAO du traducteur. In: La TAO à Grenoble en 1990, école d’été à Lannion (1990), www.clips.imag.fr/geta/christian.boitet/pages_personnelles/ (in English in Proc. ROCling-90, Taipeh)

  3. Boitet, C.: A rationale for using UNL as an interlingua and more in various domains. In: Proceedings First International Workshop on UNL, other Interlanguages and their Applications, LREC 2002, Las Palmas, Spain (May 2002)

    Google Scholar 

  4. Boitet, C.: Messages avec variantes, automates finis contrôlés, et multilinguisme, document interne, GETA, laboratoire CLIPS, IMAG, février (2003)

    Google Scholar 

  5. Drepper, U., Meyering, J., Pinard, F., Haible, B.: GNU gettext tools, version 0.11.2. Free Software Foundation (April 2002)

    Google Scholar 

  6. Guillaume, P.: L’interface utilisateur multilingue en Ariane-G5, Rapport de recherche, Groupe d’Etude pour la Traduction Automatique (GETA), CLIPS, IMAG, avril (2002)

    Google Scholar 

  7. Sidorov, G., Bolshakov, I., Cassidy, P., Galicia-Haro, S., Gelbukh, A.: Non-adult’ semantic field: comparative analysis for English, Spanish, and Russian. In: Proc. 3rd Tbilisi Symposium on Language, Logic, and Computation, Batumi, Georgia, September 12-16 (1999), www.gelbukh.com/CV/Publications/1999/Georgia-Non-Adult.htm

  8. Sidorov, G.O., Bolshakov, I.A., Cassidy, P., Galicia-Haro, S., Gelbukh, A.F.: A Comparative analysis of the semantic field non-adult in Russian, English, and Spanish (in Russian). In: Proc. Annual Int. Conf. on Applied Linguistics Dialogue 2000, Moscow, Russia (2000), www.gelbukh.com/CV/Publications/2000/Dialogue-2000-Non-Adult.htm

  9. Sun Microsystems Inc.: Building International Applications, Sun product documentation, http://docs.sun.com/db/doc/806-6663-01

  10. Tomokiyo, M., Chollet, G.: Voice UNL: a proposal to represent speech control mechanisms within the Universal Networking Digital Language. In: Proc. Convergences 2003, Alexandria, Egypt (December 2003)

    Google Scholar 

  11. Tsai, W.-J.: SWIIVRE - a Web Site for the Initiation, Information, Validation, Research and Experimentation on UNL (Universal Networking Language). In: First International UNL Open Conference, Suzhou, China (November 2001)

    Google Scholar 

  12. Tsai, W.-J.: A Platform for Experimenting UNL (Universal Networking Language). In: Workshop First International Workshop on UNL, other Interlinguas and their Applications, Proc. LREC 2002, Las Palmas, Spain (May 2002)

    Google Scholar 

  13. Tsai, W.-J.: “La coédition langue-UNL pour partager la révision entre langues d’un document multilingue”, thèse d’informatique, Université Joseph Fourier, juillet (2004)

    Google Scholar 

  14. Hiroshi, U.: The Universal Networking Language beyond Machine Translation. In: International symposium on language in cyberspace, Seoul, South Korea (September 2001)

    Google Scholar 

  15. Wheeler, D.A.: Secure Programming for Linux and Linux HOWTO (March 2003), http://www.dwheeler.com/secure-programs/

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

Boitet, C. (2005). Message Automata for Messages with Variants, and Methods for Their Translation. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2005. Lecture Notes in Computer Science, vol 3406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30586-6_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30586-6_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24523-0

  • Online ISBN: 978-3-540-30586-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics