A syntax-directed translator with extended domain of locality

  • Authors:
  • Liang Huang;Kevin Knight;Aravind Joshi

  • Affiliations:
  • Univ. of Pennsylvania, Philadelphia, PA;Univ. of Southern California, Marina del Rey, CA;Univ. of Pennsylvania, Philadelphia, PA

  • Venue:
  • CHSLP '06 Proceedings of the Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A syntax-directed translator first parses the source-language input into a parse-tree, and then recursively converts the tree into a string in the target-language. We model this conversion by an extended tree-to-string transducer that have multi-level trees on the source-side, which gives our system more expressive power and flexibility. We also define a direct probability model and use a linear-time dynamic programming algorithm to search for the best derivation. The model is then extended to the general log-linear framework in order to rescore with other features like n-gram language models. We devise a simple-yet-effective algorithm to generate non-duplicate k-best translations for n-gram rescoring. Initial experimental results on English-to-Chinese translation are presented.