Learn More
We can recover j from g(j) as follows : j, = s,j jk = jk+ 1 + gki mod 2 which gives jn-1 = gnj + gLl jnm2 = g,j + gi-l + gi-2,***. Thus On the right side of p. 505, the fifth and sixth line from the bottom, the lower error exponent E-(R) is valid for the 1 output and the upper error exponent i? (R) for the 0 output. ACKNOWLEDGMENT The authors want to thank(More)
In this paper, we present a statistical approach to machine translation. We describe the application of our approach to translation from French to English and give preliminary results. The field of machine translation is almost as old as the modern digital computer. In 1949 Warren Weaver suggested that the problem be attacked with statistical methods and(More)
An approach to automatic translation is outlined that utilizes technklues of statistical inl'ormatiml extraction from large data bases. The method is based on the availability of pairs of large corresponding texts that are translations of each other. In our case, the iexts are in English and French. Fundamental to the technique is a complex glossary of(More)
By a simple direct construction it is shown that computations done by Turing machines can be duplicated by a very simple symbol manipulation process. The process is described by a simple form of Post canonical system with some very strong restrictions. This system is <italic>monogenic</italic>: each formula (string of symbols) of the system can be affected(More)
When considering compiler optimization, there are two questions that immediately come to mind; one, why and to what extent is optimization necessary and two, to what extent is it possible. When considering the second question, one might immediately become discouraged since it is well known that the program equivalency problem is recursively unsolvable. It(More)
The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper. A procedure is given which determines all the definitions which can possibly &#8220;reach&#8221; each node of the control flow graph of the program and all the definitions that are &#8220;live&#8221; on each edge of the graph. The(More)