MEASURED AND PREDICTED LOSS GENERATION IN TRANSONIC TURBINE BLADING.

For a typical transonic turbine rotor blade, designed for use with coolant ejection, the trailing edge, or base loss is three to four times the profile boundary layer loss. The base region of such a profile is dominated by viscous effects and it seems essential to attack the problem of loss prediction by solving the compressible Navier-Stokes equations. However, such an approach is inevitably compromised by both numerical accuracy and turbulence modelling constraints. This paper describes a Navier-Stokes solver written for 2D blade-blade flows and employing a simple two-layer mixing length eddy viscosity model. Then, measured and predicted losses and base pressures are presented for two transonic rotor blades and attempts are made to assess the capabilities of the Navier-Stokes solver and to outline areas for future work.

Improving statistical machine translation by classifying and generalizing inflected verb forms

This paper introduces a rule-based classification of single-word and compound verbs into a statistical machine translation approach. By substituting verb forms by the lemma of their head verb, the data sparseness problem caused by highly-inflected languages can be successfully addressed. On the other hand, the information of seen verb forms can be used to generate new translations for unseen verb forms. Translation results for an English to Spanish task are reported, producing a significant performance improvement.

An ngram-based statistical machine translation decoder

In this paper we describe MARIE, an Ngram-based statistical machine translation decoder. It is implemented using a beam search strategy, with distortion (or reordering) capabilities. The underlying translation model is based on an Ngram approach, extended to introduce reordering at the phrase level. The search graph structure is designed to perform very accurate comparisons, what allows for a high level of pruning, improving the decoder efficiency. We report several techniques for efficiently prune out the search space. The combinatory explosion of the search space derived from the search graph structure is reduced by limiting the number of reorderings a given translation is allowed to perform, and also the maximum distance a word (or a phrase) is allowed to be reordered. We finally report translation accuracy results on three different translation tasks.