let s be a locally compact foundation semigroup with identity and                          be its semigroup algebra. let x be a weak*-closed left translation invariant subspace of    in this paper, we prove that  x  is invariantly  complemented in   if and  only if  the left ideal  of    has a bounded approximate identity. we also prove that a foundation semigroup with identity s is left amenab...

Let S be a locally compact foundation semigroup with identity and                          be its semigroup algebra. Let X be a weak*-closed left translation invariant subspace of    In this paper, we prove that  X  is invariantly  complemented in   if and  only if  the left ideal  of    has a bounded approximate identity. We also prove that a foundation semigroup with identity S is left amenab...

PURPOSE The present investigation evaluated the relation between the dynamic properties of the bilateral condyle in habitual maximum opening and closing movement and the occlusal force balance with clenching force. METHODS Nine normal adults participated in this study. The translation of bilateral condyle and the rotation of intercondylar axis in habitual maximum opening and closing movement ...

This paper presents an extension for a bilingual n-gram statistical machine translation (SMT) system based on allowing translation units with gaps. Our gappy translation units can be seen as a first step towards introducing hierarchical units similar to those employed in hierarchical MT systems. Our goal is double. On the one hand we aim at capturing the benefits of the higher generalization po...

We present a hierarchical phrase-based statistical machine translation in which a target sentence is efficiently generated in left-to-right order. The model is a class of synchronous-CFG with a Greibach Normal Form-like structure for the projected production rule: The paired target-side of a production rule takes a phrase prefixed form. The decoder for the targetnormalized form is based on an E...

There has been much recent interest in languages whose grammar is sufficiently simple that an efficient left-to-right parsing algorithm can be mechanically produced from the grammar. In this paper, we define LR(k) grammars, which are perhaps the most general ones of this type, and they provide the basis for understanding all of the special tricks which have been used in the construction of pars...

Phrase-based and hierarchical phrasebased (Hiero) translation models differ radically in the way reordering is modeled. Lexicalized reordering models play an important role in phrase-based MT and such models have been added to CKY-based decoders for Hiero. Watanabe et al. (2006) propose a promising decoding algorithm for Hiero (LR-Hiero) that visits input spans in arbitrary order and produces t...

Hierarchical phrase-based translation (Hiero for short) models statistical machine translation (SMT) using a lexicalized synchronous context-free grammar (SCFG) extracted from word aligned bitexts. The standard decoding algorithm for Hiero uses a CKY-style dynamic programming algorithm with time complexity O(n3) for source input with n words. Scoring target language strings using a language mod...

Left-to-right (LR) decoding Watanabe et al. (2006) is a promising decoding algorithm for hierarchical phrase-based translation (Hiero) that visits input spans in arbitrary order producing the output translation in left to right order. This leads to far fewer language model calls. But the constrained SCFG grammar used in LR-Hiero (GNF) with at most two non-terminals is unable to account for some...