Time-Constrained Machine Translation

  • Janine Toole
  • Davide Turcato
  • Fred Popowich
  • Dan Fass
  • Paul McFetridge
Conference paper

DOI: 10.1007/3-540-49478-2_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1529)
Cite this paper as:
Toole J., Turcato D., Popowich F., Fass D., McFetridge P. (1998) Time-Constrained Machine Translation. 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

Abstract

This paper defines the class of time-constrained applications: applications in which the user has limited time to process the system output. This class is differentiated from real-time systems, where it is production time rather than comprehension time that is constrained. Examples of time-constrained MT applications include the translation of multi-party dialogue and the translation of closed-captions. The constraints on comprehension time in such systems have significant implications for the system’s objectives, its design, and its evaluation. In this paper we outline these challenges and discuss how they have been met in an English-Spanish MT system designed to translate the closed-captions used on television.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Janine Toole
    • 1
    • 2
  • Davide Turcato
    • 1
    • 2
  • Fred Popowich
    • 1
    • 2
  • Dan Fass
    • 1
    • 2
  • Paul McFetridge
    • 1
    • 2
  1. 1.Natural Language Lab, School of Computing ScienceSimon Fraser UniversityBurnabyCanada
  2. 2.TCC CommunicationsVictoriaCanada

Personalised recommendations