#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1947

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lalit R. Bahl, John Cocke, Frederick Jelinek, Josef Raviv
- IEEE Trans. Information Theory
- 1974

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)

- Peter F. Brown, John Cocke, +5 authors Paul S. Roossin
- Computational Linguistics
- 1990

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)

- Peter F. Brown, John Cocke, +4 authors Paul S. Roossin
- COLING
- 1988

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)

- Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, Peter W. Markstein
- Comput. Lang.
- 1981

- John Cocke, Marvin Minsky
- J. ACM
- 1964

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)

- John Cocke
- 1970

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)

- Frances E. Allen, John Cocke
- Commun. ACM
- 1976

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 “reach” each node of the control flow graph of the program and all the definitions that are “live” on each edge of the graph. The… (More)

- John Cocke, Ken Kennedy
- Commun. ACM
- 1977

A simple algorithm which uses an indexed temporary table to perform reduction of operator strength in strongly connected regions is presented. Several extensions, including linear function test replacement, are discussed. These algorithms should fit well into an integrated package of local optimization algorithms.

- David Callahan, Ken Kennedy, John Cocke
- ICPP
- 1987

- Raymond E. Miller, John Cocke
- International Sympoisum on Theoretical…
- 1972