other,41H051101,bq 
</term>
. This paper investigates some
<term>

computational problems

</term>
associated with
<term>
probabilistic

#7438
This paper investigates somecomputational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation. 
model,81H051101,bq 
computational problems
</term>
associated with
<term>

probabilistic translation models

</term>
that have recently been adopted in

#7442
This paper investigates some computational problems associated withprobabilistic translation models that have recently been adopted in the literature on machine translation. 
other,201H051101,bq 
been adopted in the literature on
<term>

machine translation

</term>
. These
<term>
models
</term>
can be

#7454
This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature onmachine translation. 
model,12H051101,bq 
<term>
machine translation
</term>
. These
<term>

models

</term>
can be viewed as pairs of
<term>
probabilistic

#7458
Thesemodels can be viewed as pairs of probabilistic contextfree grammars working in a 'synchronous' way. 
other,82H051101,bq 
models
</term>
can be viewed as pairs of
<term>

probabilistic contextfree grammars

</term>
working in a ' synchronous ' way

#7465
These models can be viewed as pairs ofprobabilistic contextfree grammars working in a 'synchronous' way. 
other,13H051101,bq 
working in a ' synchronous ' way . Two
<term>

hardness

</term>
results for the class
<term>
NP
</term>

#7477
Twohardness results for the class NP are reported, along with an exponential time lowerbound for certain classes of algorithms that are currently used in the literature. 
other,63H051101,bq 
hardness
</term>
results for the class
<term>

NP

</term>
are reported , along with an
<term>

#7482
Two hardness results for the classNP are reported, along with an exponential time lowerbound for certain classes of algorithms that are currently used in the literature. 
other,133H051101,bq 
</term>
are reported , along with an
<term>

exponential time lowerbound

</term>
for certain classes of
<term>
algorithms

#7489
Two hardness results for the class NP are reported, along with anexponential time lowerbound for certain classes of algorithms that are currently used in the literature. 
tech,203H051101,bq 
lowerbound
</term>
for certain classes of
<term>

algorithms

</term>
that are currently used in the literature

#7496
Two hardness results for the class NP are reported, along with an exponential time lowerbound for certain classes ofalgorithms that are currently used in the literature. 