Head Automata and Bilingual Tiling: Translation with Minimal Representations
| dc.creator | Alshawi, Hiyan | |
| dc.date | 1996-07-03 | |
| dc.date.accessioned | 2026-07-07T09:10:27Z | |
| dc.date.available | 2026-07-07T09:10:27Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9607005 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9607005 | |
| dc.identifier | Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, 167-176, Santa Cruz, California, 1996. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151355 | |
| dc.subject | Computation and Language | |
| dc.title | Head Automata and Bilingual Tiling: Translation with Minimal Representations | |
| dc.type | text |