The increasing availability of large collections of bilingual parallel corpora has fostered the development of naturallanguage processing applications that address bilingual tasks, such as corpus-based machine translation, the automatic extraction of bilingual lexicons, and translation spotting [Simard, 2003]. A bilingual parallel corpus, or bitext, is a textual collection that contains pairs o...

In section 3, an algorithm performing so called generalized good translation of formal languages is given in the form of an ALGOL 60 procedure. Its description is given in section 2. It is possible to translate from a formal (context-free) language into other one with help of this algorithm if certain conditions hold for both grammars. At the same time, some parts of output text may correspond ...

In this communication, we describe some interrelations between generalized q-entropies and a generalized version of Fisher information. In information theory, the de Bruijn identity links the Fisher information and the derivative of the entropy. We show that this identity can be extended to generalized versions of entropy and Fisher information. More precisely, a generalized Fisher information ...

In the present paper, we propose the effective usage of function words to generate generalized translation rules for forest-based translation. Given aligned forest-string pairs, we extract composed tree-to-string translation rules that account for multiple interpretations of both aligned and unaligned target function words. In order to constrain the exhaustive attachments of function words, we ...

We introduced, for Translation Memory System, a statistical framework, which unifies the different phases in a Translation Memory System by letting them constrain each other, and enables Translation Memory System a statistical qualification. Compared to traditional Translation Memory Systems, our model operates at a fine grained sub-sentential level such that it improves the translation coverag...

Large bilingual parallel texts (also known as bitexts) are usually stored in a compressed form, and previous work has shown that they can be more efficiently compressed if the fact that the two texts are mutual translations is exploited. For example, a bitext can be seen as a sequence of biwords —pairs of parallel words with a high probability of cooccurrence— that can be used as an intermediat...

Considerations of the problems inherent in mechanically translating between natural languages have given rise to a software tool, PROTRAN, which runs on IBM 36O/37O, and has been used successfully to translate between a wide range of computer languages. PROTRAN is a generalized double-string syntax analyzer-synthesizer to which are given, in a language-description language, two descriptions: th...

By using the Lp(⋅)−Lp(⋅)−boundedness of a maximal operator defined on homogeneous space, it has been shown that B−B−maximal is bounded. In present paper, we aim to bring different approach boundedness generated by generalized translation under continuity assumption p(⋅)p(⋅). It noteworthy mention our weaker than uniform Hölder continuity.