Head automata and bilingual tiling: translation with minimal representations

  • Authors:
  • Hiyan Alshawi

  • Affiliations:
  • AT&T Research, Murray Hill, NJ

  • Venue:
  • ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for incremental application of lexical associations in a dynamic programming search for optimal dependency tree derivations. We also present a model and algorithm for machine translation involving optimal "tiling" of a dependency tree with entries of a costed bilingual lexicon. Experimental results are reported comparing methods for assigning cost functions to these models. We conclude with a discussion of the adequacy of annotated linguistic strings as representations for machine translation.