Hidden Markov Tree Model in Dependency-based Machine Translation

We would like to draw attention to Hidden Markov Tree Models (HMTM), which are to our knowledge still unexploited in the field of Computational Linguistics, in spite of highly successful Hidden Markov (Chain) Models. In dependency trees, the independence assumptions made by HMTM correspond to the intuition of linguistic dependency. Therefore we suggest to use HMTM and tree-modified Viterbi algorithm for tasks interpretable as labeling nodes of dependency trees. In particular, we show that the transfer phase in a Machine Translation system based on tectogrammatical dependency trees can be seen as a task suitable for HMTM. When using the HMTM approach for the English-Czech translation, we reach a moderate improvement over the baseline.

• Type: Journal
• Year: 2009
• Where: ACL
• Authors: Zdenek Zabokrtský, Martin Popel
• Keywords: ACL 2009, Computational Linguistics, Dependency Trees, Hidden Markov, Successful Hidden Markov