The lack of parallel data for many language pairs is an important challenge to statistical machine translation (SMT). One common solution is to pivot through a third language for which there exist parallel corpora with the source and target languages. Although pivoting is a robust technique, it introduces some low quality translations especially when a poor morphology language is used as the pi...

3 : Abstract The purpose of this paper is to survey the various pivot rules of the simplex method or its variants that have been developed in the last two decades, starting from the appearance of the minimal index rule of Bland. We are mainly concerned with the niteness property of simplex type pivot rules. There are some other important topics in linear programming, e.g. complexity theory or i...

We compare two implementations of a new algorithm called the pivot method for the location of the global minimum of a multiple minima problem. The pivot method uses a series of randomly placed probes in phase space, moving the worst probes to be near better probes iteratively until the system converges. The original implementation, called the ‘‘lowest energy pivot method,’’ chooses the pivot pr...

Contemporary posterior cruciate-retaining total knee designs have provided pain relief and improved knee function but have failed to reproduce the kinematics and stability of the normal nonarthritic knee. The Medial Pivot total knee design features a near constant radius of curvature of the femoral component. The tibial surface is highly congruent and asymmetric, permitting a medial pivot motio...

A pivot-based approach for bilingual lexicon extraction is based on the similarity of context vectors represented by words in a pivot language like English. In this paper, in order to show validity and usability of the pivot-based approach, we evaluate the approach in company with two different methods for estimating context vectors: one estimates them from two parallel corpora based on word as...

We introduce a new network simplex pivot rule for the shortest path simplex algorithm. This new pivot rule chooses a subset of non-basic arcs to enter into the basis simultaneously. We call to this operation multiple pivot. We show that a shortest path simplex algorithm with this pivot rule makes O(n) multiple pivots and runs in O(nm) time. This new pivot rule is based on the new concept of pse...

This paper revisits the pivot language approach for machine translation. First, we investigate three different methods for pivot translation. Then we employ a hybrid method combining RBMT and SMT systems to fill up the data gap for pivot translation, where the sourcepivot and pivot-target corpora are independent. Experimental results on spoken language translation show that this hybrid method s...