Head Automata and Bilingual Tiling: Translation with Minimal Representations
H. Alshawi. Proc. ACL-94, page 167-176. Santa Cruz, CA, (1996)Available at arXiv:cmp-lg/9607005.
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.
%0 Conference Paper
%1 Alshawi:1996c
%A Alshawi, Hiyan
%B Proc. ACL-94
%C Santa Cruz, CA
%D 1996
%K machine_translation DG automata
%P 167-176
%T Head Automata and Bilingual Tiling: Translation with Minimal Representations
%U http://xxx.lanl.gov/abs/cmp-lg/9607005
%X 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.
@inproceedings{Alshawi:1996c,
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.},
added-at = {2007-12-14T02:35:21.000+0100},
address = {Santa Cruz, CA},
author = {Alshawi, Hiyan},
biburl = {https://www.bibsonomy.org/bibtex/21e71918395c87da133356a259b595cd7/diego_ma},
booktitle = {Proc. ACL-94},
interhash = {bdfc88b823404a426d7222d8b8520866},
intrahash = {1e71918395c87da133356a259b595cd7},
keywords = {machine_translation DG automata},
note = {Available at arXiv:cmp-lg/9607005},
pages = {167-176},
timestamp = {2007-12-14T02:35:21.000+0100},
title = {Head Automata and Bilingual Tiling: Translation with Minimal Representations},
url = {http://xxx.lanl.gov/abs/cmp-lg/9607005},
year = 1996
}