Computer Science – Computation and Language
Scientific paper
1996-07-03
Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, 167-176, Santa Cruz, California, 1996
Computer Science
Computation and Language
Scientific paper
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.
No associations
LandOfFree
Head Automata and Bilingual Tiling: Translation with Minimal Representations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Head Automata and Bilingual Tiling: Translation with Minimal Representations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Head Automata and Bilingual Tiling: Translation with Minimal Representations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-301793