### Table 1: Unambiguous BTG

2005

"... In PAGE 2: ... There exists a more elaborate version of BTG that has 4 nonterminals working together to guarantee the property of one-to-one correspon- dence between alignments and synchronous parse trees. Table1 lists the rules of this BTG. In the discussion of this paper, we will consider ITG in 2- normal form.... ..."

Cited by 11

### Table 2: The basic model with time nondeterminism

1994

Cited by 12

### Table 2: The basic model with time nondeterminism

1994

Cited by 12

### Table 1: Algorithm for identifying non-determinate G programs

"... In PAGE 3: ... Because of the fact that G allows multiple reads and writes to a single variable, race conditions may arise. An efficient algorithm to identify non-determinate programs in G is given in Table1 . This algorithm is based on propositions 1 and 2 below.... ..."

### Table 6. Ecce Non-Determinate Conjunctive Partial Deduction

1996

Cited by 27

### Table 6. Ecce Non-Determinate Conjunctive Partial Deduction

1996

Cited by 27

### Table 1: Algorithm for identifying non-determinate G programs

### Table 9: Rule Activation by the System on Unambiguous Data

1998

"... In PAGE 38: ... The rst is an instance of the frame of reference deictic relation, the second is an instance of the co-reference anaphoric relation, the third is an instance of the frame of reference anaphoric relation, and the fourth is an instance of the modify anaphoric relation. How often the system considers and actually uses each rule is shown in Table9 . Specif- ically, the column labeled Fires shows how often each rule applies, and the column labeled Used shows how often each rule is used to form the nal interpretation.... ..."

Cited by 15