Head Automata and Bilingual Tiling: Translation with Minimal Representations
<|reference_start|>Head Automata and Bilingual Tiling: Translation with Minimal Representations: 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.<|reference_end|>
@article{alshawi1996head,
    title={Head Automata and Bilingual Tiling: Translation with Minimal
  Representations},
    author={Hiyan Alshawi (AT&T Research)},
    journal={Proceedings of the 34th Annual Meeting of the Association for
  Computational Linguistics, 167-176, Santa Cruz, California, 1996.},
    year={1996},
    archivePrefix={arXiv},
    eprint={cmp-lg/9607005},
    primaryClass={cmp-lg cs.CL}
}