These
<term>
models
</term>
can be viewed as pairs of
<term>
probabilistic context-free grammars
</term>
working in a ' synchronous ' way .
#5709These models can be viewed as pairs ofprobabilistic context-free grammars working in a 'synchronous' way.
model,1-2-H05-1101,ak
These
<term>
models
</term>
can be viewed as pairs of
<term>
probabilistic context-free grammars
</term>
working in a ' synchronous ' way .
#5702Thesemodels can be viewed as pairs of probabilistic context-free grammars working in a 'synchronous' way.
model,8-1-H05-1101,ak
This paper investigates some
<term>
computational problems
</term>
associated with
<term>
probabilistic translation models
</term>
that have recently been adopted in the literature on
<term>
machine translation
</term>
.
#5686This paper investigates some computational problems associated withprobabilistic translation models that have recently been adopted in the literature on machine translation.
other,1-3-H05-1101,ak
Two
<term>
hardness results
</term>
for the
<term>
class NP
</term>
are reported , along with an
<term>
exponential time lower-bound
</term>
for certain classes of
<term>
algorithms
</term>
that are currently used in the literature .
#5721Twohardness results for the class NP are reported, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the literature.
other,13-3-H05-1101,ak
Two
<term>
hardness results
</term>
for the
<term>
class NP
</term>
are reported , along with an
<term>
exponential time lower-bound
</term>
for certain classes of
<term>
algorithms
</term>
that are currently used in the literature .
#5733Two hardness results for the class NP are reported, along with anexponential time lower-bound for certain classes of algorithms that are currently used in the literature.
other,4-1-H05-1101,ak
This paper investigates some
<term>
computational problems
</term>
associated with
<term>
probabilistic translation models
</term>
that have recently been adopted in the literature on
<term>
machine translation
</term>
.
#5682This paper investigates somecomputational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation.
other,5-3-H05-1101,ak
Two
<term>
hardness results
</term>
for the
<term>
class NP
</term>
are reported , along with an
<term>
exponential time lower-bound
</term>
for certain classes of
<term>
algorithms
</term>
that are currently used in the literature .
#5725Two hardness results for theclass NP are reported, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the literature.
tech,20-1-H05-1101,ak
This paper investigates some
<term>
computational problems
</term>
associated with
<term>
probabilistic translation models
</term>
that have recently been adopted in the literature on
<term>
machine translation
</term>
.
#5698This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature onmachine translation.
tech,20-3-H05-1101,ak
Two
<term>
hardness results
</term>
for the
<term>
class NP
</term>
are reported , along with an
<term>
exponential time lower-bound
</term>
for certain classes of
<term>
algorithms
</term>
that are currently used in the literature .
#5740Two hardness results for the class NP are reported, along with an exponential time lower-bound for certain classes ofalgorithms that are currently used in the literature.